Consistency and Set Intersection

Yuanlin Zhang and Roland H. C. Yap, National University of Singapore

The study of local and global consistency is an important topic in Constraint Networks. In this paper, we give some results on finite set intersections and relate k-consistency to set intersection. We present a proof schema which lifts the results on set intersection to results at a particular level of consistency (including global consistency). This gives a new framework to study consistency in terms of general properties of set intersection. Some well known results on row convex constraints, tightness and looseness can then be derived directly and proved using our proof schema.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.