Quantified Constraints and Containment Problems
نویسندگان
چکیده
منابع مشابه
Universally Quantified Interval Constraints
Non-linear real constraint systems with universally and/or existentially quantified variables often need be solved in such contexts as control design or sensor planning. To date, these systems are mostly handled by computing a quantifier-free equivalent form by means of Cylindrical Algebraic Decomposition (CAD). However, CAD restricts its input to be conjunctions and disjunctions of polynomial ...
متن کاملQuantified Positive Temporal Constraints
A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order without endpoints using a relational symbol ≤, logical conjunction and disjunction. This paper gives a complete complexity characterization for quantified constraint satisfaction problems (QCSP) over positive temporal languages. Alt...
متن کاملQuantified Constraints Under Perturbation
Quantified constraints (i.e., first-order formulae over the real numbers) are often exposed to perturbations: Constants that come from measurements usually are only known up to certain precision, and numerical methods only compute with approximations of real numbers. In this paper we study the behavior of quantified constraints under perturbation by showing that one can formulate the problem of...
متن کاملThe complexity of quantified constraints
Let A be an idempotent algebra on a finite domain. We combine results of Chen [11], Zhuk [24] and Carvalho et al. [7] to argue that if A satisfies the polynomially generated powers property (PGP), then QCSP(Inv(A)) is in NP. We then use the result of Zhuk to prove a converse, that if Inv(A) satisfies the exponentially generated powers property (EGP), then QCSP(Inv(A)) is co-NP-hard. Since Zhuk ...
متن کاملUniversally Quantified Constraints for Planning
In SATPLAN [4] a valid plan is encoded as a satisfying assignment of a set of propositional clauses. Unfortunately, the number of clauses is often impractically large. Even using clever, but arguably unnatural, encodings [3] can still give too many clauses. The origin of the size difficulty is simple. Planning encodings are naturally written in terms of universally quantified “lifted” clauses s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2015
ISSN: 1860-5974
DOI: 10.2168/lmcs-11(3:9)2015