Computing answers with model elimination

Artificial Intelligence

Volumn 90, Issue 1-2, 1997, Pages 135-176

  Baumgartner, Peter ^a   Furbach, Ulrich ^a   Stolzenburg, Frieder ^a  

^a University of Koblenz ^*  (Germany)

Author keywords

Automated reasoning; Computing answers; Logic programming; Model elimination; Theorem proving

Indexed keywords

COMPUTATIONAL METHODS; LOGIC PROGRAMMING; PROGRAM INTERPRETERS; THEOREM PROVING;

ANCESTRY RESTART MODEL ELIMINATION; AUTOMATED REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 0031071365     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(96)00042-2     Document Type: Article

References (34)

1. P. Baumgartner, A model elimination calculus with built-in theories, in: H.-J. Ohlbach, ed., Proceedings of the 16th German AI-Conference (GWAI-92), Lecture Notes in Artificial Intelligence 671 (Springer, Berlin, 1992) 30-42.
2. P. Baumgartner, Refinements of theory model elimination and a variant without contrapositives, Proceedings ECAI-94, Amsterdam (1994); Long version: Research Rept. 8/93, Institute for Computer Science, University of Koblenz, Koblenz (1993).
3. P. Baumgartner and U. Furbach, Consolution as a framework for comparing calculi, J. Symb. Comput. 16 (1993).
4. P. Baumgartner and U. Furbach, Model elimination without contrapositives and its application to PTTP, J. Autom. Reasoning 13 (1994) 339-359; Short version in: Proceedings of CADE-12, Lecture Notes in Artificial Intelligence 814 (Springer, Berlin, 1994) 87-101.
5. P. Baumgartner and U. Furbach, Model elimination without contrapositives and its application to PTTP, J. Autom. Reasoning 13 (1994) 339-359; Short version in: Proceedings of CADE-12, Lecture Notes in Artificial Intelligence 814 (Springer, Berlin, 1994) 87-101.
6. P. Baumgartner and U. Furbach, PROTEIN: a PROver with a Theory Extension interface, in: A. Bundy, ed.. Proceedings of the 12th International Conference on Automated Deduction, Nancy, Lecture Notes in Artificial Intelligence 814 (Springer, Berlin, 1994) 769-773.
7. P. Baumgartner, U. Furbach and I. Niemelä, Hyper tableaux, in: JELIA 96. European Workshop on Logic in AI, Lecture Notes in Artificial Intelligence 1126 (Springer, Berlin, 1996); Long version in: Fachberichte Informatik, 8-96, Universität Koblenz-Landau, Koblenz (1996).
8. P. Baumgartner and F. Stolzenburg, Constraint model elimination and a PTTP-implementation, in: P. Baumgartner, R. Hähnle and J. Posegga, eds., Proceedings of the 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Lecture Notes in Artificial Intelligence 918 (Springer, Berlin, 1995) 201-216.
9. C. Chang and R. Lee, Symbolic Logic and Mechanical Theorem Proving (Academic Press, New York, 1973).
10. R. Demolombe and T. Imielski, Nonstandard Queries and Nonstamdard Answers (Oxford University Press, Oxford, 1994).
11. ECRC GmbH, München, ECLiPSe 3.5: User Manual - Extensions User Manual (1995).
12. E. Eder, Consolution and its relation with resolution, in: Proceedings IJCAI-91, Sydney, Australia (1991).
13. G. Gottlob and C.G. Formüller, Removing redundancy from a clause, Artif. Intell. 61 (1993) 263-289.
14. C.C. Green, Theorem-proving by resolution as a basis for question-answering systems, in: B. Meltzer and D. Michie, eds., Machine Intelligence 4 (Elsevier, New York, 1969) 183-205.
15. D. Kapur and P. Narendran, NP-completeness of the set unification and matching problems, in: J.H. Siekmann, ed., Proceedings of the 8th International Conference on Automated Deduction, Oxford, Lecture Notes in Artificial Intelligence 230 (Springer, Berlin, 1986) 489-495.
16. R. Letz, K. Mayr and C. Goller, Controlled integration of the cut rule into connection tableau calculi, J. Autom. Reasoning 13 (1994) 297-337.
17. R. Letz, J. Schumann, S. Bayerl and W. Bibel, SETHEO: a high-performance theorem prover, J. Autom. Reasoning 8 (1992).
18. J. Lloyd, Foundations of Logic Programming, Symbolic Computation (Springer, Berlin, 2nd extended ed., 1987).
19. J. Lobo, J. Minker and A. Rajasekar, Foundations of Disjunctive Logic Programming (MIT Press, Cambridge, MA, 1992).
20. D. Loveland, Mechanical theorem proving by model elimination, J. ACM 15 (1968).
21. D. Loveland, Automated Theorem Proving - A Logical Basis (North-Holland, Amsterdam, 1978).
22. D.W. Loveland, Near-Horn Prolog, in: J.-L. Lassez, ed., Proceedings Fourth International Conference on Logic Programming, Melbourne (1987) 456-469.
23. D. Loveland, Near-Horn Prolog and beyond, J. Autom. Reasoning 7 (1991) 1-26.
24. D.W. Loveland and D.W. Reed, Near-Horn Prolog and the ancestry family of procedures, Tech. Rept. CS-1992-20, Department of Computer Science, Duke University, Durham, NC (1992).
25. R. Manthey and F. Bry, SATCHMO: a theorem prover implemented in Prolog, in: E. Lusk and R. Overbeek, eds., Proceedings of the 9th International Conference on Automated Deduction, Argonne, IL, Lecture Notes in Computer Science 310 (Springer, Berlin, 1988) 415-434.
26. W.W. McCune, OTTER 3.0 reference manual and guide, Tech. Rept. ANL-94/6, National Laboratory, Argonne, IL (1994).
27. H.J. Ohlbach, Predicate logic hacker tricks, J. Autom. Reasoning 1 (1985) 435-440.
28. D. Plaisted, Non-Horn clause logic programming without contrapositives, J. Autom. Reasoning 4 (1988) 287-325.
29. U.R. Schmerl, A resolution calculus giving definite answers, Tech. Rept. 9108, Universität der Bundeswehr, München (1991).
30. M. Schmidt-Schauß, Implication of clauses is undecidable, Theoret. Comput. Sci. 59 (1991) 287-296.
31. Raymond M. Smullyan, What is the Name of this Book? The Riddle of Dracula and other Logical Puzzles (Prentice-Hall, Englewood Cliffs, NJ, 1978).
32. M.E. Stickel, Automated deduction by theory resolution, J. Autom. Reasoning 1 (1985) 333-355.
33. M.E. Stickel, A Prolog technology theorem prover: implementation by an extended Prolog compiler, J. Autom. Reasoning 4 (1988) 353-380.
34. G. Sutcliffe, C. Suttner and T. Yemenis, The TPTP problem library, in: A. Bundy, ed., Proceedings CADE-12, Lecture Notes in Artificial Intelligence 814 (Springer, Berlin, 1994).