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
Heterogeneous Constraint Solving
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Principles of Constraint Programming
Principles of Constraint Programming
Solving set constraint satisfaction problems using ROBDDs
Journal of Artificial Intelligence Research
The range and roots constraints: specifying counting and occurrence problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
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
Generic Incremental Algorithms for Local Search
Constraints
Modelling for lazy clause generation
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Revisiting constraint-directed search
Information and Computation
Fast Set Bounds Propagation using BDDs
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Towards solver-independent propagators
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarative specification is automatically translated into an efficient propagator. This paper introduces the use of existential monadic second-order logic as declarative specification language for finite set propagators. The approach taken in the paper is to automatically derive projection propagators (involving a single variable only) implementing constraints described by formulas. By this, the paper transfers the ideas of indexicals to finite set constraints while considerably increasing the level of abstraction available with indexicals. The paper proves soundness and completeness of the derived propagators and presents a run-time analysis, including techniques for efficiently executing projectors for n-ary constraints.