SMELS: Satisfiability modulo equality with lazy superposition

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

Volumn 5311 LNCS, Issue , 2008, Pages 186-200

  Lynch, Christopher ^a   Tran, Duc Khanh ^b  

^a CLARKSON UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONGRUENCE CLOSURE; FIRST ORDER LOGIC; INFERENCE RULES; MODEL GENERATION; PARTIAL MODELING; SATISFIABILITY; SMT PROCESS; SUPERPOSITION PROCEDURE;

FORMAL LOGIC;

EID: 56749085842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88387-6_15     Document Type: Conference Paper

References (17)

1. The Yices SMT Solver, http://yices.csl.sri.com/tool-paper.pdf
2. Armando, A., Ranise, S., Rusinowitch, M.: A Rewriting Approach to Satisfiability Procedures. Journal of Information and Computation 183(2), 140-164 (2003)
3. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch.2, vol. 1, pp. 19-100. North Holland, Amsterdam (2001)
4. Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W.: Basic paramodulation and superposition. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 462-476. Springer, Heidelberg (1992)
5. Barrett, C., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 298-302. Springer, Heidelberg (2007)
6. Baumgartner, P.: Logical engineering with instance-based methods. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 404-409. Springer, Heidelberg (2007)
7. Baumgartner, P., Tinelli, C.: The model evolution calculus as a first-order DPLL method. Artificial Intelligence 172, 591-632 (2008)
8. de Moura, L., Bjorner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
9. Déharbe, D., Ranise, S.: Light-Weight Theorem Proving for Debugging and Verifying Units of Code. In: Press, I.C.S. (ed.) Proc. of the Int. Conf. on Software Engineering and Formal Methods (SEFM 2003) (2003)
10. Dershowitz, N., Jouannaud, J.-P.: Rewrite Systems, Handbook of Theoretical Computer Science, ch. 6, vol. B, pp. 244-320 (1990)
11. Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: A Theorem Prover for Program Checking. Technical Report HPL-2003-148, HP Laboratories (2003)
12. Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: Proc. 18th IEEE Symposium on Logic in Computer Science (LICS 2003), pp. 55-64. IEEE Computer Society Press, Los Alamitos (2003)
13. Korovin, K., Voronkov, A.: Integrating linear arithmetic into superposition calculus. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 223-237. Springer, Heidelberg (2007)
14. Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Hand, of Automated Reasoning. Elsevier and MIT Press (2001)
15. Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Commun. 15(2), 91-110 (2002)
16. Schulz, S.: E - A Brainiac Theorem Prover. Journal of AI Communications 15(2/3), 111-126 (2002)
17. Weidenbach, C.: Spass version 0.49. Journal of Automated Reasoning 14(2), 247-252 (1997)