The generalization of the constraint satisfaction problem with universal quanti ers is a challenging PSPACE-complete problem, which is interesting theoretically and also relevant to solving other PSPACE problems arising in AI, such as reasoning with uncertainty, and multiplayer games. In this paper I de ne two new levels of consistency for QCSP, and give an algorithm to enforce consistency for ...

This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a speciic calculation (\subsearch") that is performed at each inference step by any existing satissability algorithm. We then show that for realistic problems, the time spent on subsearch can be expected to dominate the computational cost...

We present a new method for partial order planning in the STRIPS/SNLP style. Our contribution centers on how we drop the closed world assumption while adding a useful class of universally quantiied propositions to the representation of states and actions. These quan-tiied expressions allow expression of partially closed worlds , such as \block A has no other block on it", or \F is the only Tex ...

In this paper we introduce a variant of the quantiier elimination problem for the rst order theory of real closed elds. Instead of considering a single quantiied formula, we consider a uniform sequence of such formulas and eliminate quantiiers to obtain another uniform sequence. Our immediate motivation comes from a problem in the theory of constraint databases with real polynomial constraints....

This paper presents a speciic part of HUGG, a generation grammar for Hebrew. This part deals with determiners and quantiiers. Our main goal is to determine which set of features must be present in the input to the generation grammar to control the generation of complex determiners and quantiiers. Hebrew determiners are characterized by two properties: (1) deeniteness is marked in several places...

It is proposed to add bounded quantiications to Prolog. The main reason is one of natural expression, many algorithms are expressed more elegantly in a declarative way using bounded quantiications than using existing means, i.e., recursion. In particular this is true for numerical algorithms, an area where Prolog has been virtually unsuccessful so far. Moreover, bounded quantiication has been f...

In this paper we give perspicuous proofs of the existence of model descriptions for nite Kripke models and of Uniform Interpolation for the theories IPC K GL and S Grz using bounded bisim ulations

This is a summary of our paper \Process algebras with alternative quantii-cation over data" (Groote and Luttik (1998)). In this paper, we deene a class of process algebras with a generalised operation P that allows explicit treatment of alternative quantiication over data, and investigate the speciic subclass formed by the algebras of nite processes modulo strong bisimulation. We have shown tha...