The model evolution calculus

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

Volumn 2741, Issue , 2003, Pages 350-364

  Baumgartner, Peter ^a   Tinelli, Cesare ^b  

^a UNIVERSITY OF KOBLENZ LANDAU   (Germany)

^b University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FORMAL LOGIC; THEOREM PROVING; ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; MATHEMATICAL MODELS; OPTIMIZATION;

BAUMGARTNER; DPLL PROCEDURE; FASTER IMPLEMENTATION; FIRST ORDER; FIRST ORDER LOGIC; MODEL EVOLUTION CALCULUS; PROPOSITIONAL LOGIC; PROPOSITIONAL SATISFIABILITY; DPLL PROCEDURES; FIRST-ORDER LOGIC; MODEL EVALUATION CALCULUS; PREPOSITIONAL LOGIC;

CALCULATIONS; FORMAL LOGIC;

EID: 7044247195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_32     Document Type: Conference Paper

References (18)

1. L. Bachmair and H. Ganzinger. Chapter 11: Equational Reasoning in Saturation-Based Theorem Proving. In W. Bibel and P. H. Schmitt, editors, Automated Deduction. A Basis for Applications, volume 1. Kluwer, 1998.
2. P. Baumgartner. Hyper Tableaux—The Next Generation. In H. de Swaart, editor, Proc. of TABLEAUX’98, volume 1397 of LNAI, pages 60-76. Springer, 1998.
3. P. Baumgartner. FDPLL—A First-Order Davis-Putnam-Logeman-Loveland Procedure. In D. McAllester, editor, Proc. of CADE-17, volume 1831 of LNAI, Springer, 2000.
4. P. Baumgartner and C. Tinelli. The Model Evolution Calculus. Fachberichte Informatik 1-2003, Universität Koblenz-Landau, 2003.
5. W. Bibel. Automated Theorem Proving. Vieweg, 1982.
6. J.-P. Billon. The Disconnection Method. In P. Miglioli et al., editors, Proc of TABLEAUX’96, volume 1071 of LNAI, pages 110-126. Springer, 1996.
7. M Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394-397, July 1962.
8. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, July 1960.
9. Harald Ganzinger and Konstantin Korovin. New directions in instance-based theorem proving. In LICS -Logics in Computer Science, 2003. To appear.
10. J. N. Hooker, G. Rago, V. Chandru, and A. Shrivastava. Partial Instantiation Methods for Inference in First Order Logic. Journal of Automated Reasoning, 28:371-396, 2002.
11. S.-J. Lee and D. Plaisted. Eliminating Duplicates with the Hyper-Linking Strategy. Journal of Automated Reasoning, 9:25-42, 1992.
12. R. Letz, K. Mayr, and C. Goller. Controlled Integrations of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13, 1994.
13. R. Letz and G. Stenz. Proof and Model Generation with Disconnection Tableaux. In R. Nieuwenhuis and A. Voronkov, editors, Proc. of LPAR’01, volume 2250 of LNAI. Springer, 2001.
14. D. A. Plaisted and Y. Zhu. Ordered Semantic Hyper Linking. Journal of Automated Reasoning, 25(3):167-217, 2000.
15. G. Stenz. DCTP 1.2 -System Abstract. In U. Egly and C. G. Fermüller, editors, Proc. of TABLEAUX’02, volume 2381 of LNAI, pages 335-340. Springer, 2002.
16. C. Tinelli. A DPLL-based calculus for ground satisfiability modulo theories. In G. Ianni and S. Flesca, editors, Proc. of JELIA’02, volume 2424 of LNAI. Springer, 2002.
17. A. Yahya and D. A. Plaisted. Ordered Semantic Hyper-Tableaux. Journal of Automated Reasoning, 29(1):17-57, 2002.
18. H. Zhang and M. E. Stickel. An efficient algorithm for unit propagation. In Proc. of AIMATH’ 96, 1996.