A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
The OPL optimization programming language
The OPL optimization programming language
Programming Deep Concurrent Constraint Combinators
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
The Design of the Zinc Modelling Language
Constraints
The design of ESSENCE: a constraint language for specifying combinatorial problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
MiniZinc: towards a standard CP modelling language
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint integer programming: a new approach to integrate CP and MIP
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
The proper treatment of undefinedness in constraint languages
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Why cumulative decomposition is not as bad as it sounds
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Implementing logical connectives in constraint programming
Artificial Intelligence
Towards "propagation = logic + control"
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Views and iterators for generic constraint implementations
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
On the reification of global constraints
Constraints
Solving RCPSP/max by lazy clause generation
Journal of Scheduling
Hi-index | 0.00 |
Usually propagation-based constraint solvers construct a constraint network as a conjunction of constraints. They provide propagators for each form of constraint c. In order to increase expressiveness, systems also usually provide propagators for reified forms of constraints. A reified constraint b ↔ c associates a truth value b with a constraint c. With reified propagators, systems can express complex combinations of constraints using disjunction, implication and negation by flattening. In this paper we argue that reified constraints should be replaced by half-reified constraints of the form b → c. Half-reified constraints do not impose any extra burden on the implementers of propagators compared to unreified constraints, they can implement reified propagators without loss of propagation strength (assuming c is negatable), they extend automatically to global constraints, they simplify the handling of partial functions, and can allow flattening to give better propagation behavior.