The computational complexity of propositional STRIPS planning
Artificial Intelligence
Resolution for quantified Boolean formulas
Information and Computation
The complexity of searching implicit graphs
Artificial Intelligence
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The essence of constraint propagation
Theoretical Computer Science
Beyond NP: the QSAT phase transition
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Universally Quantified Interval Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Continuous First-Order Constraint Satisfaction
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Learning for quantified boolean logic satisfiability
Eighteenth national conference on Artificial intelligence
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Extending the constraint propagation of intervals
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Improvements to the evaluation of quantified boolean formulae
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Efficient solving of quantified inequality constraints over the real numbers
ACM Transactions on Computational Logic (TOCL)
A solver for quantified Boolean and linear constraints
Proceedings of the 2007 ACM symposium on Applied computing
Solving quantified constraint satisfaction problems
Artificial Intelligence
Modeling adversary scheduling with QCSP+
Proceedings of the 2008 ACM symposium on Applied computing
Guiding Search in QCSP + with Back-Propagation
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data
ACM Transactions on Computational Logic (TOCL)
Value ordering for quantified CSPs
Constraints
Generalizing consistency and other constraint properties to quantified constraints
ACM Transactions on Computational Logic (TOCL)
Decision with uncertainties, feasibilities, and utilities: towards a unified algebraic framework
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
The complexity of constraint satisfaction games and QCSP
Information and Computation
CSP properties for quantified constraints: definitions and complexity
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
Journal of Artificial Intelligence Research
QCSP made practical by virtue of restricted quantification
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Quantified constraint satisfaction problems: from relaxations to explanations
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
QCSP-solve: a solver for quantified constraint satisfaction problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Solution directed backjumping for QCSP
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Strong controllability of disjunctive temporal problems with uncertainty
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Reusing CSP propagators for QCSPs
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Realtime online solving of quantified CSPs
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Set based robust design of mechanical systems using the quantifier constraint satisfaction algorithm
Engineering Applications of Artificial Intelligence
Constraint models for reasoning on unification in inductive logic programming
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Constraint programming for mining n-ary patterns
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Dealing with fixable and non-fixable properties in service matchmaking
ICSOC/ServiceWave'09 Proceedings of the 2009 international conference on Service-oriented computing
Beyond QCSP for solving control problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Decomposition of multi-operator queries on semiring-based graphical models
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
BlockSolve: a bottom-up approach for solving quantified CSPs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Relaxations and explanations for quantified constraint satisfaction problems
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Real-time solving of quantified CSPs based on Monte-Carlo game tree search
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Consistencies for ultra-weak solutions in minimax weighted CSPs using the duality principle
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
The generalization of the satisfiability problem with arbitrary quantifiers is a challenging problem of both theoretical and practical relevance. Being PSPACE-complete, it provides a canonical model for solving other PSPACE tasks which naturally arise in AI.Effective SAT-based solvers have been designed very recently for the special case of boolean constraints. We propose to consider the more general problem where constraints are arbitrary relations over finite domains. Adopting the viewpoint of constraint-propagation techniques so successful for CSPs, we provide a theoretical study of this problem. Our main result is to propose quantified arc-consistency as a natural extension of the classical CSP notion.