700 search results - page 2 / 140 » On Termination of Constraint Logic Programs |
SAS
2005
Springer
13 years 11 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
PPDP
1999
Springer
13 years 10 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...
LPAR
2001
Springer
13 years 10 months ago
2001
Springer
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
CADE
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
ICLP
2010
Springer
13 years 4 months ago
2010
Springer
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...