Abstract
We have outlined a completion procedure for first-order clausal reasoning with inspiration from completion procedures for equational reasoning. We believe this to be a useful method for many practical applications involving clausal reasoning where the theory stays constant and is used repeatedly for proving many goals. Program synthesis (see [3]) is such an application. We have implemented a prototype completion procedure in Prolog and used it for simple examples. We are currently involved in integrating it with the Focus program derivation system.
One important problem not touched upon in this work is the incorporation of equational reasoning. With the addition of equality, this method becomes viable for conditional equations, and it would extend the currently known completion procedures for them [2, 5].
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. Proof normalization for resolution and paramodulation. In N. Dershowitz, editor, Rewriting Techniques and Applications, pages 15–28. Springer-Verlag, Berlin, 1989. (Lecture Notes in Comp. Science, Vol 355).
Leo Bachmair and Harald Ganzinger. Completion of first order clauses with equality. In S. Kaplan and M. Okada, editors, Conditional and Typed Rewriting Systems — Second International CTRS Workshop, pages 162–180. Springer-Verlag, 1991.
F. Bronsard and U. S. Reddy. Conditional rewriting in Focus. In S. Kaplan and M. Okada, editors, Conditional and Typed Rewriting Systems — Second International CTRS Workshop, pages 2–13. Springer-Verlag, Berlin, 1991.
N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science B: Formal Methods and Semantics, chapter 6, pages 243–320. North-Holland, Amsterdam, 1990.
H. Ganzinger. A completion procedure for conditional equations. J. Symbolic Computation, 11:51–81, 1991.
Jieh Hsiang and Michaël Rusinowitch. A new method for establishing refutational completeness in theorem proving. In J. H. Siekmann, editor, Proceedings of the Eighth International Conference on Automated Deduction, pages 141–152, Oxford, England, July 1986. Vol. 230 of Lecture Notes in Computer Science, Springer, Berlin.
R. Nieuwenhuis and F. Orejas. Clausal rewriting. In S. Kaplan and M. Okada, editors, Conditional and Typed Rewriting Systems — Second International CTRS Workshop, pages 246–258. Springer-Verlag, 1991.
H. Zhang and D. Kapur. First-order theorem proving using conditional rewrite rules. In E. Lusk and R. Overbeek, editors, 9th Intern. Conf. on Automated Deduction, pages 1–20. Springer-Verlag, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bronsard, F., Reddy, U.S. (1993). Reduction techniques for first-order reasoning. In: Rusinowitch, M., Rémy, JL. (eds) Conditional Term Rewriting Systems. CTRS 1992. Lecture Notes in Computer Science, vol 656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56393-8_18
Download citation
DOI: https://doi.org/10.1007/3-540-56393-8_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56393-8
Online ISBN: 978-3-540-47549-1
eBook Packages: Springer Book Archive