Affiliation:
1. Univ. of Amsterdam, Amsterdam, The Netherlands
Abstract
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].
Publisher
Association for Computing Machinery (ACM)
Reference32 articles.
1. A. Aggoun et al. 1995. ECL i PS e 3.5 User Manual. Munich Germany.]] A. Aggoun et al. 1995. ECL i PS e 3.5 User Manual. Munich Germany.]]
2. The essence of constraint propagation
3. Heterogeneous constraint solving
4. Applying interval arithmetic to real, integer and Boolean constraints;Benhamou F.;Journal of Logic Programming,1997
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献