209 search results - page 10 / 42 » Decomposable Constraints |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
ISSTA
2004
ACM
15 years 3 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
CPAIOR
2004
Springer
15 years 1 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...
ICIDS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. AI planning has featured in a number of Interactive Storytelling prototypes: since narratives can be naturally modelled as a sequence of actions it has been possible to e...
AI
2006
Springer
14 years 9 months ago
2006
Springer
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...