Properties of tree convex constraints

It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it may not make it globally consistent. In this paper, we investigate the properties of some tree convex constraints under intersection and composition. As a result, we identify a sub-class of tree convex networks that are locally chain convex and strictly union closed. This class of problems can be made globally consistent by arc and path consistency and thus is tractable. Interestingly, we also find that some scene labeling problem can be modeled by tree convex constraints in a natural and meaningful way. Key words: Constraint networks, tree convex constraints, row convex constraints, connected row convex constraints, scene labeling problem.

• Type: Journal
• Year: 2008
• Where: AI
• Authors: Yuanlin Zhang, Eugene C. Freuder
• Keywords: AI 2008, Artificial Intelligence, Convex Constraints, Tree Convex, Tree Convex Network