A Generalization of the Lifting Lemma for Logic Programming

Details A Generalization of the Lifting Lemma for Logic Programming A Generalization of the Lifting Lemma for Logic Programming

2002-12-11

arxiv.org/abs/cs/0212026v1

Computer Science

Logic in Computer Science

25 pages, submitted to TOCL

Scientific paper

Since the seminal work of J. A. Robinson on resolution, many lifting lemmas for simplifying proofs of completeness of resolution have been proposed in the literature. In the logic programming framework, they may also help to detect some infinite derivations while proving goals under the SLD-resolution. In this paper, we first generalize a version of the lifting lemma, by extending the relation "is more general than" so that it takes into account only some arguments of the atoms. The other arguments, which we call neutral arguments, are disregarded. Then we propose two syntactic conditions of increasing power for identifying neutral arguments from mere inspection of the text of a logic program.

Affiliated with

Also associated with

No associations

Rating

A Generalization of the Lifting Lemma for Logic Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Generalization of the Lifting Lemma for Logic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Generalization of the Lifting Lemma for Logic Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-637963