52 search results - page 1 / 11 » Reexecution-Based Analysis of Logic Programs with Delay Decl... |
ERSHOV
2001
Springer
13 years 9 months ago
2001
Springer
A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on r...
CL
2000
Springer
13 years 4 months ago
2000
Springer
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
ICLP
1992
Springer
13 years 8 months ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
TPLP
2002
13 years 4 months ago
2002
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...
ESOP
2001
Springer
13 years 9 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 ...