Sciweavers

88 search results - page 1 / 18
» The Dependency Triple Framework for Termination of Logic Pro...
Sort
View
LOPSTR
2009
Springer
14 years 1 months ago
The Dependency Triple Framework for Termination of Logic Programs
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
Peter Schneider-Kamp, Jürgen Giesl, Manh Than...
LOPSTR
2007
Springer
14 years 1 months ago
Termination Analysis of Logic Programs Based on Dependency Graphs
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
Manh Thang Nguyen, Jürgen Giesl, Peter Schnei...
LOPSTR
2009
Springer
14 years 1 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...
ICLP
1997
Springer
13 years 11 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
CADE
2006
Springer
14 years 7 months ago
Automatic Termination Proofs in the Dependency Pair Framework
Jürgen Giesl, Peter Schneider-Kamp, Ren&eacut...