Arc and path consistence revisited
Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Comments on Mohr and Henderson's path consistency algorithm
Artificial Intelligence
An optimal k-consistency algorithm
Artificial Intelligence
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Chaotic iteration for distributed constraint propagation
Proceedings of the 1999 ACM symposium on Applied computing
Using “weaker” functions for constraint propagation over real numbers
Proceedings of the 1999 ACM symposium on Applied computing
The essence of constraint propagation
Theoretical Computer Science
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
A coordination-based chaotic iteration algorithm for constraint propagation
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Constraints solving as the coordination of inference engines
Coordination of Internet agents
The Rough Guide to Constraint Propagation
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Heterogeneous Constraint Solving
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Data Types in Subdefinite Models
AISMC-3 Proceedings of the International Conference AISMC-3 on Artificial Intelligence and Symbolic Mathematical Computation
Composition Operators for Constraint Propagation: An Application to Choco
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Schedulers for rule-based constraint programming
Proceedings of the 2003 ACM symposium on Applied computing
Basic components for constraint solver cooperations
Proceedings of the 2003 ACM symposium on Applied computing
An interval constraint system for lattice domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Schedulers and redundancy for a class of constraint propagation rules
Theory and Practice of Logic Programming
A class of polynomially solvable range constraints for interval analysis without widenings
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques
ACM Transactions on Mathematical Software (TOMS)
Incremental computation of succinct abstractions for hybrid systems
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Explaining constraint programming
Processes, Terms and Cycles
| Hi-index | 0.00 |
Constraing propagation algorithms form an important part of most of the constraint programming systems. We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In this framework we proceed in two steps. First, we introduce a generic iteration algorithm on partial orderings and prove its correctness in an abstract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the notions commutativity and semi-commutativity, we show that the AC-3, PC-2, DAC, and DPC algorithms for achieving (directional) arc consistency and (directional) path consistency are instances of a single generic algorithm. The work reported here extends and simplifies that of Apt [1999a].