700 search results - page 7 / 140 » On Termination of Constraint Logic Programs |
LOPSTR
2004
Springer
14 years 23 days ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
ICLP
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
PEPM
2007
ACM
14 years 1 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...
ESOP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
PODS
1991
ACM
13 years 11 months ago
1991
ACM
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...