700 search results - page 12 / 140 » On Termination of Constraint Logic Programs |
182
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
137
click to vote
CAV
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
153
click to vote
FROCOS
2007
Springer
16 years 2 days ago
2007
Springer
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
150
click to vote
ICLP
1993
Springer
15 years 10 months ago
1993
Springer
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
168
click to vote
ICLP
1999
Springer
15 years 10 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...