Abstract
Rewriting and narrowing provide a nice theoretical framework for the integration of logic and functional programming. For practical applications however, narrowing is still much too inefficient. In this paper we show how reducibility tests can be used to detect redundant narrowing derivations. We introduce a new narrowing strategy, LSE-SL left-to-right basic normal narrowing, prove its completeness for arbitrary canonical term rewriting systems, and demonstrate how it increases the efficiency of the narrowing process.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Bockmayr: Conditional Rewriting and Narrowing as a Theoretical Framework for Logic-Functional Programming: A Survey. Interner Bericht 10/86, Fakultät für Informatik, Universität Karlsruhe, 1986
A. Bockmayr: Narrowing with Inductively Defined Functions. Interner Bericht 25/86, Fakultät für Informatik, Universität Karlsruhe, 1986
A. Bockmayr: Narrowing with Built-in Theories. First Int. Workshop Logic and Algebraic Programming, Gaußig, DDR, 1988, Springer LNCS 343
P. G. Bosco, E. Giovannetti, C. Moiso: Narrowing vs. SLD-Resolution. Theoretical Computer Science 59 (1988), 3–23
J. Darlington, Y. Guo: Narrowing and Unification in Functional Programming — an Evaluation Mechanism for Absolute Set Abstraction. Rewriting Techniques and Applications, Chapel Hill, 1989, Springer LNCS 355
N. Dershowitz, D. A. Plaisted: Logic Programming cum Applicative Programming. Symp. on Logic Programming, Boston 1985, IEEE
N. Dershowitz, D. A. Plaisted: Equational Programming. Mach. Intell. 11 (Ed. J. Richards), Oxford, 1988
R. Echahed: On Completeness of Narrowing Strategies. CAAP 88, Nancy, Springer LNCS 299
L. Fribourg: Handling Function Definitions Through Innermost Superposition and Rewriting. Rewriting Techniques and Applications, Dijon, 1985, Springer LNCS 202
A. Herold: Narrowing Techniques Applied to Idempotent Unification. SEKI Report SR-86-16, Universität Kaiserslautern, 1986
S. Hölldobler: Foundations of Equational Logic Programming. Springer, LNCS 353, 1989
G. Huet, D. C. Oppen: Equations and Rewrite Rules, A Survey. Formal Language Theory (Ed. R. V. Book), Academic Press 1980
J. M. Hullot: Canonical Forms and Unification. 5th Conference on Automated Deduction, Les Arcs 1980, Springer LNCS 87
S. Krischer: Vergleich und Bewertung von Narrowing-Strategien. Diplomarbeit, Fakultät für Informatik, Universität Karlsruhe, 1990
W. Nutt, P. Réty, G. Smolka: Basic Narrowing Revisited. J. Symb. Comput. 7 (1989), 295–317
P. Padawitz: Computing in Horn Clause Theories. EATCS Monograph Vol. 16, Springer, 1988
P. Réty, C. Kirchner, H. Kirchner, P. Lescanne: NARROWER: a New Algorithm for Unification and its Application to Logic Programming. Rewriting Techniques and Applications, Dijon, 1985, Springer LNCS 202
P. Réty: Improving Basic Narowing Techniques. Rewriting Techniques and Applications, Bordeaux, 1987, Springer LNCS 256
P. Réty: Méthodes d'Unification par Surréduction. Thèse. Univ. Nancy, 1988
J. You: Solving Equations in an Equational Language. First Int. Workshop Logic and Algebraic Programming, Gaußig, DDR, 1988, Springer LNCS 343
J. You: Unification Modulo an Equality Theory for Equational Logic Programming. to appear in: J. Comp. Syst. Sc. 40 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krischer, S., Bockmayr, A. (1991). Detecting redundant narrowing derivations by the LSE-SL reducibility test. In: Book, R.V. (eds) Rewriting Techniques and Applications. RTA 1991. Lecture Notes in Computer Science, vol 488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53904-2_87
Download citation
DOI: https://doi.org/10.1007/3-540-53904-2_87
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53904-9
Online ISBN: 978-3-540-46383-2
eBook Packages: Springer Book Archive