700 search results - page 5 / 140 » On Termination of Constraint Logic Programs |
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
CONSTRAINTS
1999
13 years 7 months ago
1999
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
LOPSTR
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...