A core problem in learning semantic parsers from denotations is picking out consistent logical forms—those that yield the correct denotation—from a combinatorially large space. To control the search space, previous work relied on restricted set of rules, which limits expressivity. In this paper, we consider a much more expressive class of logical forms, and show how to use dynamic programming t...

In this report we present a process language for security protocols together with an operational semantics and an alternative semantics in terms of sets of events. The denotation of process is a set of events, and as each event specifies a set of pre and postconditions, this denotation can be viewed as a Petri net. This Petri-net semantics has a strong relation to both Paulson’s inductive set o...

I present and discuss three previously unpublished manuscripts written by Bertrand Russell in 1903, not included with similar Volume 4 of his Collected Papers. One is a one-page list basic principles for “functional theory” May which partly anticipated the later Lambda Calculus. The next, catalogued under title “Proof That No Function Takes All Values”, largely explores status Cantor’s proof th...

We present an algorithm for computing directly the denotation of a modal μcalculus formula χ over the configuration graph of a pushdown system. Our method gives the first extension of the saturation technique to the full modal μ-calculus. Finite word automata are used to represent sets of pushdown configurations. Starting from an initial automaton, we perform a series of automaton manipulations...

Proof: By assumption, φinf is preserved under ultrafilter extensions. The second conjunct of θ, i.e., ∀xy.(x = y → Rxy) is also preserved under ultrafilter extension, since it is modally definable using global modality. Finally, consider the third conjunct of θ. From the fact that M |= ∀xy.(x = y → Rxy), we can derive that the denotation of R in ueM includes all pairs of ultrafilters (u, v) suc...

We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard’s ∗-autonomous category of hypercoherences. This is the first non-game-theoretic full completeness theorem for this fragment. Our main result is that every dinatural transformation between definable functors arises from the denotation of a cut-free MALL...

This paper presents the ADN-Classifier, an Automatic classification system of Spanish Deverbal Nominalizations aimed at identifying its semantic denotation (i.e. event, result, underspecified, or lexicalized). The classifier can be used for NLP tasks such as coreference resolution or paraphrase detection. To our knowledge, the ADN-Classifier is the first effort in acquisition of denotations for...

Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a ∧ b ⊃ c, then c should be an obvious implication. However, devising a tractable semantics that allows unit resolution has proven to be an elusive goal. We propose a 3-valued semantics for a tractable fragment of propositional logic that is inherently ...

The paper reviews the last IMIA-WG6 recommendations, issued along two themes: (1) how to better share common results and (2) how to conduct new research and development efforts. Some of the major discrepancies in the field are reviewed. The paper intends to offer insight into two areas, first, in the issue of knowledge representation and, second, in the science of meaning, incorporating the bro...

ing from the domain of discourse, we can say that determiner interpretations (henceforth simply called determiners) pick out binary relations on sets of individuals, on arbitrary domains of discourse E. The notation is DEAB. We call A the restriction of the quantifier and B its body. If DEAB is the translation of a simple sentence consisting of a quantified noun phrase with an intransitive verb...