Repair-based methods for quantified CSPs

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

Volumn 3709 LNCS, Issue , 2005, Pages 652-666

  Stergiou, Kostas ^a  

^a UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE; PROBLEM SOLVING; VARIATIONAL TECHNIQUES;

CONSTRAINT SATISFACTION; QUANTIFIED VARIABLES; SOLVERS;

CONSTRAINT THEORY;

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

References (13)

1. F. Benhamou and F. Goualard. Universally Quantified Interval Constraints, In Proceedings of CP-2000, pages 67-82, 2000.
2. L. Bordeaux and E. Monfroy, Beyond NP: Arc-consistency for Quantified Constraints. In Proceedings of CP-2002, 2002.
3. I. Gent, H. Hoos, A. Rowley, and K. Smyth. Using Stochastic Local Search to Solve Quantified Boolean Formulae. In Proceedings of CP-2003, pages 348-362, 2003.
4. I. Gent, P, Nightingale, and A. Rowley. Encoding Quantified CSPs as Quantified Boolean Formulae, In Proceedings of ECAI-2004, pages 176-180, 2004.
5. I. Gent, P. Nightingale, and K. Stergiou. QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. In Proceedings of IJCAI-2005 (to appear), 2005.
6. N. Jussien and O. Lhomme. Local Search with Constraint Propagation and Conflict-based Heuristics. Artificial Intelligence, 139:21-45, 2002.
7. N. Mamoulis and K. Stergiou. Algorithms for Quantified Constraint Satisfaction Problems. In Proceedings of CP-2004, pages 752-756, 2004.
8. S. Minton, A. Philips, M. Johnston, and P. Laird. Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems. Journal of Artificial Intelligence Research, 1:1-15, 1993.
9. S. Ratschan. Quantified Constraints under Perturbations. Journal of Symbolic Computation, 33(4):493-505, 2002.
10. A. Schaerf. Combining Local Search and Look-ahead for Scheduling and Constraint Satisfaction Problems. In Proceedings of IJCAI-97, pages 1254-1259, 1997.
11. B. Selman and H. Kautz. Domain-independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. In Proceedings of IJCAI-93, pages 290-295, 1993.
12. G. Verfaillie and T. Schiex. Solution Reuse in Dynamic Constraint Satisfaction Problems. In Proceedings of AAAI-94, pages 307-312, 1994.
13. M. Yokoo. Weak-commitment Search for Solving Constraint Satisfaction Problems. In Proceedings of AAAI-1994, pages 313-318, 1994.