Algorithms for quantified constraint satisfaction problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 752-756

  Mamoulis, Nikos ^a   Stergiou, Kostas ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LEARNING ALGORITHMS;

BOOLEAN DOMAIN; NP COMPLETE; ORDERS OF MAGNITUDE; PSPACE-COMPLETE; QUANTIFIED BOOLEAN FORMULAS; QUANTIFIED CONSTRAINT SATISFACTION PROBLEMS; REASONING TASKS; SEARCH ALGORITHMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33750291991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_60     Document Type: Article

References (6)

1. C. Bessière and J.C. Régin. Refining the basic constraint propagation algorithm. In Proceedings of IJCAI-2001, pages 309-315, 2001.
2. F. Boerner, A. Bulatov, P. Jeavons, and A. Krokhin. Quantified constraints: algorithms and complexity. In Proceedings of CSL-2003, pages 244-258, 2003.
3. L. Bordeaux and E. Monfroy. Beyond NP: Arc-consistency for quantified constraints. In Proceedings of CP-2002, 2002.
4. E. Freuder. Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of AAAI-91, pages 227-233, 1991.
5. I. Gent, P. Nightingale, and A. Rowley. Encoding quantified csps as quantified boolean formulae. In Proceedings of ECAI-2004, 2004.
6. N. Mamoulis and K. Stergiou. Algorithms for quantified csps. Technical Report APES-78-2004, APES Research Group, February 2004. Available from http://www.dcs.st-and.ac.uk/∼apes/apesreports.html.