Encoding quantified CSPs as quantified boolean formulae

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 176-180

  Gent, Ian P ^a   Nightingale, Peter ^a   Rowley, Andrew ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; SIGNAL ENCODING;

DIRECT ENCODING; ENCODINGS; GENERALISATION; ORDERS OF MAGNITUDE; QUANTIFIED BOOLEAN FORMULAS; QUANTIFIED CONSTRAINTS SATISFACTION PROBLEMS; QUANTIFIED CSPS; SATISFIABILITY; SIMPLE++; TEST INSTANCES;

ENCODING (SYMBOLS);

EID: 85017370675     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M.S.O. Molloy, and Y.C. Stamatiou, Random constraint satisfaction: A more accurate picture, in Proc. CP97, pp. 107-120. Springer, (1997).
2. L. Bordeaux and E. Monfroy, Beyond NP: Arc-consistency for quantified constraints, in Proc. CP-2002, pp. 371-386, (2002).
3. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi, 'An algorithm to evaluate quantified boolean formulae and its experimental evaluation', Journal of Automated Reasoning, 28(2), 101-142, (2002).
4. P. Jeavons F. Boerner, A. Bulatov and A. Krokhin, 'Quantified constraints: Algorithms and complexity', in Proc. CSL-2003, (2003).
5. A. Frisch and T.J. Peugniez, 'Solving non-boolean satisfiability problems with stochastic local search', in Proc. IJCAI-01, pp. 282-288, (2001).
6. R. Genisson and P. Jegou, 'Davis and Putnam were already forward checking', in Proc. ECAI-96, pp. 180-184, (1996).
7. I.P. Gent, 'Arc consistency in SAT', in Proceedings of ECAI 2002, pp. 121-125. IOS Press, (2002).
8. I.P. Gent and A.G.D. Rowley, 'Encoding connect-4 using quantified boolean formulae', in Modelling and Reformulating Constraint Satisfaction Problems, ed., A.M. Frisch, pp. 78-93, (2003).
9. I.P. Gent and T. Walsh, 'Beyond NP: The QSAT phase transition', in Proceedings of the 16th National Conference on AI, pp. 648-653. American Association for Artificial Intelligence, (1999).
10. E. Guinchiglia, M. Narizzano, and A. Tacchella, 'Backjumping for quantified Boolean logic satisfiability', in IJCAI-01, pp. 275-281, (2001).
11. Nikos Mamoulis and Kostas Stergiou, 'Algorithms for quantified constraint satisfaction problems', Technical Report APES-78-2004, APES Research Group, (January 2004).
12. P. Prosser, 'Hybrid algorithms for the constraint satisfaction problem', Computational Intelligence, 9, 268-299, (1993).
13. T. Walsh, 'SAT v CSP', in Proc. CP-2000, pp. 441-456, (2000).