36 search results - page 4 / 8 » Using Inferred Disjunctive Constraints To Decompose Constrai... |
105
click to vote
AAAI
2007
15 years 1 months ago
2007
Solving logic puzzles has become a very popular past-time, particularly since the Sudoku puzzle started appearing in newspapers all over the world. We have developed a puzzle gene...
97
Voted
JAIR
2010
14 years 10 months ago
2010
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
111
click to vote
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
TPLP
2008
14 years 11 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
CPAIOR
2004
Springer
15 years 3 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...