Consistency for quantified constraint satisfaction problems

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

Volumn 3709 LNCS, Issue , 2005, Pages 792-796

  Nightingale, Peter ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; FORMAL LOGIC; GAME THEORY; PROBLEM SOLVING;

BACKTRACKING; MULTIPLAYER GAMES; PSPACE-COMPLETE PROBLEM;

CONSTRAINT THEORY;

EID: 33646204015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_66     Document Type: Conference Paper

References (8)

1. Nikos Mamoulis and Kostas Stergiou, Algorithms for Quantified Constraint Satisfaction Problems, in Proc. of the 10th CP, pages 752-756, 2004.
2. Ian P. Gent, Peter Nightingale and Kostas Stergiou, QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems, to appear in Proc. of the 19th IJCAI, 2005.
3. Lucas Bordeaux and Eric Monfroy, Beyond NP: Arc-Consistency for Quantified Constraints, in Proc. of the 8th CP, pages 371-386, 2002.
4. Christian Bessière and Jean-Charles Régin, Arc consistency for general constraint networks: preliminary results, in Proc. of the 15th IJCAI, pages 398-404, 1997.
5. Ian Gent and Andrew Rowley, Encoding Connect-4 using Quantified Boolean Formulae, APES Technical Report APES-68-2003, 2003.
6. Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp and Peter van Beek, A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint, in Proc. of the 18th IJCAI, pages 306-319, 2003.
7. Roger Mohr and Gérald Masini, Good Old Discrete Relaxation, in Proc. of the 8th ECAI, pages 651-656, 1988.
8. Peter Nightingale, Consistency for Quantified Constraint Satisfaction Problems, CP-Pod Technical Report CPPOD-11-2005, 2005. Available from http://www.dcs.stand.ac.uk/~cppod/publications/reports/