140 search results - page 14 / 28 » Rewriting Numeric Constraint Satisfaction Problems for Consi... |
ECAI
1992
Springer
13 years 11 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
DEXAW
2005
IEEE
14 years 1 months ago
2005
IEEE
For several reasons a database may not satisfy certain integrity constraints (ICs). However, most likely most of the information in it is still consistent with the ICs; and could ...
CP
2000
Springer
13 years 12 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
CP
2003
Springer
14 years 23 days ago
2003
Springer
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...
SCP
1998
13 years 7 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...