Abstract
THEOPOGLES is a complete theorem prover for First-Order Predicate Logic. It is based on a special Knuth-Bendix completion procedure working on First-Order Polynomials. The method does not need special AC-unification, as the N-Strategie of Hsiang, nor special overlaps with the idempotency- and nilpotence-rule, as the equational approach of Kapur and Narendran. The algorithm supports structure sharing and also linking of literals which is used for example in the Connection Graph Procedure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Buchberger, B.: Basic Features and Development of the Critical-Pair/Completion Procedure, 1. Int. Conf. on Rewriting Techniques and Applications (RTA), Dijon, May 1985, Springer LNCS 202, 1–45.
Chang, C.L. and Lee, R.C.T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, N.Y. 1973.
Corbin, J., Bidoit, M.: A Rehabilitation of Robinson’s Unification Algorithm, in Information Processing 83, R.E.A. Mason (ed.), Elevier Sc. Pub. ( North Holland ), 909–914
Fribourg, L.: A Superposition Oriented Theorem Prover, TCS35 (1985), 124–164.
H82] Hsiang, J.: Topics in Automated Theorem Proving and Program Generation Ph.D. Thesis, Dec. 1982, University of Illinois at Urbana-Champaign, UIUCDCS-R-82–1113.
Hsiang, J.: Two Results in Term Rewriting Theorem Proving, Proc. RTA, Dijon, May1985, Springer LNCS 202, 301–324
Hsiang, J. and Dershowitz, N.: Rewrite Methods for Clausal and Non-Clausal Theorem Proving, Proc. of the 10. EATCS Int. Colloq. on Automata, Languages and Programming (ICALP ), Spain 1983.
Huet, G.: A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm, Journal of Computer and System Sciences 23 (1981), 11–21.
Knuth, D.E. and Bendix, P.B.: Simple Word Problems in Universal Algebras in Computational Problems in Abstract Algebras (Ed. J. Leech ), Pergammon Press, 1970, 263–297.
Kapur, D. and Narendran, P.: An Equational Approach to Theorem Proving in First-Order Predicat Calculus, 84CRD322, General Electric Corporate Research and Development Report, Schenectady, N.Y., Sept.1985. see also (short version) Proc. of the IJCAI-85, Los Angeles, CA, Aug. 1985.
L78] Loveland, B.W.: Automated Theorem Proving: a logical basis, North Holland, Amsterdam 1978.
Pa85] Paul, E On Solving the Equality Problem in Theories defined by Horn Clauses, Poc. Eurocal-85, Linz, Austria.
Seventy-Five Problems for Testing Automatic Theorem Provers, JAR 2 (1986), 191–216.
Wos, L. et al., Automated Reasoning, Prentice-Hall, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mueller, J. (1987). Theopogles — A Theorem Prover Based on First-Order Polynomials and a Special Knuth-Bendix Procedure. In: Morik, K. (eds) GWAI-87 11th German Workshop on Artifical Intelligence. Informatik-Fachberichte, vol 152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73005-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-73005-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18388-4
Online ISBN: 978-3-642-73005-4
eBook Packages: Springer Book Archive