A multi-engine solver for quantified boolean formulas

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

Volumn 4741 LNCS, Issue , 2007, Pages 574-589

  Pulina, Luca ^a   Tacchella, Armando ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

PERTURBATION TECHNIQUES; PROBLEM SOLVING; ROBUST CONTROL;

MULTI-ENGINE SOLVER; QUANTIFIED BOOLEAN FORMULAS (QBFS);

BOOLEAN FUNCTIONS;

EID: 38349011818     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_41     Document Type: Conference Paper

References (24)

1. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: 5th Annual ACM Symposium on the Theory of Computation (1973)
2. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
3. Gent, I.P., Nightingale, P., Rowley, A.: Encoding Quantified CSPs as Quantified Boolean Formulae. In: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004) (2004)
4. Jussila, T., Biere, A.: Compressing BMC encodings with QBF. In: Proc. 4th Intl. Workshop on Bounded Model Checking (BMC'06) (2006)
5. Ansotegui, C., Gomes, C.P., Selman, B.: Achille's heel of QBF. In: Proc. of AAAI (2005)
6. Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In: Seventeenth National Conference on Artificial Intelligence (AAAI 2000), pp. 417-422. MIT Press, Cambridge (2000)
7. Narizzano, M., Pulina, L., Taccchella, A.: QBF solvers competitive evaluation (QBFEVAL) (2003-2007), http://www.qbflib.org/qbfeval
8. Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 3 (1997)
9. Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence 126 (2001)
10. Nudelman, E., Leyton-Brown, K., Devkar, A., Shoham, Y., Hoos, H.: SATzilla: An Algorithm Portfolio for SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 13-14. Springer, Heidelberg (2005)
11. Samulowitz, H., Memisevic, R.: Learning to Solve QBF. In: AAAI'07. Proc. of 22nd Conference on Artificial Intelligence (2007)
12. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394-397 (1962)
13. Kleine-Büning, H., Karpinski, M., Flögel, A.: Resolution for Quantified Boolean Formulas. Information and Computation 117(1), 12-18 (1995)
14. Benedetti, M.: sKizzo: a Suite to Evaluate and Certify QBFs. In: Nieuwenhuis, R. (ed.) Automated Deduction - CADE-20. LNCS (LNAI), vol. 3632. Springer, Heidelberg (2005)
15. Biere, A.: Resolve and Expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542. Springer, Heidelberg (2005)
16. Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas satisfiability library (QBFLIB) (2001), www.qbflib.org
17. Narizzano, M., Pulina, L., Tacchella, A.: The third QBF solvers comparative evaluation. Journal on Satisfiability, Boolean Modeling and Computation 2, 145-164 (2006), http://jsat.ewi.tudelft.nl/
18. Kaufman, L., Rousseeeuw, P.J.: Finding Groups in Data. Wiley, Chichester (1990)
19. Witten, I.H., Frank, E.: Data Mining, 2nd edn. Morgan Kaufmann, San Francisco (2005)
20. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)
21. Cohen, W.W.: Fast effective rule induction. In: Twelfth International Conference on Machine Learning, pp. 115-123 (1995)
22. Le Cessie, S., van Houwelingen, J.C.: Ridge estimators in logistic regression. Applied Statistics 41, 191-201 (1992)
23. Aha, D., Kibler, D.: Instance-based learning algorithms. Machine Learning, 37-66 (1991)
24. Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: Proc. of Intl. Joint Conference on Artificial Intelligence (IJCAI) (2005)