Properties of tree convex constraints

DOI10.1016/j.artint.2008.05.001zbMath1183.90441OpenAlexW2159501382MaRDI QIDQ2389670

Yuan Lin Zhang, Eugene C. Freuder

Publication date: 17 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2008.05.001

zbMATH Keywords

constraint networksglobal consistencylocal consistencyconnected row convex constraintslocally chain convex and strictly union closed constraintsscene labeling problemtree convex constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property, On tree-preserving constraints

Cites Work

• Unnamed Item
• The complexity of recognizing polyhedral scenes
• Consistency in networks of relations
• Constraints, consistency and closure
• Constraint satisfaction over connected row-convex constraints
• Networks of constraints: Fundamental properties and applications to picture processing
• An optimal coarse-grained arc consistency algorithm
• Synthesizing constraint expressions
• On the minimality and global consistency of row-convex constraint networks
• Closure properties of constraints
• Principles and Practice of Constraint Programming – CP 2003