Local consistency in parallel constraint satisfaction networks

DOI10.1016/0004-3702(94)90085-XzbMath0821.68115MaRDI QIDQ1337684

Arthur L. Delcher, Simon Kasif

Publication date: 19 September 1995

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

zbMATH Keywords

parallel complexityconstraint networks

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items

A review of literature on parallel constraint solving ⋮ Computing LOGCFL certificates

Cites Work

• Formula dissection: A parallel algorithm for constraint satisfaction
• Network-based heuristics for constraint-satisfaction problems
• Parallel consistent labeling algorithms
• Consistency in networks of relations
• The Consistent Labeling Problem: Part I
• A Sufficient Condition for Backtrack-Free Search
• Scene Labeling by Relaxation Operations
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• A simple parallel tree contraction algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item