346 search results - page 31 / 70 » Solving quantified constraint satisfaction problems |
160
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
118
click to vote
JUCS
2006
15 years 4 months ago
2006
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
130
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
147
click to vote
PRICAI
2004
Springer
15 years 9 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
141
click to vote
CPAIOR
2004
Springer
15 years 7 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...