1378 search results - page 9 / 276 » The Tractability of Global Constraints |
117
click to vote
AAAI
2012
13 years 2 months ago
2012
Novel tractable classes of the binary CSP (constraint satisfaction problem) have recently been discovered by studying classes of instances defined by excluding subproblems descri...
COGSCI
2008
14 years 11 months ago
2008
The recognition that human minds/brains are finite systems with limited resources for computation has led some researchers to advance the Tractable Cognition thesis: Human cogniti...
148
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
DLOG
2009
15 years 23 days ago
2009
Abstract. We present a family of expressive extensions of Datalog, called Datalog
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...