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
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. I...
Although originally introduced as a theorem proving method to solve equational unification problems,...
AbstractAutomated reasoning modulo an equational theory E is a fundamental technique in many applica...
Narrowing is a universal unification procedure for equational theories defined by a canonical term r...
Narrowing is a universal unification procedure for equational theories defined by a canonical term r...
Narrowing is a complete unification procedure for equational theories defined by canonical term rewr...
In an earlier paper, we introduced LSE narrowing, which is an optimal narrowing strategy for arbitra...
The narrowing relation over terms constitutes the basis of the most important operational semantics ...
Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed a...
AbstractWe address the problem of unification modulo a set of equations, using the narrowing relatio...
AbstractNarrowing is a well-known complete procedure for equational E-unification when E can be deco...
Narrowing is a universal unification procedure for equational theories given by a canonical term rew...
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. I...
Rewriting and narrowing provide a nice theoretical framework for the integration of logic and functi...
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. I...
Although originally introduced as a theorem proving method to solve equational unification problems,...
AbstractAutomated reasoning modulo an equational theory E is a fundamental technique in many applica...
Narrowing is a universal unification procedure for equational theories defined by a canonical term r...
Narrowing is a universal unification procedure for equational theories defined by a canonical term r...
Narrowing is a complete unification procedure for equational theories defined by canonical term rewr...
In an earlier paper, we introduced LSE narrowing, which is an optimal narrowing strategy for arbitra...
The narrowing relation over terms constitutes the basis of the most important operational semantics ...
Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed a...
AbstractWe address the problem of unification modulo a set of equations, using the narrowing relatio...
AbstractNarrowing is a well-known complete procedure for equational E-unification when E can be deco...
Narrowing is a universal unification procedure for equational theories given by a canonical term rew...
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. I...
Rewriting and narrowing provide a nice theoretical framework for the integration of logic and functi...
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. I...
Although originally introduced as a theorem proving method to solve equational unification problems,...
AbstractAutomated reasoning modulo an equational theory E is a fundamental technique in many applica...