Sciweavers

121 search results - page 4 / 25
» Bound Consistency for Binary Length-Lex Set Constraints
Sort
View
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 6 months ago
Reformulation of Global Constraints in Answer Set Programming
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
Christian Drescher, Toby Walsh
AUSAI
2004
Springer
14 years 23 days ago
Set Bounds and (Split) Set Domain Propagation Using ROBDDs
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
Peter Hawkins, Vitaly Lagoon, Peter J. Stuckey
KR
2010
Springer
14 years 4 days ago
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
Reinhard Pichler, Stefan Rümmele, Stefan Szei...
ICIP
2004
IEEE
14 years 9 months ago
Shape-adaptive coding using binary set splitting with k-d trees
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
James E. Fowler
CP
2001
Springer
13 years 12 months ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Jean-Charles Régin, Thierry Petit, Christia...