NARROWER: a new algorithm for unification and its application to logic programming
Proc. of the first international conference on Rewriting techniques and applications
Handling function definitions through innermost superposition and rewriting
Proc. of the first international conference on Rewriting techniques and applications
Improving basic narrowing techniques
on Rewriting techniques and applications
Computing in Horn clause theories
Computing in Horn clause theories
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Journal of Symbolic Computation
Foundations of Equational Logic Programming
Foundations of Equational Logic Programming
Unification modulo an equality theory for equational logic programming
Journal of Computer and System Sciences
Detecting redundant narrowing derivations by the LSE-SL reducibility test
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Solving Equations in an Equational Language
Proceedings of the International Workshop on Algebraic and Logic Programming
Narrowing with Built-In Theories
Proceedings of the International Workshop on Algebraic and Logic Programming
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
On Comleteness of Narrowing Strategies
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
An Optimal Narrowing Strategy for General Canonical Systems
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Complete Strategies for Term Graph Narrowing
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
| Hi-index | 0.00 |
Narrowing is a universal unification procedure for equational theories defined by a,canonical term rewriting system. In its original form it is extremely inefficient. Therefore, many optimizations have been proposed during the last years. In this paper, we present the narrowing strategies for arbitrary canonical systems in a uniform framework and introduce the new narrowing strategy LSE narrowing. LSE narrowing is complete and improves all other strategies which are complete for arbitrary-canonical systems. It is optimal in the sense that two different LSE narrowing derivations cannot generate the same narrowing substitution. Moreover, LSE narrowing computes only normalized narrowing substitutions.