Abstract
In this paper we deal with the problem of proving inductive theorems in conditional equational theories. We propose a proof by consistency method that can be employed when the theory is representable as a ground Church-Rosser conditional equational system. The method has a linear proof strategy and is shown to be sound and refutational complete, i.e. it refutes any conditional equation which is not an inductive theorem. Moreover it can handle rewrite rules as well as (unorientable) equations and therefore it will not fail when an unorientable equation comes up (as was the case in the earliest proof by consistency (inductionless induction) methods). The method extends the work on unconditional equational theories of [Bachmair 1988].
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.
Research supported by the “Instituut tot Aanmoediging van het Wetenschappelijk onderzoek in Nijverheid en Landbouw — I.W.O.N.L.”
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ackermann, W. (1962). Solvable cases of the decision problem. North-Holland.
Bachmair, L. (1988). Proof by Consistency in Equational Theories. Logic in Computer Science, Edinburgh 1988.
Bachmair, L., Ganzinger, H. (1990). Completion of first-order clauses with equality by strict superposition. 2nd CTRS, Logic and Formal Method Lab, Dept. of Computer Science, Concordia University, Montreal.
Bergstra, J., Klop, J.W. (1982). Conditional rewrite rules: Confluence and termination. Report IW198/82, Mathematisch Centrum, Amsterdam.
Bevers, E., Lewi, J. (1990). Proof by Consistency in Conditional Equational Theories. Report CW 102, Department of Computer Science, K.U.Leuven.
Bousdira, W., Rémy, J.L. (1987). Hierarchical contextual rewriting with several levels. Proc. 1st CTRS, LNCS 308, 15–30.
Dershowitz, N. (1982). Orderings for term-rewriting systems. J. Theoretical Computer Science, Vol 17, No 3, 279–301.
Dershowitz, N., Okada, M., Sivakumar, G. (1987). Confluence of Conditional Rewrite Systems. 1st CTRS, LNCS 308, 31–44.
Dershowitz, N., Okada, M., Sivakumar, G. (1988). Canonical Conditional Rewrite Systems. Proc. 9th CADE, LNCS 310, 538–549.
Dershowitz, N. (1990). A Maximal-Literal Unit Strategy for Horn Clauses. 2nd CTRS, Logie and Formal Method Lab, Dept. of Computer Science, Concordia University, Montreal.
Fribourg, L. (1986). A strong restriction of the inductive completion procedure. ICALP '86, LNCS 226, 105–115.
Fribourg, L. (1989). A strong restriction of the inductive completion procedure. Journal of Symbolic Computation, 8, 253–276.
Ganzinger, H. (1987a). Ground term confluence in parametric conditional equational specifications. Proc. STACS 1987, LNCS 247.
Ganzinger, H. (1987b). A Completion Procedure for Conditional Equations. 1st CTRS, LNCS 308, 62–83.
Göbel, R. (1987). Ground Confluence. Proc. Rewriting Techniques and Applications, Bordeaux, LNCS 256, 156–167.
Goguen, J.A., (1980). How to Prove Algebraic Inductive Hypotheses Without Induction, with Applications to the Correctness of Data Type Implementation, Proc. 5th CADE, LNCS 87, 356–373
Gramlich, B. (1989). Inductive Theorem Proving Using Refined Unfailing Completion Techniques. SEKI Report SR-89-14, Universität Kaiserslautern.
Hsiang, J., Rusinowitch, M. (1986). On word problems in equational theories. Tech. Rep. 86/29, SUNY at Stony Brook.
Huet, G., Oppen, D. (1980). Equations and rewrite rules: A survey. Formal Language Theory: Perspectives and Open Problems, Academic Press, New York, 1980, 349–405.
Huet, G., Hullot, J. M. (1982). Proofs by induction in equational theories with constructors. 21st IEEE symposium on Foundations of Computer Science, 96–107.
Jouannaud, J.P., Kounalis, E. (1985). Proofs by induction in equational theories without constructors. CRIN 85-R-042, Nancy.
Jouannaud, J.P., Waldmann, B. (1986). Reductive Conditional term rewriting systems. Proc. 3rd IFIP Working Conference on Formal Description of Programming Concepts, Ebberup, Denmark, Aug. 1986, North-Holland.
Kamin, S., Levy, J.-J. (1980). Two Generalisations of the Recursive Path Ordering, Unpublished note, Dept. of Computer Science, University of Illinois, USA.
Kaplan, S. (1984). Conditional Rewrite Rules. Journal of Theoretical Computer Science, 33, 175–193.
Kaplan, S. (1987). Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence. Journal of Symbolic Computation, 4, 95–334.
Kapur, D., Narendran, P., Zhang, H. (1986). Proof by induction using test sets. Proc. 8th CADE, LNCS 230, Springer New York, 99–117.
Kapur, D., Musser, D.R. (1987). Proof by Consistency. Artificial Intelligence, 31, 125–157.
Küchlin, W. (1989). Inductive completion by ground proof transformation. Rewriting Techniques, volume 2 of Resolution of Equations in Algebraic Structures, Ait-Kaci, H., Nivat, M. (eds.), Academic Press.
Musser, D. R. (1980). On proving inductive properties of abstract data types. Proceedings 7th Symposium on Principles of Programming Languages, ACM SIGPLAN, 154–162.
Okada, M. (1987). A Logical Analysis on Theory of Conditional Rewriting. 1st CTRS, LNCS 308, 179–196.
Paul, E. (1984). Proof by induction in equational theories with relations between constructors. Proceedings 9th Colloquium on trees in Algebra and Programming, Bordeaux, 211–225.
Plaisted, D.A. (1985). Semantic confluence tests and completion methods. Inf. Control 65:182–215.
Zhang, H., Rémy, J.L. (1985). Contextual rewriting. Rewriting Techniques and Applications, LNCS 202, 46–62.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bevers, E., Lewi, J. (1991). Proof by consistency in conditional equational theories. In: Kaplan, S., Okada, M. (eds) Conditional and Typed Rewriting Systems. CTRS 1990. Lecture Notes in Computer Science, vol 516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54317-1_91
Download citation
DOI: https://doi.org/10.1007/3-540-54317-1_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54317-6
Online ISBN: 978-3-540-47558-3
eBook Packages: Springer Book Archive