18 search results - page 1 / 4 » Termination of narrowing via termination of rewriting |
AAECC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
LICS
1994
IEEE
13 years 9 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
RTA
1991
Springer
13 years 8 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
CCL
1994
Springer
13 years 9 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
ICTAC
2004
Springer
13 years 10 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...