711 search results - page 94 / 143 » Amalgams of Constraint Satisfaction Problems |
138
click to vote
SMA
2006
ACM
15 years 10 months ago
2006
ACM
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
127
click to vote
AAAI
2007
15 years 6 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
121
click to vote
AIPS
2000
15 years 5 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
122
click to vote
SGAI
2007
Springer
15 years 10 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
123
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...