Boolean propagation based on literals for quantified boolean formulae

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 452-456

  Stéphan, Igor ^a  

^a UNIVERSITÉ D'ANGERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE SYSTEM; LITERALS; PROPAGATION RULE; QUANTIFIED BOOLEAN FORMULAS; RULE SET; SET OF RULES;

BOOLEAN ALGEBRA;

EID: 84886005984     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (27)

1. S. Abdennadher and C. Rigotti, 'Automatic generation of propagation rules for finite domains', in Principles and Practice of Constraint Programming, pp. 18-34, (2000).
2. C. Ansotegui, C. Gomes, and B. Selman, 'Achilles' heel of qbf', in AAAI, (2005).
3. B. Apsvall, M. Plass, and R. Tarjan, 'A linear-time algorithm for testing the truth of certain quantified boolean formulas and its evaluation', Information Processing Letters, 8, 121-123, (1979).
4. K.R. Apt, 'The essence of constraint propagation', Theoretical Computer Science, 221(1-2), 179-210, (1999).
5. K.R. Apt, 'Some remarks on boolean constraint propagation', in New trends in constraints, volume 1865, Springer-Verlag, (2000).
6. K.R. Apt and E. Monfroy, 'Constraint programming viewed as rulebased programming', Theory and Practice of Logic Programming (TPLP), 1(6), 713-750, (2001).
7. M. Benedetti, 'Evaluating QBFs via Symbolic Skolemization', in Proc. of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR04), number 3452 in LNCS, Springer, (2005).
8. M. Benedetti, 'Extracting Certificates from Quantified Boolean Formulas', in Proc. of 9th International Joint Conference on Artificial Intelligence (IJCAI05), (2005).
9. M. Benedetti, 'Quantifier Trees for QBFs', in Proc. of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT05), (2005).
10. A. Biere, 'Resolve and expand', in SAT, (2004).
11. H. K. Büning, M. Karpinski, and A. Flögel, 'Resolution for quantified boolean formulas', Information and Computation, 117(1), 12-18, (1995).
12. L. Bordeaux, 'Boolean and interval propagation for quantified constraints', in First International Workshop on Quantification in Constraint Programming, (2005).
13. 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).
14. M. Davis, G. Logemann, and D. Loveland, 'A machine program for theorem-proving', Communication of the ACM, 5, (1962).
15. M. Davis and H. Putnam, 'A computing procedure for quantification theory', Journal of the ACM, 7(3), 201-215, (July 1960).
16. T. Frühwirth, 'Theory and practice of constraint handling rules', Journal of Logic Programming, 37(1-3), 95-138, (1998).
17. E. Giunchiglia, M. Narizzano, and A. Tacchella, 'Backjumping for quantified boolean logic satisfiability', Artificial Intelligence, 145, 99-120, (2003).
18. F. Letombe, 'Une heuristique de branchement dirigée vers les formules horn renommables quantifiées', in RJCIA05, pp. 183-196, (2005).
19. R. Letz, 'Lemma and model caching in decision procedures for quantified boolean formulas.', in TABLEAUX, pp. 160-175, (2002).
20. G. Pan and M.Y. Vardi, 'Symbolic decision procedures for qbf', in International Conference on Principles and Practice of Constraint Programming, (2004).
21. D.A. Plaisted, A. Biere, and Y. Zhu, 'A staisfiability procedure for quantified boolean formulae', Discrete Applied Mathematics, 130, 291-328, (2003).
22. J. Rintanen, 'Improvements to the evaluation of quantified boolean formulae', in IJCAI, pp. 1192-1197, (1999).
23. J. Rintanen, 'Partial implicit unfolding in the davis-putnam procedure for quantified boolean formulae', in Workshop on Theory and Applications of QBF, Int. Join Conference on Automated Reasoning, Sienna, Italia, (2001).
24. J.A. Robinson, 'A machine-oriented logic based on the resolution principle', JACM, 12(1), 23-41, (1965).
25. Mary Sheeran and Gunnar Stålmarck, 'A tutorial on Stålmarck's proof procedure for propositional logic', in Formal Methods in Computer-Aided Design, eds., G. Gopalakrishnan and P. Windley, volume 1522, 82-99, Springer-Verlag, Berlin, (1998).
26. I. Stéphan, 'Algorithmes d'élimination de quantificateurs pour le calcul des politiques des formules booléennes quantifiées', in Premières Journées Francophones de Programmation par Contraintes, (2005).
27. I. Stéphan, 'Finding models for quantified boolean formulae', in First International Workshop on Quantification in Constraint Programming, (2005).