Arc and path consistence revisited
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Entailment of finite domain constraints
Proceedings of the eleventh 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
Indexical-Based Solver Learning
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Enforcing strict model-view separation in template engines
Proceedings of the 13th international conference on World Wide Web
Programming finite-domain constraint propagators in Action Rules
Theory and Practice of Logic Programming
The Definitive ANTLR Reference: Building Domain-Specific Languages
The Definitive ANTLR Reference: Building Domain-Specific Languages
Removing propagation redundant constraints in redundant modeling
ACM Transactions on Computational Logic (TOCL)
Propagation via lazy clause generation
Constraints
Watched literals for constraint propagation in minion
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Generating propagators for finite set constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Inferring variable conflicts for local search
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
We present an extension to indexicals to describe propagators for global constraints. The resulting language is compiled into actual propagators for different solvers, and is solver-independent. In addition, we show how this high-level description eases the proof of propagator properties, such as correctness and monotonicity. Experimental results show that propagators compiled from their indexical descriptions are sometimes not significantly slower than built-in propagators of Gecode. Therefore, our language can be used for the rapid prototyping of new global constraints.