LOPSTR
13 years 10 months ago
2004 Springer 
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
LOPSTR
13 years 10 months 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...
LOPSTR
13 years 10 months ago
2004 Springer
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
LOPSTR
13 years 10 months ago
2004 Springer 
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
LOPSTR
13 years 10 months 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...
|
Automated Reasoning