Making Bound Consistency as Effective as Arc Consistency

We study under what conditions bound consistency (BC) and arc consistency (AC), two forms of propagation used in constraint solvers, are equivalent to each other. We show that they prune exactly the same values when the propagated constraint is connected row convex / closed under median and its complement is row convex. This characterization is exact for binary constraints. Since row convexity depends on the order of the values in the domains, we give polynomial algorithms for computing orders under which BC and AC are equivalent, if any.

[1]  Wray L. Buntine.  Generalized Subsumption and Its Applications to Induction and Redundancy , 1986, Artif. Intell..

[2]  Nicola Fanizzi,et al.  OI-implication: Soundness and Refutation Completeness , 2001, IJCAI.

[3]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[4]  Peter J. Stuckey,et al.  When do bounds and domain propagation lead to the same search space , 2001, PPDP '01.

[5]  Gordon Plotkin,et al.  A Further Note on Inductive Generalization , 2008 .

[6]  Martin C. Cooper,et al.  Constraints, Consistency and Closure , 1998, Artif. Intell..

[7]  Luc De Raedt,et al.  Multiple Predicate Learning , 1993, IJCAI.

[8]  David A. Cohen,et al.  Domain permutation reduction for constraint satisfaction problems , 2008, Artif. Intell..

[9]  Nicola Fanizzi,et al.  A Generalization Model Based on OI-implication for Ideal Theory Refinement , 2001, Fundam. Informaticae.

[10]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[11]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[12]  Ivan Bratko,et al.  Refining Complete Hypotheses in ILP , 1999, ILP.

[13]  Herman Midelfart.  A Bounded Search Space of Clausal Theories , 1999, ILP.

[14]  Gerhard J. Woeginger.  An efficient algorithm for a class of constraint satisfaction problems , 2002, Oper. Res. Lett..

[15]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[16]  Stephen Muggleton,et al.  Inverse entailment and progol , 1995, New Generation Computing.

[17]  Liviu Badea.  A Refinement Operator for Theories , 2001, ILP.

[18]  Toby Walsh,et al.  Filtering Algorithms for the NValue Constraint , 2006, Constraints.

[19]  J. Ross Quinlan,et al.  Learning logical definitions from relations , 1990, Machine Learning.

[20]  Christian Bessiere,et al.  Constraint Propagation , 2006, Handbook of Constraint Programming.

[21]  Georg Gottlob,et al.  Subsumption and Implication , 1987, Inf. Process. Lett..

[22]  Raymond Reiter,et al.  Equality and Domain Closure in First-Order Databases , 1980, JACM.

[23]  JOHANNES FÜRNKRANZ,et al.  Separate-and-Conquer Rule Learning , 1999, Artificial Intelligence Review.

[24]  Peter Jeavons,et al.  Building tractable disjunctive constraints , 2000, J. ACM.

[25]  Jean-François Puget,et al.  A Fast Algorithm for the Bound Consistency of alldiff Constraints , 1998, AAAI/IAAI.

[26]  Liviu Badea,et al.  Refinement Operators Can Be (Weakly) Perfect , 1999, ILP.

[27]  Gernot Salzer,et al.  Efficient Algorithms for Description Problems over Finite Totally Ordered Domains , 2008, SIAM J. Comput..

[28]  Peter J. Stuckey,et al.  When do bounds and domain propagation lead to the same search space? , 2005, ACM Trans. Program. Lang. Syst..

[29]  Nicola Fanizzi,et al.  Minimal Generalizations under OI-Implication , 2002, ISMIS.

[30]  Peter van Beek,et al.  On the minimality and global consistency of row-convex constraint networks , 1995, JACM.

[31]  Nicola Fanizzi,et al.  Multistrategy Theory Revision: Induction and Abduction in INTHELEX , 2004, Machine Learning.

[32]  Roland H. C. Yap,et al.  Arc Consistency on n-ary Monotonic and Linear Constraints , 2000, CP.

[33]  Henrik Boström,et al.  Combining Divide-and-Conquer and Separate-and-Conquer for Efficient and Effective Rule Induction , 1999, ILP.

[34]  Pascal Van Hentenryck,et al.  Constraint Satisfaction over Connected Row Convex Constraints , 1997, Artif. Intell..