Propagation Completeness of Reactive Constraints
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
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
Heterogeneous Constraint Solving
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Efficient constraint propagation engines
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Finite domain bounds consistency revisited
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Type Parametric Compilation of Algebraic Constraints
EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
An automated approach to generating efficient constraint solvers
Proceedings of the 34th International Conference on Software Engineering
| Hi-index | 0.00 |
When implementing a propagator for a constraint, one must decide about variants: When implementing min , should one also implement max ? Should one implement linear equations both with and without coefficients? Constraint variants are ubiquitous: implementing them requires considerable effort, but yields better performance.This paper shows how to use variable views to derive perfectpropagator variants: derived propagators inherit essential properties such as correctness and domain and bounds completeness.