2974 search results - page 179 / 595 » Model-Driven Constraint Programming |
170
click to vote
AICCSA
2006
IEEE
16 years 15 days ago
2006
IEEE
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
175
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
175
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Although algorithms for Distributed Constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significa...
161
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
141
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...