A Logical Approach to the Query Completeness.
by Sergey Paramonov
Abstract: It is quite common in data management or database theory to compute the most complete answer but is it really to prove that the answer is complete? We will discuss different natural definitions that could be given to the problem of “the Query Completeness” and we will also have a look at different facets of the problems. Several approaches to this problem are analyzed with respect to computational complexity, input parameters and representation. Possible generalization and related problems are briefly indicated.
Translating Natural Language
by Xichuan Wu
Abstract: As an important sub-discipline of natural language processing (NLP), statistical machine translation (SMT) has shown to be cost-efficient while at the same time achieving reasonable translation quality. In addition to word- and phrase-based translation models, synchronous context-free grammar (SCFG) is introduced to capture some syntactic features of natural language, e.g. the reordering of phrases and words in translation. In this talk, 1) the main ideas of SMT will be sketched, which is followed by 2) a more detailed illustration of SCFG training procedure.
Life during and (shortly) after the EMCL
by Marco Gario
Abstract: Looking back to my EMCL time, I see two years full of interesting challenges and opportunities. In this talk I try to provide an overview of my EMCL experience, and try to share tips and knowledge that I hope will help students get the best out of this master program.
The RegularGcc Matrix Constraint
by Ronald de Haan
Abstract: In many practical constraint satisfaction problems, a pattern that commonly occurs is a matrix of variables with constraints on the rows and columns. The combination of such row and column constraints is called a matrix constraint. We study one particular matrix constraint, with regular language constraints on the rows and global cardinality constraints on the columns (the RegularGcc matrix constraint). We will formally define the constraint, and demonstrate where the constraint can be used with a concrete example. We will also discuss the complexity of propagation for this constraint.
Runtime verification meets Android security
by Gil Vegliach
Abstract: We introduce a dynamic security mechanism for Android-powered devices based on runtime verification, which lets users monitor the behaviour of installed applications. The general idea and a prototypical implementation are outlined, an application to real-world security threats shown, and the underlying logical foundations, relating to the employed specification formalism, sketched.
by Alina Petrova
Abstract: Textual Entailment (TE) is one of the new areas of Natural Language Processing. It seeks to automatically detect logical entailment relation between pieces of text. The dominating approach towards TE uses machine learning techniques. We will discuss which linguistic features are relevant with respect to TE task.