Bound Consistency on Linear Constraints in Finite Domain Constraint Programming
Yuanlin Zhang, Hui Wu · 1998
This paper discusses the complexity of bound consistency on n-ary linear constraint system and investigates the relationship between equivalent binary equation systems from the perspective of bound consistency techniques. We propose an efficient bound consistency enforcing algorithm whose complexity is .In addition, by transforming a binary equation system into solved form, an efficient consistency enforcing algorithm can be achieved.