Lemma matching for a PTTP-based Top-down theorem prover

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

Volumn 1249, Issue , 1997, Pages 146-160

  Iwanuma, Koji ^a  

^a UNIVERSITY OF YAMANASHI   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; EFFICIENCY;

MATCHING RULES; PROOF SEARCH; RECOMPUTATION; REDUNDANT COMPUTATION; SPEED UP; STABLE EFFICIENCIES; THEOREM PROVERS; TOPDOWN;

THEOREM PROVING;

EID: 21744452609     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63104-6_16     Document Type: Conference Paper

References (22)

1. Owen L. Astrachan, METEOR: exploring model elimination theorem proving, J. Automated Reasoning 13 (1994) 283-296.
2. O.L. Astrachan and D.W. Loveland, The use of lemmas in the model elimination procedure, J. Automated Reasoning (to appear)
3. O.L. Astrachan and M.E. Stickel, Caching and lemmaizing in model elimination theorem provers, CADE-11, LNAI 607 (1992) 778-782.
4. Jean-Paul Billion, The disconnection method: a confluent integration of unification in the analytic framework, TABLEAUX'96, LNAI 1071 (1996) 110-126.
5. P. Baumgartner and U. Furbach, Model elimination without contrapositives and its application to PTTP, J. Automated Reasoning 13 (1994) 339-360.
6. P.Baumgartner, U.Furbach and Ilkka Niemelä, Hyper Tableaux, Proc. of the European Workshop on Logics in Artificial Intelligence (JELIA '96), (1996) 1-17.
7. C. Goller, R. Letz, K. Mayr and J. Schumann, SETHEO V3.2: recent developments -system abstract-, CADE-12, LNAI 814 (1994) 778-782.
8. R. Letz, C. Goller and K. Mayr, Controlled integration of the cut rule into connection tableau calculi, J. Automated Reasoning 13 (1994) 297-338.
9. V. Lifschitz, What is the inverse method?, J. Automated Reasoning 5 (1989) 1-23.
10. D.W. Loveland, A simplified format for the model elimination theorem-proving procedure, J. ACM 16 (3) (1969) 349-363.
11. D.W. Loveland, Automated Theorem Proving: a logical basis (North-Holland Publishing Company, Amsterdam, 1978).
12. D.W. Loveland, Near-Horn Prolog and beyond, J. Automated Reasoning 7 (1991) 1-26.
13. D.W. Loveland, D.W.Reed and D.S.Wilson, SATCHMORE: SATCHMO with RE1- evancy, J. Automated Reasoning 14 (1995) 325-351.
14. R. Manthey and F. Bry, SATCHMO: a theorem prover implemented in Prolog, Proceedings 8th Inter. Conf on Automated Deduction (CADE-9), LNAI 310, USA (1988) 415-434.
15. W.W. McCune, OTTER 3.0 reference manual and guide, Technical Report ANL- 94/6, Argonne National Laboratory, 1994.
16. F,Oppacher and E.Suen, HARP: A Tableau-Based Theorem Prover, it J. Automated Reasoning 4 (1988) 69-100.
17. D.A. Plaisted, Non-Horn clause logic programming without contrapositives, J. Automated Reasoning 4 (1988) 287-325.
18. R.E. Shostak Refutation graphs, Artif. Intell. 7 (1976) 51-64.
19. M.E. Stickel, A prolog technology theorem prover: Implementation by an extended prolog compiler, J. Automated Reasoning 4 (1988) 353-380.
20. M.E. Stickel, A prolog technology theorem prover: a new exposition and implementation in prolog, Theoret. Comput. Sci. 104 (1992) 109-128.
21. J.M.P. Schumann, A bottom-up preprocessor for top-down theorem provers - system abstract-, CADE-12, LNAI 814 (1994) 774-777.
22. C. Suttner and G. Sutcliffe, The TP TP problem library: TPTP vl.2.1, Technical Report AR-96-02, Institut fiir Informatik TU München (1996).