Nareyek, A., and Geske, U. 1996. |
Efficient Representation of Relations over Linear Constraints.
In Proceedings of the Workshop on Constraint Programming Applications at the Second International Conference on Principles and Practice of Constraint Programming (CP96), 55-63.
Dealing with relations over constraints is a difficult matter, because of the possible inherent disjunction. For constraints over finite domains and constraint solver mechanisms, where a direct propagation of the disjunction is impossible, a conjunctive reformulation of the disjunctions has to be found. This contribution describes an easily computable method to transform the constraints with their relations into an efficient conjunctive constraint system.
A much more detailed version is available in German as a technical report.
|Download||Rules and Regulations [PostScript; 277 Kb] [compressed PostScript; 96 Kb] [download viewer]|
This article is referenced by the following pages of the AI Center: