Integrating equational reasoning into instantiation-based theorem proving

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

Volumn 3210, Issue , 2004, Pages 71-84

  Ganzinger, Harald ^a   Korovin, Konstantin ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

EQUATIONAL REASONING; GENERATION PROCESS; LITERALS; MODEL GENERATION; PARAMODULATION; REDUNDANCY ELIMINATION; SATISFIABILITY SOLVERS;

THEOREM PROVING;

EID: 33845207319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30124-0_9     Document Type: Article

References (16)

1. L. Bachmair and H. Ganzinger. Equational reasoning in saturation-based theorem proving. In W. Bibel and P.H. Schmitt, editors, Automated Deduction - A Basis for Applications, volume I, chapter 11, pages 353-397. Kluwer, 1998.
2. L. Bachmair and H. Ganzinger. Resolution theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume 1, pages 19-100. Elsevier, 2001.
3. P. Baumgartner. FDPLL - a first-order Davis-Putnam-Logeman-Loveland Procedure. In Proc. CADE, volume 1831 of LNAI, pages 200-219, 2000.
4. P. Baumgartner and C. Tinelli. The model evolution calculus. In P. Baader, editor, Proc. CADE-19, number 2741 in LNAI, pages 350-364. Springer, 2003.
5. J.-P. Billon. The disconnection method: a confluent integration of unification in the analytic framework. In Tableaux 1996, volume 1071 of LNAI, pages 110-126, 1996.
6. R. Caferra and N. Zabel. A method for simultaneous search for refutations and models by equational constraint solving. J. of Symbolic Computation, 13(6):613-641, 1992.
7. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): fast decision procedures. In 16th Int. Conf, on Computer Aided Verification, LNCS, 2004. to appear.
8. H. Ganzinger and K. Korovin. New directions in instantiation-based theorem proving. In Proc. 18th IEEE Symposium on Logic in Computer Science, pages 55-64. IEEE, 2003.
9. J.N. Hooker, G. Rago, V. Chandru, and A. Shrivastava. Partial instantiation methods for inference in first order logic. J. of Automated Reasoning, 28:371-396, 2002.
10. C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue Francaise d'Intelligence Artificielle, 4(3):9-52, 1990. Special issue on automated deduction.
11. S.J. Lee and D. Plaisted. Eliminating duplication with the Hyper-linking strategy. J. of Automated Reasoning, 9:25-42, 1992.
12. R. Letz and G. Stenz. Proof and model generation with disconnection tableaux. In Proc. LPAR 2001, volume 2250 of LNAI, pages 142-156, 2001.
13. Reinhold Letz and Gernot Stenz. Integration of equality reasoning into the disconnection calculus. In Tableaux 2002, volume 2381 of LNAI, pages 176-190, 2002.
14. R. Nieuwenhuis and A. Rubio. Paramodulation-based theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, pages 371-443. Elsevier, 2001.
15. D. Plaisted and Y. Zhu. Ordered semantic hyper-linking. J. of Automated Reasoning, 25 (3): 167-217, 2000.
16. G. Stenz. The Disconnection Calculus. Logos, 2002. Dissertation, TU München.