Solving connected row convex constraints by variable elimination

DOI10.1016/J.ARTINT.2009.05.004zbMath1194.68212OpenAlexW2126916883MaRDI QIDQ840826

Satyanarayana Marisetti, Yuan Lin Zhang

Publication date: 14 September 2009

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

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

zbMATH Keywords

constraint satisfaction problemsvariable eliminationconnected row convex constraintsconstraint compositionpath consistency

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Consistency in networks of relations
• Constraint satisfaction over connected row-convex constraints
• Networks of constraints: Fundamental properties and applications to picture processing
• Bucket elimination: A unifying framework for reasoning
• On the minimality and global consistency of row-convex constraint networks

This page was built for publication: Solving connected row convex constraints by variable elimination