47 search results - page 8 / 10 » Shallow Lazy Proofs |
ENTCS
2000
13 years 7 months ago
2000
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
Preserving historic recording on gramophone records is an important task because the traditional record play back system damages/wears out records eventually. We present an optica...
JFP
2000
13 years 7 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
CP
2007
Springer
14 years 1 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...