Uncovering trees in constraint networks

DOI10.1016/0004-3702(95)00102-6zbMath1506.68153OpenAlexW2154946358MaRDI QIDQ2676569

Judea Pearl, Itay Meiri, Rina Dechter

Publication date: 27 September 2022

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

Full work available at URL: https://doi.org/10.1016/0004-3702(95)00102-6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposing a relation into a tree of binary relations
• Network-based heuristics for constraint-satisfaction problems
• Structure identification in relational data
• Fast parallel constraint satisfaction
• Characterising tractable constraints
• Networks of constraints: Fundamental properties and applications to picture processing
• On the minimality and global consistency of row-convex constraint networks