Sciweavers

ESOP
2001
Springer
14 years 4 months ago
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
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 ...
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-G...
ERSHOV
2001
Springer
14 years 4 months ago
Reexecution-Based Analysis of Logic Programs with Delay Declarations
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...
Agostino Cortesi, Baudouin Le Charlier, Sabina Ros...
FLOPS
2010
Springer
14 years 7 months ago
A Pearl on SAT Solving in Prolog
A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is su...
Jacob M. Howe, Andy King