scholarly journals A New Approach to Non-termination Analysis of Logic Programs

2009 ◽  
pp. 220-234 ◽  
Author(s):  
Dean Voets ◽  
Danny De Schreye
Keyword(s):  
Logic Programs ◽  
New Approach ◽  
Termination Analysis

scholarly journals Reuse of Results in Termination Analysis of Typed Logic Programs

2002 ◽  
pp. 477-492 ◽  
Author(s):  
Maurice Bruynooghe ◽  
Michael Codish ◽  
Samir Genaim ◽  
Wim Vanhoof
Keyword(s):  
Logic Programs ◽  
Termination Analysis

scholarly journals Termination analysis of logic programs through combination of type-based norms

2007 ◽  
Vol 29 (2) ◽  
pp. 10 ◽  
Author(s):  
Maurice Bruynooghe ◽  
Michael Codish ◽  
John P. Gallagher ◽  
Samir Genaim ◽  
Wim Vanhoof
Keyword(s):  
Logic Programs ◽  
Termination Analysis

scholarly journals Polytool: Polynomial interpretations as a basis for termination analysis of logic programs

2010 ◽  
Vol 11 (1) ◽  
pp. 33-63 ◽  
Author(s):  
MANH THANG NGUYEN ◽  
DANNY DE SCHREYE ◽  
JÜRGEN GIESL ◽  
PETER SCHNEIDER-KAMP
Keyword(s):  
Logic Programs ◽  
Termination Analysis ◽  
Rewrite Systems ◽  
Analysis Techniques ◽  
Programming Paradigm ◽  
Generating Polynomial ◽  
Direct Generalization ◽  
Term Rewrite Systems

AbstractOur goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt termination analysis techniques based on polynomial interpretations—very well known in the context of term rewrite systems—to obtain new (nontransformational) termination analysis techniques for definite logic programs (LPs). This leads to an approach that can be seen as a direct generalization of the traditional techniques in termination analysis of LPs, where linear norms and level mappings are used. Our extension generalizes these to arbitrary polynomials. We extend a number of standard concepts and results on termination analysis to the context of polynomial interpretations. We also propose a constraint-based approach for automatically generating polynomial interpretations that satisfy the termination conditions. Based on this approach, we implemented a new tool, called Polytool, for automatic termination analysis of LPs.

scholarly journals A model building framework for answer set programming with external computations

2015 ◽  
Vol 16 (4) ◽  
pp. 418-464 ◽  
Author(s):  
THOMAS EITER ◽  
MICHAEL FINK ◽  
GIOVAMBATTISTA IANNI ◽  
THOMAS KRENNWALLNER ◽  
CHRISTOPH REDL ◽  
...  
Keyword(s):  
Model Building ◽  
External Source ◽  
Software Systems ◽  
Logic Programs ◽  
New Approach ◽  
Evaluation Approach ◽  
Real World Application ◽  
External Sources ◽  
Model Graph ◽  
Answer Set

AbstractAs software systems are getting increasingly connected, there is a need for equipping nonmonotonic logic programs with access to external sources that are possibly remote and may contain information in heterogeneous formats. To cater for this need,hexprograms were designed as a generalization of answer set programs with an API style interface that allows to access arbitrary external sources, providing great flexibility. Efficient evaluation of such programs however is challenging, and it requires to interleave external computation and model building; to decide when to switch between these tasks is difficult, and existing approaches have limited scalability in many real-world application scenarios. We present a new approach for the evaluation of logic programs with external source access, which is based on a configurable framework for dividing the non-ground program into possibly overlapping smaller parts called evaluation units. The latter will be processed by interleaving external evaluation and model building using an evaluation graph and a model graph, respectively, and by combining intermediate results. Experiments with our prototype implementation show a significant improvement compared to previous approaches. While designed forhex-programs, the new evaluation approach may be deployed to related rule-based formalisms as well.

scholarly journals A General Framework for Automatic Termination Analysis of Logic Programs

2001 ◽  
Vol 12 (1-2) ◽  
pp. 117-156 ◽  
Author(s):  
Nachum Dershowitz ◽  
Naomi Lindenstrauss ◽  
Yehoshua Sagiv ◽  
Alexander Serebrenik
Keyword(s):  
General Framework ◽  
Logic Programs ◽  
Termination Analysis

A New Approach for Termination Analysis of Active Rules

2006 ◽  
Vol 6 (3) ◽  
pp. 657-661
Author(s):  
H. Belbachir ◽  
N.S. Ougouti
Keyword(s):  
Active Rules ◽  
New Approach ◽  
Termination Analysis
Sign in / Sign up

Export Citation Format

Share Document