4117 search results - page 141 / 824 » On the Satisfiability of Complex Constraints |
172
click to vote
SIGSOFT
2006
ACM
16 years 7 months ago
2006
ACM
Models are increasingly recognized as an effective means for elaborating requirements and exploring designs. For complex systems, model building is far from an easy task. Efforts ...
166
click to vote
AAAI
2006
15 years 7 months ago
2006
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
183
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
152
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
193
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...