Solving connected row convex constraints by variable elimination

DOI10.1016/J.ARTINT.2009.05.004MaRDI QIDQ840826zbMATH OpenOpenAlexFDO

Authors Yuanlin Zhang, Satyanarayana Marisetti

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

connected row convex constraintsconstraint compositionconstraint satisfaction problemspath consistencyvariable elimination

Mathematics Subject Classification ID

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

Recommendations

• Constraint satisfaction over connected row-convex constraints
• scientific article; zbMATH DE number 2080314
• Variable Elimination in Binary CSPs
• Automated Reasoning
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems

Cites work

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

Cited in

(2)

• Constraint satisfaction over connected row-convex constraints
• scientific article; zbMATH DE number 2080314 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840826)