Non-termination Analysis of Logic Programs Using Types

Voets, Dean; Schreye, Danny De

doi:10.1007/978-3-642-20551-4_9

Cited by 4 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The program termination problem has received a significant attention since the beginning of logic programming and deductive databases (Krishnamurthy et al 1996) and has recently received an increasing interest. A considerable body of work has been done on termination of logic programs under top-down evaluation (Schreye and Decorte 1994;Marchiori 1996;Ohlebusch 2001;Bonatti 2004;Codish et al 2005;Serebrenik and De Schreye 2005;Bruynooghe et al 2007;Nguyen et al 2007;Baselice et al 2009;Schneider-Kamp et al 2009a;Schneider-Kamp et al 2009b;Nishida and Vidal 2010;Schneider-Kamp et al 2010;Ströder et al 2010;Voets and Schreye 2010;Brockschmidt et al 2012;Liang and Kifer 2013). In this context, the class of finitary programs, allowing decidable (ground) query computation using a top-down evaluation, has been proposed in (Bonatti 2004;Baselice et al 2009).…”

Section: Introductionmentioning

confidence: 99%

Checking termination of bottom-up evaluation of logic programs with function symbols

Greco¹,

Spezzano²,

Trubitsyna³

2014

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Recently, there has been an increasing interest in the bottom-up evaluation of the semantics of logic programs with complex terms. The presence of function symbols in the program may render the ground instantiation infinite, and finiteness of models and termination of the evaluation procedure, in the general case, are not guaranteed anymore. Since the program termination problem is undecidable in the general case, several decidable criteria (called program termination criteria) have been recently proposed. However, current conditions are not able to identify even simple programs, whose bottom-up execution always terminates.The paper introduces new decidable criteria for checking termination of logic programs with function symbols under bottom-up evaluation, by deeply analyzing the program structure. First, we analyze the propagation of complex terms among arguments by means of the extended version of the argument graph called propagation graph. The resulting criterion, called Γ-acyclicity, generalizes most of the decidable criteria proposed so far. Next, we study how rules may activate each other and define a more powerful criterion, called safety. This criterion uses the so-called safety function able to analyze how rules may activate each other and how the presence of some arguments in a rule limits its activation. We also study the application of the proposed criteria to bound queries and show that the safety criterion is well-suited to identify relevant classes of programs and bound queries. Finally, we propose a hierarchy of classes of terminating programs, called k-safety, where the k-safe class strictly includes the (k-1)-safe class.

show abstract

Section: Introductionmentioning

confidence: 99%

Checking termination of bottom-up evaluation of logic programs with function symbols

Greco¹,

Spezzano²,

Trubitsyna³

2014

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…An evaluation of the classes of queries not handled by current approaches lead to considerable improvements in our non-termination analysis. These improvements were presented in [11] and implemented in the analyzer pT N T .…”

Section: Introductionmentioning

confidence: 99%

Non-termination analysis of logic programs with integer arithmetics

Voets¹,

Schreye²

2011

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

In the past years, analyzers have been introduced to detect classes of non-terminating queries for definite logic programs. Although these non-termination analyzers have shown to be rather precise, their applicability on real-life Prolog programs is limited because most Prolog programs use non-logical features. As a first step towards the analysis of Prolog programs, this paper presents a nontermination condition for Logic Programs containing integer arithmetics. The analyzer is based on our non-termination analyzer presented at ICLP 2009. The analysis starts from a class of queries and infers a subclass of non-terminating ones. In a first phase, we ignore the outcome (success or failure) of the arithmetic operations, assuming success of all arithmetic calls. In a second phase, we characterize successful arithmetic calls as a constraint problem, the solution of which determines the non-terminating queries.Keywords : non-termination analysis, numerical computation, constraint-based approach. * Supported by the Fund for Scientific Research -FWO-project G0561-08 Abstract. In the past years, analyzers have been introduced to detect classes of non-terminating queries for definite logic programs. Although these non-termination analyzers have shown to be rather precise, their applicability on real-life Prolog programs is limited because most Prolog programs use non-logical features. As a first step towards the analysis of Prolog programs, this paper presents a non-termination condition for Logic Programs containing integer arithmetics. The analyzer is based on our non-termination analyzer presented at ICLP 2009. The analysis starts from a class of queries and infers a subclass of non-terminating ones. In a first phase, we ignore the outcome (success or failure) of the arithmetic operations, assuming success of all arithmetic calls. In a second phase, we characterize successful arithmetic calls as a constraint problem, the solution of which determines the non-terminating queries.

show abstract

Non-termination Analysis and Cost-Based Query Optimization of Logic Programs

Liang

2012

Web Reasoning and Rule Systems

View full text Add to dashboard Cite

Non-termination Analysis of Logic Programs Using Types

Cited by 4 publications

References 9 publications

Checking termination of bottom-up evaluation of logic programs with function symbols

Checking termination of bottom-up evaluation of logic programs with function symbols

Non-termination analysis of logic programs with integer arithmetics

Non-termination Analysis and Cost-Based Query Optimization of Logic Programs

Contact Info

Product

Resources

About