Termination of logic programs: the never-ending story

Schreye, Danny De; Decorte, Stefaan

doi:10.1016/0743-1066(94)90027-2

Cited by 156 publications

(143 citation statements)

References 44 publications

Supporting

Mentioning

143

Contrasting

Order By: Relevance

“…So LD-derivations are SLD-derivations generated by the Prolog selection rule. In the literature a lot of attention has been devoted to the study of termination with respect to the P:rolog selection rule (see for example the survey article of De Schreye and Decorte [SD94]). This work can be use to deal with termination in presence of delay declarations.…”

Section: Termination For Guarded Programsmentioning

confidence: 99%

Verification of logic programs with delay declarations

Apt

Luitjes

1995

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

.Abstract. Logic programs augmented with delay declarations form a higly expressive programming language in which dynamic networks of processes that communicate asynchronously by means of multiparty channels can be easily created. In this paper we study correctness these programs. In particular, we propose proof methods allowing us to deal with occur check freedom, absence of deadlock, absence of errors in presence of arithmetic relations, and termination. These methods turn out to be simple modifications of the corresponding methods dealing with Prolog programs. This allows us to derive correct delay declarations by analysing Prolog programs. Finally, we point out difficulties concerning proofs of termination.Note. The research of the first author was partly supported by the ES-PRJT Basic Research Action 6810 (Compulog 2).

show abstract

Section: Termination For Guarded Programsmentioning

confidence: 99%

Verification of logic programs with delay declarations

Apt

Luitjes

1995

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

show abstract

“…The survey of De Schreye & Decorte [23], dated 1994, distinguishes three types of approaches: the ones that express necessary and sufficient conditions for termination, the ones that provide decidable sufficient conditions, and the ones that prove decidability or undecidability for subclasses of programs and queries. Under this classification, this survey paper has been mainly concerned with the first type.…”

Section: Related Workmentioning

confidence: 99%

“…In termination analysis, it is usually not necessary to consider the least Herbrand model, which may be difficult or impossible to determine. Instead, one uses models that capture some argument size relationship between the arguments of each predicate [23]. For example, a model for the usual append predicate is {append(xs, ys, zs) | length(zs) = length(xs) + length(ys)}.…”

Section: Modelsmentioning

confidence: 99%

“…Like most approaches to the termination problem, we are interested in universal termination of logic programs and queries, that is, showing that all derivations for a program and query (via a certain selection rule) are finite. This is in contrast to existential termination [10,23,48]. Also, we consider definite logic programs, as opposed to logic programs that also contain negated literals in clause bodies.…”

Section: Introductionmentioning

confidence: 99%

“…A program P and query Q leftterminate if they terminate for the LD selection rule. The vast majority of the literature is concerned with this class; see [23] for an overview. A program P and query Q ∃-terminate if there exists a selection rule for which they terminate.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Characterisations of Termination in Logic Programming

Pedreschi

Ruggieri

Smaus

2004

Program Development in Computational Logic

View full text Add to dashboard Cite

Abstract. The procedural interpretation of logic programs and queries is parametric to the selection rule, i.e. the rule that determines which atom is selected in each resolution step. Termination of logic programs and queries depends critically on the selection rule. In this survey, we present a unified view and comparison of seven notions of universal termination considered in the literature, and the corresponding classes of programs. For each class, we focus on a sufficient, and in most cases even necessary, declarative characterisation for determining that a program is in that class. By unifying different formalisms and making appropriate assumptions, we are able to establish a formal hierarchy between the different classes and their respective declarative characterisations.

show abstract