I analyze distributive universal quantifiers like ‘each’ and ‘every’ in terms of iterated dynamic update. I argue that this minor adjustment to standard dynamic setups has at least two empirical advantages. First, because information flows forward through the universal computation, anaphoric elements can assume “quantifier-internal” interpretations [1]. Second, because conjunction is usually an...

We consider the extension of Boolean circuits to quantified Boolean circuits by adding universal and existential quantifier nodes with semantics adopted from quantified Boolean formulas (QBF). The concept allows not only prenex representations of the form ∀x1∃y1...∀xn∃yn c where c is an ordinary Boolean circuit with inputs x1, ..., xn, y1, ..., yn. We also consider more general non-prenex norma...

Induction plays a key role for reasoning in many areas of mathematics and computer science. A central problem for the automation of proof by induction is the non-analytic nature of induction invariants. In this paper we present an algorithm for proving universal statements by induction that separates this problem into two phases. The first phase consists of a structural analysis of witness term...

This paper deals with a problem from discrete-time robust control which requires the solution of constraints over the reals that contain both universal and existential quantifiers. For solving this problem we formulate it as a program in a (fictitious) constraint logic programming language with explicit quantifier notation. This allows us to clarify the special structure of the problem, and to ...

This paper discusses the use of XSLT stylesheets as a filtering mechanism for refining the results of user queries on treebanks. The discussion is within the context of the TIGER treebank, the associated search engine and query language, but the general ideas can apply to any search engine for XML-encoded treebanks. It will be shown that important classes of linguistic phenomena can be accessed...

Recent developments in fast propositional satisfiability solvers and proof-generating decision procedures have inspired new variations on the traditional Nelson-Oppen style of theorem provers. In an earlier paper, we described the design and performance of our explicating theorem prover Verifun for quantifier-free formulas over the theories of equality, rational linear arithmetic, and arrays. I...

I propose an analysis of verb phrases called Ground Promotion constructions (cf. McIntyre (2007)) or involving ’unpredicated particles’ (cf. Levin and Sells (2009)) at the syntaxsemantics interface. The interface framework combines principles of Minimalist Syntax and Distributed Morphology with Discourse Representation Theory. The analysis follows the hypothesis of a parallelism between the ver...

Conservativity has been proposed as a universal property of natural language determiners, so it is possible that children apply it to quantifier interpretations from a young age. Using a picture verification task and sentences using the conservative determiner al (all) and the non-conservative quantificational adverb alleen (only), we tested whether or not children interpreted quantifiers conse...

In this paper, we extend circumscription [McCarthy, 80] to a propositional modal logic of knowledge of one agent. Instead of circumscribing a predicate, we circumscribe the knowledge operator "K" in a formula. In order to have a nontrivial circumscription schema, we extend $5 modal logic of knowledge by adding another modality "Val" and a universal quantifier over base sentences (sentences whic...

This article presents a technique for proving problems hard for classes of the polynomial hierarchy or for PSPACE. The rationale of this technique is that some problem restrictions are able to simulate existential or universal quantifiers. If this is the case, reductions from Quantified Boolean Formulae (QBF) to these restrictions can be transformed into reductions from QBFs having one more qua...