Integrating dependency schemes in search-based QBF solvers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6175 LNCS, Issue , 2010, Pages 158-171

  Lonsing, Florian ^a   Biere, Armin ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE NORMAL FORMS; CORE PART; DEPENDENCY GRAPHS; DPLL ALGORITHM; QBF SOLVERS; SOLVER PERFORMANCE; VARIABLE DEPENDENCIES;

BOOLEAN FUNCTIONS; GRAPHIC METHODS; PROFITABILITY; PROGRAM PROCESSORS;

TREES (MATHEMATICS);

EID: 77954969073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14186-7_14     Document Type: Conference Paper

References (33)

1. Ayari, A., Basin, D.A.: QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers. In: Aagaard, M., O'Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 187-201. Springer, Heidelberg (2002)
2. Benedetti, M.: Quantifier Trees for QBFs. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 378-385. Springer, Heidelberg (2005)
3. Bhalla, A., Lynce, I., de Sousa, J.T., Marques-Silva, J.: Heuristic-Based Backtracking Relaxation for Propositional Satisfiability. Journal of Automated Reasoning (JAR) 35(1-3), 3-24 (2005) (Pubitemid 44619277)
4. Biere, A.: Resolve and Expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59-70. Springer, Heidelberg (2005)
5. Bubeck, U., Büning, H.K.: Bounded Universal Expansion for Preprocessing QBF. In: Marques-Silva, Sakallah (eds.) [25], pp. 244-257.
6. Kleine Büning, H., Karpinski, M., Flögel, A.: Resolution for Quantified Boolean Formulas. Inf. Comput. 117(1), 12-18 (1995)
7. Cadoli, M., Giovanardi, A., Schaerf, M.: An Algorithm to Evaluate Quantified Boolean Formulae. In: AAAI/IAAI, pp. 262-267 (1998)
8. Egly, U., Seidl, M., Tompits, H., Woltran, S., Zolda, M.: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. In: Giunchiglia, Tacchella (eds.) [17], pp. 214-228
9. Egly, U., Seidl, M., Woltran, S.: A Solver for QBFs in Nonprenex Form. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI. FAIA, vol. 141, pp. 477-481. IOS Press, Amsterdam (2006)
10. Gent, I.P., Giunchiglia, E., Narizzano, M., Rowley, A.G.D., Tacchella, A.: Watched Data Structures for QBF Solvers. In: Giunchiglia, Tacchella (eds.) [17], pp. 25-36 (2003)
11. Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas Satisfiability Library, QBFLIB (2001), http://www.qbflib.org
12. Giunchiglia, E., Narizzano, M., Tacchella, A.: QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 364-369. Springer, Heidelberg (2001)
13. Giunchiglia, E., Narizzano, M., Tacchella, A.: Learning for Quantified Boolean Logic Satisfiability. In: AAAI/IAAI, pp. 649-654 (2002)
14. Giunchiglia, E., Narizzano, M., Tacchella, A.: Monotone Literals and Learning in QBF Reasoning. In: Wallace (ed.) [31], pp. 260-273 (2004)
15. Giunchiglia, E., Narizzano, M., Tacchella, A.: Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas. J. Artif. Intell. Res. (JAIR) 26, 371-416 (2006)
16. Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantifier Structure in Search-Based Procedures for QBFs. TCAD 26(3), 497-507 (2007)
17. Giunchiglia, E., Tacchella, A. (eds.): SAT 2003. LNCS, vol. 2919. Springer, Heidelberg (2004)
18. Goultiaeva, A., Iverson, V., Bacchus, F.: Beyond CNF: A Circuit-Based QBF Solver. In: Kullmann (ed.) [21], pp. 412-426
19. Pan, G., Vardi, M.Y.: Symbolic Decision Procedures for QBF. In: Wallace (ed.) [31], pp. 453-467
20. Jussila, T., Biere, A., Sinz, C., Kröning, D., Wintersteiger, C.M.: A First Step Towards a Unified Proof Checker for QBF. In: Marques-Silva, Sakallah (eds.) [25], pp. 201-214
21. Kullmann, O. (ed.): SAT 2009. LNCS, vol. 5584. Springer, Heidelberg (2009)
22. Letz, R.: Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas. In: Egly, U., Fermüller, C.G. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 160-175. Springer, Heidelberg (2002)
23. Lonsing, F.: DepQBF 0.1 Source Code (2010), http://fmv.jku.at/depqbf/
24. Lonsing, F., Biere, A.: A Compact Representation for Syntactic Dependencies in QBFs. In: Kullmann (ed.) [21], pp. 398-411
25. Marques-Silva, J., Sakallah, K.A. (eds.): SAT 2007. LNCS, vol. 4501. Springer, Heidelberg (2007)
26. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: DAC 2001, pp. 530-535. ACM, New York (2001)
27. Samer, M.: Variable Dependencies of Quantified CSPs. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 512-527. Springer, Heidelberg (2008)
28. Pigorsch, F., Scholl, C.: Exploiting structure in an AIG based QBF solver. In: DATE, pp. 1596-1601. IEEE, Los Alamitos (2009)
29. Pipatsrisawat, K., Darwiche, A.: A Lightweight Component Caching Scheme for Satisfiability Solvers. In: Marques-Silva, Sakallah (eds.) [25], pp. 294-299
30. Samer, M., Szeider, S.: Backdoor Sets of Quantified Boolean Formulas. Journal of Automated Reasoning (JAR) 42(1), 77-97 (2009)
31. Wallace, M. (ed.): CP 2004. LNCS, vol. 3258. Springer, Heidelberg (2004)
32. Zhang, L., Malik, S.: Conflict Driven Learning in a Quantified Boolean Satisfiability Solver. In: Pileggi, L.T., Kuehlmann, A. (eds.) ICCAD, pp. 442-449. ACM, New York (2002)
33. Zhang, L., Malik, S.: Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 200-215. Springer, Heidelberg (2002)