Resolve and expand

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 59-70

  Biere, Armin ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; OPTICAL RESOLVING POWER; PROBLEM SOLVING;

CONJUNCTIVE NORMAL FORM (CNF); QBF SOLVERS; QUANTIFIED BOOLEAN FORMULAS (QBF); SAT SOLVER;

DECISION THEORY;

EID: 26444465027     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_5     Document Type: Conference Paper

References (22)

1. th Intl. Conf. on Formal Methods in Computer-Aided Design (FMCAD'02), volume 2517 of LNCS. Springer, 2002.
2. th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), volume 1785 of LNCS. Springer, 2000.
3. th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), volume 1579 of LNCS. Springer, 1999.
4. M. Cadoli, A. Giovanardi, and M. Schaerf. An algorithm to evaluate quantified boolean formulae. In Proc. 16th National Conference on Artificial Intelligence (AAAI-98), 1998.
5. P. Chatalic and L. Simon. ZRes: The old Davis-Putnam procedure meets ZBDDs. In 17th Intl. Conf. on Automated Deduction (CADE'17), volume 1831 of LNAI, 2000.
6. P. Chauhan, E. M. Clarke, and D. Kröning. Using SAT based image computation for reachability analysis. Technical Report CMU-CS-03-151, Carnegie Mellon University, 2003.
7. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5, 1962.
8. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7, 1960.
9. E. Giunchiglia, M. Narizzano, and A. Tacchella. Learning for quantified boolean logic satisfiability. In Proc. 18th National Conference on Artificial Intelligence (AAAI'02), 2002.
10. H. Kleine Büning, M. Karpinski, and A. Flögel. Resolution for quantified boolean formulas. Information and Computation, 117, 1995.
11. D. Le Berre, L. Simon, and A. Tacchella. Challenges in the QBF arena: the SAT'03 evaluation of QBF solvers. In Proc. 6th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'03), volume 2919 of LNCS. Springer, 2003.
12. R. Letz. Lemma and model caching in decision procedures for quantified boolean formulas. In Proc. Intl. Conf. on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX'02), volume 2381 of LNCS. Springer, 2002.
13. K. L. McMillan. Symbolic Model Checking: An approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.
14. th Intl. Conf. on Computer-Aided Verification (CAV'02), volume 2404 of LNCS. Springer, July 2002.
15. M. Mneimneh and K. Sakallah. Computing vertex eccentricity in exponentially large graphs: QBF formulation and solution. In Proc. 6th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT03), volume 2919 of LNCS. Springer, 2003.
16. D. Plaisted, A. Biere, and Y. Zhu. A satisfiability procedure for quantified boolean formulae. Discrete Applied Mathematics, 130(2), 2003.
17. J. Rintanen. Partial implicit unfolding in the Davis-Putnam procedure for quantified boolean formulae. In International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'01), 2001.
18. W. J. Savitch. Relation between nondeterministic and deterministic tape complexity. Journal of Computer and System Sciences, 4, 1970.
19. R. Sekar, I. V. Ramakrishnan, and A. Voronkov. Term indexing. In Handbook of Automated Reasoning, volume II. North-Holland, 2001.
20. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time. In 5th Annual ACM Symposium on the Theory of Computing, 1973.
21. th Intl. Conf. on Computer Aided Conf. Verification (CAV'00), volume 1855 of LNCS. Springer, 2000.
22. L. Zhang and S. Malik. Conflict driven learning in a quantified boolean satisfiability solver. In Proc. Intl. Conf. on Computer-Aided Design (ICCAD'02), 2002.