Incremental theory reasoning methods for semantic tableaux

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

Volumn 1071, Issue , 1996, Pages 93-109

  Beckert, Bernhard ^a   Pape, Christian ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COST REDUCTION; EFFICIENCY; SEMANTICS;

AUTOMATED DEDUCTION SYSTEMS; COMBINED SYSTEM; FREE VARIABLE; INCREMENTAL THEORIES; REASONER; REASONING METHODS; SEMANTIC TABLEAU;

THEOREM PROVING;

EID: 84958974414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61208-4_7     Document Type: Conference Paper

References (23)

1. M. Baaz and C. G. Fermfiller. Non-elementaxy speedups between different versions of tableaux. In Proceedings, 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, St. Goar, LNCS 918, pages 217-230. Springer, 1995.
2. P. Baumgartner. A model elimination calculus with built-in theories. In H.-J. Ohlbah, editor, Proceedings, German Workshop on Artificial Intelligence (GWAI), LNCS 671, pages 30-42. Springer, 1992.
3. P. Baumgaxtner. Linear and unit-resulting refutations for Horn theories. Journal of Automated Reasoning, 1996. To appear.
4. P. Baumgaxtner, U. Furbach, and U. Petermaan. A unified approach to theory reasoning. Forschungsbericht 15/92, University of Koblenz, 1992.
5. B. Beckert. Adding equality to semantic tableaux. In K. Broda, M. D'Agostino, R. Gore, R. Johnson, and S. Reeves, editors, Proceedings, 3rd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Abingdon, pages 29-41, Imperial College, London, TR-94/5, 1994.
6. B. Beckert. A completion-based method for mixed universal and rigid Eunification. In A. Bundy, editor, Proceedings, 12th International Conference on Automated Deduction (CADE), Nancy, France, LNCS 814, pages 678-692. Springer, 1994.
7. B. Beckert, S. Gerberding, R. Hs and W. Kernig. The tableau-based theorem prover 3TAp for multiple-valued logics. In Proceedings, 11th International Conference on Automated Deduction (CADE), Saratoga Springs, NY, LNCS 607, pages 758-760. Springer, 1992.
8. B. Beckert, R. Hs K. Geiß, P. Oel, C. Pape, and M. Sulzmann. The maltyvalued tableau-based theorem prover ~49, version 4.0. Interner Bericht 3/96, Universitat Karlsruhe, Fakultgt fur Informatik, 1996.
9. B. Beckert, R. HLlanie, and P. H. Schmitt. The even more liberalized 6-rule in free variable semantic tableaux. In G. Gottlob, A. Leitsch, and D. Mundici, editors, Proceedings, 3rd Kurt G6dei Colloquium (KGC), Brno, Czech Republic, LNCS 713, pages 108-119. Springer, 1993.
10. W. Bibel. Automated Theorem Proving. Vieweg, Braunschweig, second revised edition, 1987.
11. E. de Kogel. Rigid E-unification simplified. In Proceedings, 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, St. Goat, LNCS 918, pages 17-30. Springer, 1995.
12. K. Degtyarev and A. Voronkov. Simultaneous rigid E-unification is undeeidable. UPMAIL Technical Report 105, Uppsala University, May 1995. Presented at: Annual Conference of the European Association for Computer Science Logic (CSL '95), Paderborm
13. M. C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, 1990.
14. J. H. Gallier, P. Narendran, S. Ratz, and W. Snyder. Theorem proving using equational matings and rigid E-unification. Journal of the ACM, 39(2):377-429, Apr. 1992.
15. R Hahnle and P. H. Schmitt. The liberalized -rule in free variable semantic tableaux. Journal of Automated Reasoning, 13(2):211-222, 1994.
16. D. E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebras, pages 263-297. Pergamon Press, Oxford, 1970.
17. D. W. Loveland. A simplified format for the model elimiaation procedure. Journal of the ACM, 16(3):233-248, July 1969.
18. N. V. Murray and E. Rosenthal. Theory links: Applications to automated theorem proving. Journal of Symbolic Computation, 4:173-190, 1987.
19. W. Nutt, P. Rety, and G. Smolka. Basic narrowing revisited. Journal of Symbolic Computation, 7(3/4):295-318, 1989.
20. F. J. PeUetier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2:191-216, 1986.
21. U. Petermaan. How to build-in an open theory into connection calculi. Journal on Computer and Artificial Intelligence, 11(2):105-142, 1992.
22. R. Smullyast. First-Order Logic. Springer, 1968.
23. M. E. Stickel. Automated deduction by theory resolution. Journal of Automated Reasoning, 1:333-355, 1985.