Abstract
We give a new simplification method, called E-cycle Simplification, for Basic Completion inference systems. We prove the completeness of Basic Completion with E-cycle Simplification. We prove that E-cycle Simplification is strictly stronger than the only previously known complete simplification method for Basic Completion, Basic Simplification, in the sense that every derivation involving Basic Simplification is a derivation involving E-cycle Simplification, but not vice versa. E-cycle Simplification is simple to perform, and does not use the reducibility-relative-to condition. We believe this new method captures exactly what is needed for completeness. ECC implements our method.
This work was supported by NSF grant number CCR-9712388 and partially done during a visit in the PROTHEO group in Nancy.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217–247, 1994.
L. Bachmair and H. Ganzinger and C. Lynch and W. Snyder. Basic Paramodulation. Information and Computation, 121(2):172–192, 1995.
N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244–320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI.
M. Hermann. Constrained Reachability is NP-complete. http://www.loria.fr/hermann/publications.html#notes.
D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, Oxford, 1970.
C. Kirchner and H. Kirchner and M. Rusinowitch. Deduction with symbolic constraints. Revue d’Intelligence Artificielle, 4(3):9–52, 1990. Special issue on Automatic Deduction.
C. Kirchner and H. Kirchner and M. Vittek. ELAN V 1.17 User Manual Inria Lorraine & Crin, Nancy (France), first edition, november 1995.
C. Lynch and W. Snyder. Redundancy criteria for constrained completion. Theoritical Compluter Science, volume 142, pages 141–177, 1995.
C. Lynch and C. Scharff. Basic Completion with E-cycle Simplification. 1997, http://www.loria.fr/~scharff.
R. Nieuwenhuis and A. Rubio. Basic superposition is complete. In B. Krieg-Brückner, editor, Proceedings of ESOP’92, volume 582 of Lecture Notes in Computer Science, pages 371–389. Springer-Verlag, 1992.
G.E. Peterson. Constrained Term-Rewriting Induction with Applications. Methods of Logic in Computer Science, 1(4):379–412, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lynch, C., Scharff, C. (1998). Basic Completion with E-cycle Simplification. In: Calmet, J., Plaza, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 1998. Lecture Notes in Computer Science, vol 1476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055914
Download citation
DOI: https://doi.org/10.1007/BFb0055914
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64960-1
Online ISBN: 978-3-540-49816-2
eBook Packages: Springer Book Archive