154 search results - page 15 / 31 » Consistency for Quantified Constraint Satisfaction Problems |
TIME
2002
IEEE
14 years 13 days ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
CPAIOR
2004
Springer
13 years 11 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
FLAIRS
2004
13 years 9 months ago
2004
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...
AAAI
1997
13 years 9 months ago
1997
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...