551 search results - page 74 / 111 » {log}: A Logic Programming Language with Finite Sets |
ICLP
2009
Springer
14 years 22 days ago
2009
Springer
Abstract. Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP co...
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
ICALP
2001
Springer
14 years 19 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...