Abstract
EQTHEOPOGLES is a theorem prover for first order predicate calculus with equality. It is based on a two-level Knuth-Bendix Completion Procedure on first order polynomials and terms. It combines the advantages of the THEOPOGLES system for pure first order predicate calculus with the advantages of (“unfailing”) completion for pure equational reasoning. An overview of the system and its inference rules is given. EQTHEOPOGLES is shown to be complete even with interreduction and further improvements are discussed.
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
Chang, C.L.; Lee, R.C.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.
Denzinger, J.: Implementation of a Theorem Prover Based on Rewriting- Techniques (in German), project-report, University of Kaiserslautern, 1987.
Denzinger, J.: EQTHEOPOGLES (in German), M.S. Thesis, University of Kaiserslautern, 1988.
Denzinger, J.; Kassel, S.; Müller, J.: Proving Theorems with the CTP (EQ-)THEOPOGLES, Overview, user manual and solutions, technical report, University of Kaiserslautern, to appear 1989.
Denzinger, J.; Müller, J.: THEOPOGLES user manual, University of Kaiserslautern, 1987.
Hsiang, J.: Topics in Automated Theorem Proving and Program Generation, report University of Illinois, 1982.
Hsiang, J.: Rewrite Method for Theorem Proving in First Order Theory with Equality, J. of Symbolic Computation 3, 1987, pp. 133–151.
Huet, G.: A Complete Proof of Correctness of the Knuth-Bendix Completion algorithm, J. of Comp, and System Sciences 23, 1981, pp. 11–21.
Kapur, D.; Musser, D.R.; Narendran, P.: Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure, J. of Symb. Comp. 6, 1988, pp. 19–36.
Kapur, D.; Zhang, H.: First-Order Theorem Proving using Conditional Rewrite Rules, Proceedings CADE, 1988.
Knuth, D.E.; Bendix, P.B.: Simple Word Problems in Universal Algebra, Computational Algebra, J.Leach, Pergamon Press, 1970, pp. 263–297.
Lusk, E.L.; Overbeek, R.A.: Reasoning about Equality, J. of Automated Reasoning 1, 1985, pp. 209–228.
McCune, W.: Challenge Equality Problems in Lattice Theory, Proceedings CADE, 1988.
Morris, J.B.: E-resolution: Extension of Resolution to Include the Equality, Proc. IJCAI, Washington D.C., 1969, pp. 287–294.
Müller, J.; Socher-Ambrosius, R.: On the Unnecessity of Multiple-Overlaps in Completion Theorem Proving, Proc. 12th GWAI, 1988, Springer IFB 181.
Müller, J.: THEOPOGLES - A Theorem Prover Based on First-Order Polynomials and a Special Knuth-Bendix Procedure, Proc. 11th GWAI, 1987, Springer IFB 152.
Müller, J.: Theorem Proving with Rewrite-Techniques, - Methods, Strategies and Comparisons - (in German), Ph.D. Thesis, University of Kaiserslautern, 1988.
Peterson, G.E.: A Technique for Establishing Completeness Results in Theorem Proving with Equality, SIAM Journal of Computing 12, 1, 1983, pp. 82–100.
Rusinowitch, M.: Demonstration automatique par des techniques de reecriture (in French), These de Doctorat dTtat en Mathematique, Nancy, 1987.
Robinson, G.; Wos, L.: First-order Theorem Proving with Equality, Mach. Intelligence, vol. 4, Edinburgh, 1969, pp. 135–150.
Winkler, F.: The Church-Rosser Property in Computer Algebra and Special Theorem Proving: an Investigation of Critical Pair Completion Algorithms, Ph.D. Thesis, J.-Kepler University Linz, 1984.
Wos, L.; Robinson, G.; Carson, D.; Shalla, L.: The Conzept of Demodulation in Theorem Proving, J. of ACM 14, 1967, pp. 698–709.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Denzinger, J., Müller, J. (1989). Eqtheopogles A Completion Theorem Prover for PL1EQ. In: Metzing, D. (eds) GWAI-89 13th German Workshop on Artificial Intelligence. Informatik-Fachberichte, vol 216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75100-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-75100-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51743-6
Online ISBN: 978-3-642-75100-4
eBook Packages: Springer Book Archive