A Generalization of the Lifting Lemma for Logic Programming
| dc.creator | Payet, Etienne | |
| dc.creator | Mesnard, Fred | |
| dc.date | 2002-12-11 | |
| dc.date.accessioned | 2026-07-07T03:19:15Z | |
| dc.date.available | 2026-07-07T03:19:15Z | |
| dc.description | 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. | |
| dc.description | 25 pages, submitted to TOCL | |
| dc.identifier | https://arxiv.org/abs/cs/0212026 | |
| dc.identifier | http://arxiv.org/abs/cs/0212026 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31385 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.1.6 | |
| dc.title | A Generalization of the Lifting Lemma for Logic Programming | |
| dc.type | text |