1179 search results - page 120 / 236 » Programming in Hybrid Constraint Languages |
110
click to vote
APSEC
2005
IEEE
15 years 7 months ago
2005
IEEE
Several kinds of call-ordering problems have been identified, all of which present subtle difficulties in ensuring the correctness of a sequential program. They include object pro...
CP
2005
Springer
15 years 7 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
120
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
100
click to vote
CP
2007
Springer
15 years 7 months ago
2007
Springer
We introduce a definition of constraint symmetry for soft CSPs, based on the definition of constraint symmetry for classical CSPs. We show that the constraint symmetry group of a...
CP
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keepi...