480 search results - page 13 / 96 » Continuations for parallel logic programming |
ICFP
2003
ACM
14 years 7 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...
LANMR
2004
13 years 9 months ago
2004
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
IWFM
2000
13 years 9 months ago
2000
Several recent publications have exhibited relationships between the theories of logic programming and of neural networks. We consider a general approach to representing normal lo...
LPNMR
1999
Springer
13 years 11 months ago
1999
Springer
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
ARTS
1999
Springer
13 years 12 months ago
1999
Springer
In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and...