Generalizing consistency and other constraint properties to quantified constraints

ACM Transactions on Computational Logic

Volumn 10, Issue 3, 2009, Pages

  Bordeaux, Lucas ^a,c   Cadoli, Marco ^b   Mancini, Toni ^b  

^a MICROSOFT RESEARCH   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Constraint satisfaction; Quantified Boolean formulae; Quantified constraints

Indexed keywords

BASIC CONCEPTS; BASIC PROPERTIES; COMPLEXITY RESULTS; CONSTRAINT SATISFACTION; CONSTRAINT SATISFACTION PROBLEMS; POLYNOMIAL-TIME; QUANTIFIED BOOLEAN FORMULAE; QUANTIFIED BOOLEAN FORMULAS; QUANTIFIED CONSTRAINTS; REASONING METHODS; SYSTEMATIC STUDY;

BOOLEAN FUNCTIONS; COMPUTER OPERATING PROCEDURES; POLYNOMIAL APPROXIMATION;

STEELMAKING;

EID: 67249118153     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1507244.1507247     Document Type: Article

References (32)

1. ANSÓTEGUI, C., GOMES,C.P., AND SELMAN, B. 2005. The Achilles' heel of QBF. In Proceedings of the American Conference on Artificial Intelligence (AAAI) AAAI Press, 275-281.
2. AUDEMARD, G., JABBOUR,S., AND SAIS, L. 2007. Symmetry breaking in quantified Boolean formulae. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) Morgan Kaufmann, 2262-2267.
3. BACCHUS,F. AND STERGIOU, K. 2007. Solution directed backjumping for QCSP. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP) Springer, 148-163.
4. BENEDETTI, M. 2004. Evaluating QBF via symbolic skolemization. In Proceedings of the Inter- nationl Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) Springer, 285-300.
5. BENEDETTI, M., LALLOUET, A., AND VAUTARD, J. 2007. QCSP made practical by virtue of restricted quantification. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) Morgan Kaufmann, 38-43.
6. BORDEAUX, L., CADOLI, M., AND MANCINI, T. 2004. Exploiting fixable, removable and determined values in constraint satisfaction problems. In Proceedings of the International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) Springer, 270-284.
7. BORDEAUX, L., CADOLI, M., AND MANCINI, T. 2005. CSP properties for quantified constraints: Definitions and complexity. In Proceedings of the American Conference on Artificial Intelligence (AAAI) AAAI Press, 360-365.
8. BORDEAUX,L. AND MONFROY, E. 2002. Beyond NP: Arc-Consistency for quantified constraints. In Proceedings ofthe International Conference on Principles and Practice of Constraint Programming (CP) Springer, 371-386.
9. BORDEAUX,L. AND ZHANG, L. 2007. A solver for quantified Boolean and linear constraints. In Proceedings of the International Symposium on Applied Computing (SAC) ACM, to appear.
10. BÖRNER, F., BULATOV, A., JEAVONS,P., AND KROKHIN, A. 2003. Quantified constraints: Algorithms and complexity. In Proceedings of the International Conference on Computer Science Logic (CSL) Springer, 58-70.
11. BUENING, H. K., KARPINSKI, M., AND FLOGEL, A. 1995. Resolution for quantified Boolean formulas. Inf. Comput. 117, 1, 12-18.
12. CADOLI, M., GIOVANARDI, A., AND SCHAERF, M. 1999. An algorithm to evaluate quantified Boolean formulae. In Proceedings of the American Conference on Artificial Intelligence (AAAI) AAAI/MIT Press, 262-267.
13. CADOLI, M., SCHAERF, M., GIOVANARDI, A., AND GIOVANARDI, M. 2002. An algorithm to evaluate quantified Boolean formulae and its experimental evaluation. J. Autom. Reason. 28, 2, 101-142.
14. CHEN, H. 2004a. Collapsibility and consistency in quantified constraint satisfaction. In Proceedings of the American Conference on Artificial Intelligence (AAAI) AAAI Press, 155-160.
15. CHEN, H. 2004b. Quantified constraint satisfaction and bounded treewidth. In Proceedings of the European Conference on Artificial Intelligence (ECAI) IOS Press, 161-165.
16. FERGUSON,A. AND O'SULLIVAN, B. 2007. Quantified constraint satisfaction problems: From relaxations to explanations. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) Morgan Kaufmann, 74-79.
17. FISCHER,M.J. AND RABIN, M. O. 1974. Super-Exponential complexity of presburger arithmetics. in Complexity ofComputation,R. Karp, Ed. 27-41.
18. FREUDER, E. C. 1991. Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of the American Conference on Artificial Intelligence (AAAI) AAAI Press, 227-233.
19. GENT, I., NIGHTINGALE,P., AND STERGIOU, K. 2005. QCSP-Solve: A solver for quantified constraint satisfaction problems. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) Morgan Kaufmann, 138-143.
20. GENT, I. P., NIGHTINGALE,P., AND ROWLEY, A. 2004. Encoding quantified CSPS as quantified Boolean formulae. In Proceedings of the European Conference on Artificial Intelligence (ECAI) IOS Press, 176-180.
21. MACKWORTH, A. 1977. Consistency in networks of relations. Artif. Intell. 8, 99-118.
22. MAMOULIS,N. AND STERGIOU, K. 2004. Algorithms for quantified constraint satisfaction problems. Tech. rep. APES-79-2004, Apes Research Group.
23. MONASSON, R., ZECCHINA, R., KIRKPATRICK, S., SELMAN,B., AND TROYANSKY, L. 1999. Determining computational complexity from characteristic 'phase transitions'. Nature 400, 133-137.
24. NIGHTINGALE, P. 2005. Consistency for quantified constraint satisfaction problems. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP) Springer, 792-796.
25. NIGHTINGALE, P. 2007. Consistency and the quantified constraint satisfaction problem. Ph.D. thesis, University of St Andrews.
26. PAPADIMITRIOU, C. H. 1994. Computational Complexity. Addison Wesley RINTANEN, J. 1999. Improvements to the Evaluation of quantified Boolean formulae. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) Morgan Kaufmann, 1192-1197.
27. SAMULOWITZ,H. AND BACCHUS, F. 2006. Binary clause reasoning in QBF. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT) Springer, 353-367.
28. SAMULOWITZ, H., DAVIES,J., AND BACCHUS, F. 2006. Preprocessing QBF. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP) Springer, 514-529.
29. STOCKMEYER, L. J. 1976. The polynomial-time hierarchy. Theor. Comput. Sci. 3, 1, 1-22.
30. STOCKMEYER,L. J. AND MEYER, A. R. 1973. Word problems requiring exponential time: Preliminary report. In Proceedings of the Symposium on Theory of Computing (STOC) ACM, 1-9.
31. VERGER,G. AND BESSIERE, C. 2006. A bottom-up approach for solving quantified CSPs. In Proceedings of the International Conference on Principles and Practice ofConstraint Programming (CP) Springer, 635-649.
32. ZHANG, L. 2006. Solving QBF by combining conjunctive and disjunctive normal forms. In Proceedings of the American Conference on Artificial Intelligence (AAAI)