Extracting certificates from quantified boolean formulas

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 47-53

  Benedetti, Marco ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACT REPRESENTATION; EXPLICIT INFORMATION; INTRINSIC NATURE; QUANTIFIED BOOLEAN FORMULAS; SATISFIABILITY;

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; SEMANTICS;

EMBEDDED SYSTEMS;

EID: 84880713836     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. M. Benedetti. sKizzo: a QBF Decision Procedure based on Propositional Skolemization and Symbolic Reasoning. Technical Report 04-11-03, ITCirst, 2004.
2. M. Benedetti. sKizzo's web site, sra.itc.it/people/benedetti/sKizzo. 2004.
3. 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.
4. A. Biere. Resolve and Expand. In Proc. of SAT'04, 2004.
5. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transaction on Computing, C-35(8):677-691, 1986.
6. H. K. Büning and X. Zhao. On Models for Quantified Boolean Formulas. In Proc. of SAT'04, 2004.
7. I. Gent and A. Rowley. Encoding Connect-4 using Quantified Boolean Formulae. Technical Report 68-2003, APES Research Group, 2003.
8. D. Le Berre, M. Narizzano, L. Simon, and A. Tacchella. Second QBF solvers evaluation, avaliable on-line at www.qbflib.org. 2004.
9. th Conf. on Princip. and Practice of Constraint Programming, 2004.
10. J. Rintanen. Construction Conditional Plans by a Theorem-prover. Journal of A. I. Research, pages 323-352, 1999.
11. J. Rintanen. Partial implicit unfolding in the davis-putnam procedure for quantified boolean formulae. In Proceedings of the International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'01), 2001.
12. L. J. Stockmeyer and A. R. Meyer. Word Problems Requiring Exponential Time. In In 5th Annual ACM Symposium on the Theory of Computing, 1973.
13. Ingo Wegener. Branching Programs and Binary Decision Diagrams. Monographs on Discrete Mathematics and Applications. SIAM, 2000.