27 search results - page 1 / 6 » A New Incomplete Method for CSP Inconsistency Checking |
AAAI
2008
13 years 7 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
FLAIRS
2004
13 years 6 months ago
2004
This paper presents a new method of interactive refinement of a knowledge base. The first step of our method is a validation stage which checks the consistency and the completenes...
IJCAI
2001
13 years 6 months ago
2001
We present a new approach to inferring a probability distribution which is incompletely specified by a number of linear constraints. We argue that the currently most popular appro...
SBMF
2010
Springer
12 years 11 months ago
2010
Springer
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...