Abstract
The first part of this work presents two principal approaches to conditional rewriting, the ”Log-algebra approach” and the ”initial algebra approach”. The former defines a deduction system called L which is correct and complete with respect to some class of conditional specifications. The latter provides results in the initial algebra of conditional specifications which are faithfull with respect to booleans. Under some hypotheses, both approaches share the same initial algebra. The second part of this paper presents a completion procedure for hierarchical conditional specifications. This procedure is founded on inference rules and we establish the correction of these rules with respect to the proof system L.
This work has been partially supported by the GRECO-PRC Programmation Avancée et Outils de l'Intelligence Artificielle.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proc. Sym. Logic in Computer Science, pages 346–357, Boston (Massachusetts USA), 1986.
W. Bousdira. A completion procedure for hierarchical conditional equations. 88-R-021, Centre de Recherche en Informatique de Nancy, 1988.
W. Bousdira and J.L. Rémy. Complétion des systèmes de réécriture conditionnelle. In Actes des journées GROSPLAN, editor, revue BIGRE+GLOBULE, Aix-en-Provence, 1987.
W. Bousdira and J.L. Rémy. Hierarchical contextual rewriting with several levels. In R. Cori and M. Wirsing, editors, Lecture Notes in Computer Science, pages 193–206, 5th Synposium on Theoretical Aspects of Computer Science, Springer-Verlag, Bordeaux France, 1988.
H. Ganzinger. A completion procedure for conditional equations specifications. In to appear in Journal of Symbolic Computation, 1987.
H. Ganzinger. Ground term confluence in parametric conditional equational specifications. In F.J. Brandenburg, G. Vidal, and M. Wirsing, editors, Lecture Notes in Computer Science No 247, pages 286–298, 4th annual Symposium on Theoretial Aspects of Computer Science, Springer-Verlag, Passau RFA, 1987.
J.A. Goguen and J. Meseguer. Completeness of many-sorted equational logic. Technical Report CSLI-84-15, Center for the Study of Language and Information Stanford University, 1984.
G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems. Journal of the Associations for Computing Machinery, 27(4):797–821, 1980. Preliminary version of the 18th Symposium on Foundations of Computer Science.
J.P. Jouannaud and B. Waldmann. Reductive conditional term rewriting systems. In M. Wirsing, editor, Elsevier Science Publishers, 3rd IFIP Conf. on Formal description of Programming Concepts, Ebberup Denmark, 1986.
S. Kaplan. Conditional rewrite rules. Theoretical Computer Science. 3:175–193, 1984.
S. Kaplan. Simplifying conditional term rewriting systems: unification, termination and confluence. to appear in Journal of Symbolic Computation, 1987.
D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra. pages 263–297, Pergamon Press, Elmsford N.Y, 1970.
S. Kaplan and J.L. Rémy. Completion algorithms for conditional rewriting systems. In H. Ait-Kaci and M. Nivat, editors, Proceedings of the MCC-INRIA Colloquium on the Resolution of Equations in Algebraic Structures, MCC and INRIA, Austin Texas, 1987.
M. Navarro. Técnicas de Reescritura para especificaciones condicionales. Thèse Doctorale, Barcelone, 1987.
M. Navarro and F. Orejas. On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems. In Eurosam Conference, Oxford, 1984.
M. Navarro and F. Orejas. Parameterized horn clause specifications: proof theory and correctness. In Lecture Notes in Computer Science, pages 202–216, TAPSOFT'87, Springer-Verlag 249, Pisa Italy, 1984.
J.L. Rémy and H. Zhang. Reveur4: a system for validating conditional algebraic specifications of abstract data types. In ECAI, 6th ECAI Conference, Pisa Italy, 1984.
H. Zhang. REVEUR4: Etude et mise en œuvre de la réécriture conditionnelle. Université de Nancy 1, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Akademie-Verlag Berlin
About this paper
Cite this paper
Bousdira, W. (1988). A completion procedure for hierarchical conditional rewriting systems. In: Grabowski, J., Lescanne, P., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1988. Lecture Notes in Computer Science, vol 343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50667-5_61
Download citation
DOI: https://doi.org/10.1007/3-540-50667-5_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50667-6
Online ISBN: 978-3-540-46063-3
eBook Packages: Springer Book Archive