400 search results - page 6 / 80 » Backtracking |
CP
2004
Springer
14 years 1 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
GI
2009
Springer
14 years 1 months ago
2009
Springer
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
IJCAI
1989
13 years 9 months ago
1989
A model of unrestricted And-parallel execution for logic programs is described, based on Dependency Directed Backtracking (DDBT) aimed at improving the efficiency of execution whi...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
CONCUR
2005
Springer
14 years 1 months ago
2005
Springer
We propose a formalisation of the notion of transaction, using a variant of CCS, RCCS, that distinguishes reversible and irreversible actions, and incorporates a distributed backtr...