Paper Info
Title
Lifting of L-Narrowing Derivations
Abstract
If conditional rewrite-rules are restricted to the form P --> f(x(1),...,x(n)) --> t where P is a finite set of equations, f is any function symbol, x(1),...,x(n) are variables, and t is any term then the premise P contains in general variables which do not occur in the list x(1),...,x(n). The rule with premise P can be applied if P is satisfiable. Therefore, we need methods to solve P and narrowing must be combined with rewriting. But, narrowing becomes a special case, called L-narrowing, closely related to lazy-narrowing. Two lifting lemmas are shown which characterize the relationship of L-narrowing: derivations if the goals are modified by substitutions. From these lifting lemmas, soundness and completeness results can be concluded.
Year
Venue
Keywords
1997
COMPUTERS AND ARTIFICIAL INTELLIGENCE
narrowing,rewriting
Field
DocType
Volume
Discrete mathematics,Finite set,Symbol,Premise,Rewriting,Soundness,Completeness (statistics),Mathematics,Lemma (mathematics),Special case
Journal
16
Issue
ISSN
Citations 
3
0232-0274
0
PageRank 
References 
Authors
0.34
10
1
Name
Order
Citations
PageRank
Peter Bachmann153.95