QCSP made practical by virtue of restricted quantification

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 38-43

  Benedetti, Marco ^a   Lallouet, Arnaud ^a   Vautard, Jérémie ^a  

^a UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL CONSTRAINTS; QUANTIFIED CONSTRAINT SATISFACTION PROBLEMS; SEARCH SPACES; STATE-OF-THE-ART PERFORMANCE;

ARTIFICIAL INTELLIGENCE;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84880887786     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. C. Ansótegui, C. Gomes, and B. Selman. The Achilles' Heel of QBF. In Proc. of AAAI, 2005.
2. K.R. Apt. The essence of constraint propagation. Theoretical Computer Science, 221(1-2):179-210, 1999. (Pubitemid 129608966)
3. M. Benedetti, A. Lallouet, and J. Vautard. Problem Modeling and Solving in QCSP made Practical. Tech. Rep. 11-06, LIFO, Univ. Orleans, 2006.
4. M. Benedetti, A. Lallouet, and J. Vautard. Reusing CSP propagators for QCSPs. In Proc. of the Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming (CSCLP-06), Portugal, 2006.
5. M. Benedetti, A. Lallouet, and J. Vautard. QeCode's web page, www.univ-orleans.fr/lifo/members/vautard/qecode. 2006.
6. M. Benedetti. Evaluating QBFs via Symbolic Skolemization. In Proc. of LPAR'04. 2005.
7. M. Benedetti. Abstract Branching for Quantified Formulas. In Proc. of AAAI, 2006.
8. C. Bessiere and G. Verger. Strategic constraint satisfaction problems. In Proc. of CP'06 Workshop on Modelling and Reformulation, Nantes, France, 2006.
9. A. Biere. Resolve and Expand. In Proc. of SAT, 2004.
10. L. Bordeaux and E. Monfroy. Beyond NP: Arc-consistency for quantified constraints. In Proc. of CP, 2002.
11. L. Bordeaux. Boolean and Interval Propagation for Quantified Constraints. In Proc. of Workshop on Quantification in Constraint Programming, Barcelona, Spain, 2005.
12. M. Cadoli, T. Eiter, and G. Gottlob. Default logic as a query language. IEEE Trans. on Knowledge and Data Engineering, 9(3):448-463, 1997. (Pubitemid 127767725)
13. I. P. Gent and A. G. Rowley. Encoding Connect-4 using Quantified Boolean Formulae. Proc. of 2nd Int. Workshop on Modelling and Reformulating CSPs, Ireland, 2003.
14. I. P. Gent, P. Nightingale, and A. Rowley. Encoding quantified CSPs as Quantified Boolean Formulae. In Proc. of ECAI, 2004.
15. I. P. Gent, C. Jefferson, and I. Miguel. Minion: Lean, Fast Constraint Solving. Proc. of ECAI, 2006.
16. E. Giunchiglia, M. Narizzano, and A. Tacchella. Quantified Boolean Formula library, www.qbflib.org, 2001.
17. H. A. Kautz and B. Selman. Planning as satisfiability. In Proc. of ECAI, 1992.
18. P. Nightingale. Consistency for Quantified Constraint Satisfaction Problems. In Proc. of CP, 2005.
19. D. A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation. Journal of Symbolic Computation, pages 293-304, 1986.
20. A. Sabharwal, C. Ansotegui, C. P. Gomes, J. W. Hart, and B. Selman. QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. Proc. of SAT, 2006.
21. C. Schulte and G. Tack. Views and iterators for generic constraint implementations. In Proc. of CP, 2005.
22. L. Zhang. Solving QBF with Combined Conjunctive and Disjunctive Normal Form. In Proc. of AAAI, 2006.