Loop checks for logic programs with functions

Shen, Yi-Dong; Yuan, Li-Yan; You, Jia-Huai

doi:10.1016/s0304-3975(00)00197-3

Cited by 14 publications

(20 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For such an application, they play a role similar to expanded variants defined in [Shen et al 2001]. Informally, expanded variants are variants except that some terms may grow bigger.…”

Section: Related Workmentioning

confidence: 99%

A dynamic approach to characterizing termination of general logic programs

Shen

You

Yuan

et al. 2003

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a logic program, such as modes/types, norms/level mappings, models/interargument relations, and the like. We propose a dynamic approach which employs some key dynamic features of an infinite (generalized) SLDNF-derivation, such as repetition of selected subgoals and recursive increase in term size. We also introduce a new formulation of SLDNF-trees, called generalized SLDNF-trees. Generalized SLDNF-trees deal with negative subgoals in the same way as Prolog and exist for any general logic programs.

show abstract

“…For such an application, they play a role similar to expanded variants defined in [Shen et al 2001]. Informally, expanded variants are variants except that some terms may grow bigger.…”

Section: Related Workmentioning

confidence: 99%

A dynamic approach to characterizing termination of general logic programs

Shen

You

Yuan

et al. 2003

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

show abstract

“…VAF-check says that an SLD-derivation may be infinite if it generates an atomic subgoal A that is an expanded variant of some of its ancestor A ′ . VAF-check is as reliable as and more efficient than EVA-check [36]. The main difference with our work is that we want to infer atomic queries which are guaranteed to be left looping.…”

Section: Related Workmentioning

confidence: 96%

“…To our best knowledge, among all existing loop checking mechanisms only OS-check [32], EVA-check [34] and VAF-check [36] are suitable for logic programs with function symbols. They rely on a structural characteristic of infinite SLDderivations, namely, the growth of the size of some generated subgoals.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Nontermination inference of logic programs

Payet

Mesnard

2006

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

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 positions can be instantiated while others are generalized. We give syntactic criteria to statically identify such argument positions from the text of a program. Atomic left looping queries are generated bottom-up from selected subsets of the binary unfoldings of the program of interest. We propose a set of correct algorithms for automating the approach. Then, non-termination inference is tailored to attempt proofs of optimality of left termination conditions computed by a termination inference tool. An experimental evaluation is reported. When termination and non-termination analysis produce complementary results for a logic procedure, then with respect to the leftmost selection rule and the language used to describe sets of atomic queries, each analysis is optimal and together, they induce a characterization of the operational behavior of the logic procedure.

show abstract

“…We can divide this line of research into two kinds of approaches: dynamic versus static analysis. In the former one, (Bol et al 1991) sets up some solid foundations for loop checking, while (Shen et al 2001) presents some recent work. The main idea is to prune infinite derivations at runtime (some finite derivations may also be pruned by some loop checkers).…”

Section: Introductionmentioning

confidence: 99%

A non-termination criterion for binary constraint logic programs

Payet

Mesnard

2009

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Note: this paper has been accepted for publication in Theory and Practice of Logic Programming (TPLP). AbstractOn the 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 seems to remain a much less attractive subject. If we divide this line of research into two kinds of approaches: dynamic versus static analysis, this paper belongs to the latter. It proposes a criterion for detecting non-terminating atomic queries with respect to binary CLP rules, which strictly generalizes our previous works on this subject. We give a generic operational definition and an implemented logical form of this criterion. Then we show that the logical form is correct and complete with respect to the operational definition.

show abstract

Loop checks for logic programs with functions

Cited by 14 publications

References 22 publications

A dynamic approach to characterizing termination of general logic programs

A dynamic approach to characterizing termination of general logic programs

Nontermination inference of logic programs

A non-termination criterion for binary constraint logic programs

Contact Info

Product

Resources

About