Loop-detection in hyper-tableaux by powerful model generation

Journal of Universal Computer Science

Volumn 5, Issue 3, 1999, Pages 135-155

  Stolzenburg, Frieder ^a  

^a Institut für Integrierte Naturwissenschaften   (Germany)

Author keywords

Computer algebra systems; Hyper tableau; Loop detection; Model generation; Terms with exponents

Indexed keywords

EID: 0346860540     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (31)

1. [Asveld, 1981] Peter R. J. Asveld. Time and space complexity of inside-out macro languages. International Journal of Computer Mathematics, 10:3-14, 1981.
2. [Baumgartner et al., 1996] Peter Baumgartner, Ulrich Furbach, and Ilkka Niemelä. Hyper tableaux. In José Júlio Alferes, Luís Moniz Pereira, and Ewa Orlowska, editors, Proceedings of the European Workshop on Logics in Artificial Intelligence, LNAI 1126, pages 1-17, Évora, Portugal, 1996. Springer, Berlin, Heidelberg, New York.
3. [Baumgartner, 1998] Peter Baumgartner. Hyper tableau - the next generation. In Harrie de Swart, editor, Proceedings of the 7th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1397, pages 60-76. Springer, Berlin, Heidelberg, New York, 1998.
4. [Bibel et al., 1992] Wolfgang Bibel, Steffen Hölldobler, and Jörg Würtz. Cycle unification. In Deepak Kapur, editor, 11th International Conference on Automated Deduction, LNAI 607, pages 94-108, Saratoga Springs, New York, USA, June 15-18, 1992. Springer-Verlag.
5. [Buchberger, 1997] Bruno Buchberger, editor. Ist International Theorema Workshop, RISC-Linz Report 97-20, Hagenberg, Austria, 1997. RISC.
6. [Bundy, 1994] Alan Bundy, editor. 12th International Conference on Automated Deduction, LNAI 814, Nancy, France, June 26-July 1, 1994. Springer-Verlag.
7. [Gaffera and Pettier, 1997] Ricardo Caffera and Nicolas Pettier. A new technique for verifying and correcting logic programs. Journal of Automated Reasoning, 19(3) :277-318, 1997.
8. [Caffera and Zabel, 1992] Ricardo Caffera and Nicolas Zabel. A method for simultaneous search for refutations and models by equational constraint solving. Journal of Symbolic Computation, 13:613-641, 1992.
9. [Chang and Lee, 1973] Chin-Liang Chang and Richard Char-Tung Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, London, 1973.
10. [Comon, 1995] Hubert Conion. On unification of terms with integer exponents. Mathematical Systems Theory, 28(1):67-88, 1995.
11. [Fitting, 1996] Melvin Fitting. First-Order Logic and Automated Theorem Proving. Texts and Monographs in Computer Science. Springer, Berlin, Heidelberg, New York, 2nd edition, 1996.
12. [Furbach et al., 1998] Ulrich Furbach, Michael Kühn, and Frieder Stolzenburg. Modelguided proof debugging. Fachberichte Informatik 6/98, Universität Koblenz, 1998.
13. [Graham et al., 1994] Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd edition, 1994.
14. [Heintze, 1992] Nevin Heintze. Practical aspects of set-based analysis. In Krzysztof R. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 765-779, Cambridge, MA, London, 1992. MIT Press.
15. [Hermann and Galbavý, 1997] Miki Hermann and Roman Galbavý. Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science, 176:111-158, 1997.
16. [Jouannaud and Kirchner, 1991] Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 257-321. MIT Press, Cambridge, MA, London, 1991.
17. [Klingenbeck, 1997] Stefan Klingenbeck. Counter Examples in Semantic Tableaux. DISKI 156. infix, Sankt Augustin, 1997. Dissertation.
18. [Letz et al., 1994] Reinhold Letz, Klaus Mayr, and Christian Goller. Controlled integration of the cut rule into connection tableau calculi. Journal of Automated Reasoning, 13:297-337, 1994.
19. [Lloyd, 1987] John W. Lloyd. Foundations of Logic Programming. Springer, Berlin, Heidelberg, New York, 1987.
20. [Manthey and Bry, 1988] Rainer Manthey and François Bry. SATCHMO: a theorem prover implemented in Prolog. In Ewing Lusk and Ross Overbeek, editors, Proceedings of the 9th International Conference on Automated Deduction, LNCS 310, pages 415-434, Argonne, IL, 1988. Springer, Berlin, Heidelberg, New York.
21. [Martin, 1996] Emily Martin, editor. Mathematica 3.0 Standard Add-on Packages. Wolfram Media, Champaign, IL, 1996.
22. [Matzinger, 1997] Robert Matzinger. Computational representations of Herbrand models using grammars. In Dirk van Dalen, editor, Proceedings of the Conference on Computer Science Logic 1996, LNCS 1258, pages 334-348. Springer, Berlin, Heidelberg, New York, 1997.
23. [Ohlbach, 1998] Hans Jürgen Ohlbach. Elimination of self-resolving clauses. Journal of Automated Reasoning, 20:317-336, 1998.
24. [Pettier, 1997a] Nicolas Pettier. Increasing model building capabilities by constraint solving on terms with integer exponents. Journal of Symbolic Computation, 24:59-101, 1997.
25. [Pettier, 1997b] Nicolas Pettier. Tree automata and automated model building. Fundamenta Informatica, 30:23-41, 1997.
26. [Salzer, 1992] Gernot Salzer. The unification of infinite sets of terms and its applications. In Andrei Voronkov, editor, Proceedings of the 3rd International Conference on Logic Programming and Automated Reasoning, LNAI 624, pages 409-420. Springer, Berlin, Heidelberg, New York, 1992.
27. [Salzer, 1994] Gernot Salzer. Primal grammars and unification modulo a binary clause. In Bundy [1994], pages 282-295.
28. [Slaney et al., 1994] John Slaney, Ewing Lusk, and William McCune. SCOTT: Semantically constrained Otter (system description). In Bundy [1994], pages 764-768.
29. [Socher-Ambrosius, 1993] Rolf Socher-Ambrosius. Unification of terms with integer exponents. Technical Report MPI-I-93-217, Max-Planck-Institut für Informatik, Saarbrücken, 1993.
30. [Wilf, 1990] Herbert S. Wilf. generatingfunctionology. Academic Press, San Diego, London, 1990.
31. [Wolfram, 1996] Stephen Wolfram. The Mathematica Book. Wolfram Media, Champaign, IL, 3rd edition, 1996.