Sciweavers

114 search results - page 2 / 23
» Implementing Propagators for Tabular Constraints
Sort
View
CP
2009
Springer
14 years 5 months ago
Weakly Monotonic Propagators
Abstract. Today's models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. These models ...
Christian Schulte, Guido Tack
AUSAI
2006
Springer
13 years 9 months ago
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter ...
SAC
2002
ACM
13 years 4 months ago
Soft constraint propagation and solving in CHRs
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
Stefano Bistarelli, Thom W. Frühwirth, Michae...
CI
2004
85views more  CI 2004»
13 years 5 months ago
Soft Constraint Propagation and Solving in Constraint Handling Rules
Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and...
Stefano Bistarelli, Thom W. Frühwirth, Michae...
CPAIOR
2006
Springer
13 years 9 months ago
The Range Constraint: Algorithms and Implementation
Abstract. We recently proposed a simple declarative language for specifying a wide range of counting and occurrence constraints. The language uses just two global primitives: the R...
Christian Bessière, Emmanuel Hebrard, Brahi...