3 papers
cs.PL2005
An Improved Non-Termination Criterion for Binary Constraint Logic Programs
Etienne Payet, Fred Mesnard
On one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis s…
cs.PL2004
Non-Termination Inference of Logic Programs
Etienne Payet, Fred Mesnard
We present a static analysis technique for non-termination inference of logic programs. Our framework relies on an extension of the subsumption test, where some specific argument p…
cs.LO2002
A Generalization of the Lifting Lemma for Logic Programming
Etienne Payet, Fred Mesnard
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…