Theory instantiation

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

Volumn 4246 LNAI, Issue , 2006, Pages 497-511

  Ganzinger, Harald ^a   Korovin, Konstantin ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGRATION; LOGIC PROGRAMMING; THEOREM PROVING;

GROUND CLAUSES; PARAMODULATION; THEORY INSTANTIATION;

FORMAL LOGIC;

EID: 33845223361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_34     Document Type: Conference Paper

References (26)

1. A. Armando, S. Ranise, and M. Rusinowitch. A Rewriting Approach to Satisfiability Procedures. Info. and Comp., 183(2):140-164, June 2003.
2. F. Baader and W. Snyder. Unification theory. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, pages 445-532. Elsevier, 2001.
3. L. Bachmair and H. Ganzinger. Resolution theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, pages 19-100. Elsevier, 2001.
4. L. Bachmair, H. Ganzinger, and U. Waldmann. Refutational Theorem Proving for Hierarchic First-Order Theories. Applicable Algebra in Engineering, Communication and Computing, 5(3/4):193-212, 1994.
5. C. Barrett, L. de Moura, and A. Stump. Design and results for the 1st satisfiability modulo theories competition. Journal of Automated Reasoning, 2006. to appear.
6. P. Baumgartner. FDPLL - a first-order Davis-Putnam-Logeman-Loveland Procedure. In Proc. CADE, volume 1831 of LNAI, pages 200-219, 2000.
7. P. Baumgartner and C. Tinelli. The model evolution calculus. In Proc. CADE-19, number 2741 in LNAI, pages 350-364. Springer, 2003.
8. P. Baumgartner and C. Tinelli. The model evolution calculus with equality. In Proc. CADE-21, number 3632 in LNAI, pages 392-408. Springer, 2005.
9. Peter Baumgartner. An order theory resolution calculus. In LPAR, volume 624 of LNAI, pages 119-130, 1992.
10. J. Gallier and W. Snyder. Complete sets of transformations for general E-unification. Theoretical Computer Science, 67(2,3):203-260, 1989.
11. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In Poc. of CAV'04, volume 3114 of LNCS, pages 175-188. Springer, 2004.
12. H. Ganzinger, T. Hillenbrand, and U. Waldmann. Superposition modulo a Shostak theory. In CADE-19, volume 2741 of LNAI, pages 182-196. Springer, 2003.
13. H. Ganzinger and K. Korovin. New directions in instantiation-based theorem proving. In Proc. 18th IEEE Symposium on LICS, pages 55-64. IEEE, 2003.
14. H. Ganzinger and K. Korovin. Integrating equational reasoning into instantiation-based theorem proving. In CSL'04, volume 3210 of LNCS, pages 71-84, 2004.
15. H. Ganzinger and K. Korovin. Theory Instantiation, 2006. Full version, available at http://www.cs.man.ac.uk/~korovink/.
16. J. 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.
17. U. Hustadt, B. Motik, and U. Sattler. Reasoning in description logics with a concrete domain in the framework of resolution. In ECAI, pages 353-357, 2004.
18. R. Letz and G. Stenz. Proof and model generation with disconnection tableaux. In Proc. LPAR 2001, volume 2250 of LNAI, pages 142-156, 2001.
19. R. Letz and G. Stenz. Integration of equality reasoning into the disconnection calculus. In Tableaux 2002, volume 2381 of LNAI, pages 176-190, 2002.
20. C. Lynch and B. Morawska. Goal-directed E-unification. In Proc. of RTA'2001, volume 2051 of LNCS, pages 231-245. Springer, 2001.
21. R. Nieuwenhuis. On narrowing, refutation proofs and constraints. In Proc. of RTA'1995, volume 914 of LNCS, pages 56-70. Springer, 1995.
22. R. Nieuwenhuis and A. Oliveras. Decision procedures for SAT, SAT Modulo Theories and Beyond. In 12th Int. Conf. Logic for Prog., Artif. Intell. and Reasoning (LPAR), volume 3835 of LNCS, pages 23-46, 2005.
23. 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.
24. D. Plaisted and Y. Zhu. Ordered semantic hyper-linking. J. of Automated Reasoning, 25(3):167-217, 2000.
25. M. Stickel. Automated deduction by theory resolution. J. Autom. Reasoning, 1(4):333-355, 1985.
26. C. Tinelli. A DPLL-based calculus for ground satisfiability modulo theories. In Proceedings of the 8th European Conference on Logics in Artificial Intelligence, volume 2424 of LNAI, pages 308-319. Springer, 2002.