Deciding effectively propositional logic using DPLL and substitution sets

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

Volumn 5195 LNAI, Issue , 2008, Pages 410-425

  De Moura, Leonardo ^a   Bjørner, Nikolaj ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; DATA STRUCTURES; DIFFERENTIATION (CALCULUS); FILE ORGANIZATION; MATHEMATICAL TECHNIQUES; SET THEORY;

AUTOMATED REASONING; COMBINING TECHNIQUES; CONSTRAINT PROPAGATION; DECISION PROCEDURES; FINITE SETS; JOINT CONFERENCE; LITERALS; PROPOSITIONAL LOGICS;

BINARY DECISION DIAGRAMS;

EID: 53049092885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71070-7_35     Document Type: Conference Paper

References (18)

1. Lewis, H.R.: Complexity results for classes of quantificational formulas. J. Comput. Syst. Sci. 21, 317-353 (1980)
2. Pérez, J.A.N., Voronkov, A.: Encodings of Bounded LTL Model Checking in Effectively Propositional Logic. In: [18], pp. 346-361.
3. 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)
4. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35, 677-691 (1986)
5. Voronkov, A.: Merging relational database technology with constraint technology. In: Bjorner, D., Broy, M., Pottosin, I.V. (eds.) PSI 1996. LNCS, vol. 1181, pp. 409-419. Springer, Heidelberg (1996)
6. Tammet, T., Kadarpik, V.: Combining an inference engine with database: A rule server. In: Schröder, M., Wagner, G. (eds.) RuleML 2003. LNCS, vol. 2876, pp. 136-149. Springer, Heidelberg (2003)
7. Whaley, J., Avots, D., Carbin, M., Lam, M.S.: Using datalog with binary decision diagrams for program analysis. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 97-118. Springer, Heidelberg (2005)
8. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53, 937-977 (2006)
9. Krstic, S., Goel, A.: Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol. 4720, pp. 1-27. Springer, Heidelberg (2007)
10. Baumgartner, P., Tinelli, C.: The model evolution calculus as a first-order DPLL method. Artif. Intell. 172, 591-632 (2008)
11. Baumgartner, P., Fuchs, A., Tinelli, C.: Lemma learning in the model evolution calculus. In: Hermann, M., Voronkov, A. (eds.) LPAR, 2006. LNCS (LNAI), vol. 4246, pp. 572-586. Springer, Heidelberg (2006)
12. Baumgartner, P.: Logical engineering with instance-based methods. In: [18], pp. 404-409.
13. Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: LICS, pp. 55-64. IEEE Computer Society Press, Los Alamitos (2003)
14. Gallo, G., Rago, G.: The satisfiability problem for the Schönfinkel-Bernays fragment: partial instantiation and hypergraph algorithms. Technical Report 4/94, Dip. Informatica, Universit'a di Pisa (1994)
15. Fermüller, C.G., Leitsch, A., Hustadt, U., Tammet, T.: Resolution decision procedures. In: Robinson, J. A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 1791-1849. Elsevier and MIT Press (2001)
16. Pérez, J.A.N., Voronkov, A.: Proof systems for effectively propositional logic. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008 (2008)
17. de Nivelle, H., Meng, J.: Geometric resolution: A proof procedure based on finite model search. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 303-317. Springer, Heidelberg (2006)
18. Pfenning, F. (ed.): CADE 2007. LNCS (LNAI), vol. 4603. Springer, Heidelberg (2007)