Nenofex: Expanding NNF for QBF solving

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

Volumn 4996 LNCS, Issue , 2008, Pages 196-210

  Lonsing, Florian ^a   Biere, Armin ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

NEGATION NORMAL FORM (NNF); NENOFEX; QUANTIFIED BOOLEAN FORMULAE (QBF);

BOOLEAN FUNCTIONS; OPTIMIZATION; PARAMETER ESTIMATION; TREES (MATHEMATICS);

PROBLEM SOLVING;

EID: 44649145387     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79719-7_19     Document Type: Conference Paper

References (40)

1. Agrawal, V., Bushnell, M.: Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI Circuits. Kluwer, Dordrecht (2000)
2. Ayari, A., Basin, D.A.: QUBOS: Deciding quantified boolean logic using propositional satisfiability solvers. In: Aagaard, M.D., O'Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, Springer, Heidelberg (2002)
3. Benedetti, M.: Quantifier Trees for QBFs. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 378-385. Springer, Heidelberg (2005)
4. Benedetti, M.: sKizzo: A Suite to Evaluate and Certify QBFs. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 369-376. Springer, Heidelberg (2005)
5. Benedetti, M.: Experimenting with QBF-based formal verification. In: Proc. CFV 2005 (2005)
6. Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) ETAPS 1999 and TACAS 1999. LNCS, vol. 1579, Springer, Heidelberg (1999)
7. Biere, A.: Resolve and Expand. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59-70. Springer, Heidelberg (2005)
8. Bjesse, P., Borälv, A.: DAG-aware circuit compression for formal verification. In: Proc. ICCAD 2004 (2004)
9. Brummayer, R., Biere, A.: Local two-level and-inverter graph minimization without blowup. In: Proc. MEMICS 2006 (2006)
10. Bubeck, U., Kleine Büning, H.: Bounded Universal Expansion for Preprocessing QBF. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 244-257. Springer, Heidelberg (2007)
11. Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified boolean formulae. In: Proc. AAAI/IAAI 1998 (1998)
12. Darwiche, A.: Decomposable negation normal form. JACM 48(4) (2001)
13. Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. CACM 5(7) (1962)
14. Davis, M., Putnam, H.: A computing procedure for quantification theory. JACM 7(3) (1960)
15. Boy de la Tour, T.: An optimality result for clause form translation. Symb. Comput. 14(4) (1992)
16. Dershowitz, N., Hanna, Z., Katz, J.: Bounded Model Checking with QBF. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 408-414. Springer, Heidelberg (2005)
17. Eé n, N., Biere, A.: Effective Preprocessing in SAT Through Variable and Clause Elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61-75. Springer, Heidelberg (2005)
18. Egly, U., Seidl, M., Tompits, H., Woltran, S., Zolda, M.: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. In: Giunchiglia, E., Tac-chella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 214-228. Springer, Heidelberg (2004)
19. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)
20. Giunchiglia, E., Narizzano, M., Tacchella, A.: Learning for quantified boolean logic satisfiability. In: Proc. AAAI 2002 (2002)
21. Giunchiglia, E., Narizzano, M., Tacchella, A.: QBF Reasoning on Real-World Instances. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 105-121. Springer, Heidelberg (2005)
22. Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantifier structure in search based procedures for QBFs. In: Proc. DATE 2006 (2006)
23. Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas satisfiability library (QBFLIB) (2001), www.qbflib.org
24. Jussila, T., Biere, A.: Compressing BMC encodings with QBF. In: Proc. BMC 2006 (2006)
25. Kleine Büning, H., Karpinski, M., Flügel, A.: Resolution for quantified boolean formulas. Inf. Comput. 117(1) (1995)
26. Kuehlmann, A., Paruthi, V., Krohm, F., Ganai, M.K.: Robust boolean reasoning for equivalence checking and functional property verification. TCAD 21(12) (2002)
27. Kunz, W., Stoffel, D.: Reasoning in Boolean Networks: Logic Synthesis and Verification Using Testing Techniques. Kluwer, Dordrecht (1997)
28. Ladner, R.: The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing 6(3) (1977)
29. Letz, R.: Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas. In: Egly, U., Fermüller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, Springer, Heidelberg (2002)
30. Mangassarian, H., Veneris, A., Safarpour, S., Benedetti, M., Smith, D.: A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test. In: Proc. ICCAD 2007 (2007)
31. Otwell, C., Remshagen, A., Truemper, K.: An effective QBF solver for planning problems. In: MSV/AMCS (2004)
32. Plaisted, D., Greenbaum, S.: A structure-preserving clause form translation. Symb. Comput. 2(3) (1986)
33. Rintanen, J.: Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research 10 (1999)
34. Sabharwal, A., Ansótegui, C., Gomes, C., Hart, J., Selman, B.: QBF modeling: Exploiting player symmetry for simplicity and efficiency. In: Proc. SAT 2006 (2006)
35. Samer, M., Szeider, S.: Backdoor Sets of Quantified Boolean Formulas. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 230-243. Springer, Heidelberg (2007)
36. Stockmeyer, L.: The polynomial-time hierarchy. TCS 3(1) (1976)
37. Malik, S., Tang, D.: Solving Quantified Boolean Formulas with Circuit Observability Don't Cares. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 368-381. Springer, Heidelberg (2006)
38. Tseitin, G.: On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic 2 (1968)
39. Zhang, L.: Solving QBF by combining conjunctive and disjunctive normal forms. In: Proc. AAAI 2006 (2006)
40. 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, Springer, Heidelberg (2002)