117 search results - page 2 / 24 » A Dynamic Approach to Characterizing Termination of General ... |
124
Voted
ICLP
1999
Springer
15 years 6 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
122
click to vote
PPDP
1999
Springer
15 years 6 months ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
221
click to vote
POPL
2008
ACM
16 years 2 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
142
click to vote
ICLP
1992
Springer
15 years 5 months ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
101
click to vote
PEPM
2007
ACM
15 years 8 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...