Abstract
We define equality constrained equations and clauses and use them to prove the completeness of what we have called basic superposition: a restricted form of superposition in which only the subterms not created in previous inferences is superposed upon. We first apply our results to the equational case and define an unfailing Knuth-Bendix completion procedure that uses basic superposition as inference rule. Second, we extend the techniques to completion of full first-order clauses with equality. Moreover, we prove the refutational completeness of a new simple inference system.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Bachmair, N. Dershowitz, D. Plaisted: Completion without failure. In H. Ait-Kaci and M. Nivat, editors, Resolution of equations in algebraic structures, vol 2: Rewriting Techniques, pp 1-30, Academic Press, (1989).
L. Bachmair, H. Ganzinger: Completion of first-order clauses with equality, (final version) 2nd Intl. Workshop on Conditional and Typed Term Rewriting, Montreal, LNCS 516, pp. 162–181, (1991).
H. Comon: Solving Symbolic Ordering Constraints. In proc. 5th IEEE Symp. Logic in Comp. Sc. Philadelphia. (June 1990).
N. Dershowitz, J-P. Jouannaud: Rewrite systems, in Handbook of Theoretical Computer Science, vol. B: Formal Methods and Semantics. (J. van Leeuwen, ed.), North Hollad, Amsterdam, 1990.
N. Dershowitz, J-P. Jouannaud: Notations for Rewriting. in Bulletin of the EATCS, no. 43, Feb 1991.
J. Hsiang, M. Rusinowitch: Proving refutational completeness of theorem proving strategies: The transfinite semantic tree method. Submitted for publication (1989).
J.M. Hullot: Compilation de Formes Canoniques dans les Teories Equationnelles, These de 3eme Cycle, Universite de Paris Sud, 1980.
D.E. Knuth, P.B. Bendix: Simple word problems in universal algebras. J. Leech, editor, Computational Problems in Abstract Algebra, 263–297, Pergamon Press, Oxford, 1970.
C. Kirchner and H. Kirchner, M. Rusinowitch: Deduction with Symbolic Constraints. Revue Francaise d'Intelligence Artificielle. Vol 4. No. 3. pp. 9–52. Special issue on automatic deduction. (1990).
R. Nieuwenhuis: First-order completion techniques. Research report UPC-LSI, 1991.
R. Nieuwenhuis, P. Nivela: Efficient deduction in equality Horn logic by Horncompletion, Information Processing Letters, no. 39, pp. 1–6, July 1991.
R. Nieuwenhuis, F. Orejas: Clausal Rewriting. 2nd Intl. Workshop on Conditional and Typed Term Rewriting, Montreal, LNCS 516, pp. 246–261, (1991).
R. Nieuwenhuis, F. Orejas, A. Rubio: TRIP: an implementation of clausal rewriting. In Proc. 10th Int. Conf. on Automated Deduction. Kaiserslautern, 1990. LNCS, pp 667–668.
R. Nieuwenhuis, A. Rubio: Theorem Proving with Ordering Constrained Clauses. Research report UPC-LSI, 1991. (submitted).
G.E. Peterson: Complete Sets of Reductions with Constraints. In Proc. 10th Int. Conf. on Automated Deduction. Kaiserslautern, 1990. LNCS, pp 381–395.
M. Rusinowitch: Theorem-proving with resolution and superposition: an extension of Knuth and Bendix procedure as a complete set of inference rules. Report 87-R-128, CRIN, Nancy, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nieuwenhuis, R., Rubio, A. (1992). Basic superposition is complete. In: Krieg-Brückner, B. (eds) ESOP '92. ESOP 1992. Lecture Notes in Computer Science, vol 582. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55253-7_22
Download citation
DOI: https://doi.org/10.1007/3-540-55253-7_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55253-6
Online ISBN: 978-3-540-46803-5
eBook Packages: Springer Book Archive