From Logic Programming to Prolog, 1997. ,
Modular termination proofs for logic and pure Prolog programs, Advances in Logic Programming Theory, pp.183-229, 1994. ,
Termination of logic programs using semantic unification, Logic Program Synthesis and Transformation, vol.1048, 1996. ,
Loop checking in partial deduction, Journal of Logic Programming, vol.16, pp.25-46, 1993. ,
An analysis of loop checking mechanisms for logic programs, Theoretical Computer Science, vol.86, pp.35-79, 1991. ,
Predicate logic as a computational formalism, 1979. ,
A semantic basis for the termination analysis of logic programs, Journal of Logic Programming, vol.41, pp.103-123, 1999. ,
On the existence of nonterminating queries for a restricted class of Prolog-clauses, Artificial Intelligence, vol.41, pp.237-248, 1989. ,
Termination of logic programs : the never-ending story, Journal of Logic Programming, vol.19, pp.199-260, 1994. ,
A practical technique for detecting non-terminating queries for a restricted class of Horn clauses, using directed, weighted graphs, Proc. of ICLP'90, pp.649-663, 1990. ,
Programmation en logique avec négation: présentation formelle, 1987. ,
A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing, vol.12, issue.2, pp.117-156, 2001. ,
Weighted graphs, a tool for expressing the behavious of recursive rules in logic programming. I. for New Generation Computer Technology (ICOT), Ed. OHMSHA Ltd. Tokyo and Springer-Verlag, 397-404, Proc. of the Inter. Conf. on Fifth Generation Computer Systems, vol.88, 1988. ,
Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming, Theoretical Computer Science, vol.75, pp.157-215, 1990. ,
Halting problem of one binary Horn clause is undecidable, Proc. of STACS'93, vol.665, pp.48-57, 1993. ,
URL : https://hal.archives-ouvertes.fr/hal-00732053
Goal independency and call patterns in the analysis of logic programs, Proceedings of the ACM Symposium on applied computing, pp.394-399, 1994. ,
Inferring termination condition for logic programs using backwards analysis, Proceedings of Logic for Programming, 2001. ,
Finite failure is and-compositional, Journal of Logic and Computation, vol.7, pp.753-776, 1997. ,
Constraint logic programming, Proc. of the ACM Symposium on Principles of Programming Languages, pp.111-119, 1987. ,
TermiLog: a system for checking termination of queries to logic programs, 1997. ,
Foundations of Logic Programming, 1987. ,
A model-theoretic reconstruction of the operational semantics of logic programs, Information and Computation, vol.102, pp.86-113, 1993. ,
Inferring left-terminating classes of queries for constraint logic programs by means of approximations, Proc. of the 1996 Joint Intl. Conf. and Symp. on Logic Programming, pp.7-21, 1996. ,
cTI: a constraint-based termination inference tool for ISO-Prolog. Theory and Practice of Logic Programming, 2004. ,
cTI: a tool for inferring termination conditions of ISOProlog, 2000. ,
Applying static analysis techniques for inferring termination conditions of logic programs, Static Analysis Symposium, P. Cousot, vol.2126, pp.93-110, 2001. ,
Detecting optimal termination conditions of logic programs, Proc. of the 9th International Symposium on Static Analysis, vol.2477, pp.509-525, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-01915746
The Craft of Prolog, 1990. ,
Non-termination inference of logic programs, Proc. of the 11th International Symposium on Static Analysis, vol.3148, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00129526
Terminations proofs for logic programs. Number 446 in LNAI, 1990. ,
The mixtus approach to automatic partial evaluation of full Prolog, Proc. of the 1990 North American Conference on Logic Programming, pp.377-398, 1990. ,
Mixtus: an automatic partial evaluator for full Prolog, New Generation Computing, vol.12, pp.7-51, 1993. ,
Implication of clauses is undecidable, Theoretical Computer Science, vol.59, pp.287-296, 1988. ,
An extended variant of atoms loop check for positive logic programs, New Generation Computing, vol.15, pp.187-204, 1997. ,
A dynamic approach to characterizing termination of general logic programs, ACM Transactions on Computational Logic, vol.4, pp.417-434, 2003. ,
Loops checks for logic programs with functions, Theoretical Computer Science, vol.266, pp.441-461, 2001. ,