Local consistency in parallel constraint satisfaction networks

DOI10.1016/0004-3702(94)90085-XMaRDI QIDQ1337684zbMATH OpenFDO

Authors Simon Kasif, Arthur L. Delcher

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)

Recommendations

• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Publication:3493326
• On parallel partial solutions and approximation schemes for local consistency in networks of constraints
• Partiality and approximation schemes for local consistency in networks of constraints
• Fast parallel constraint satisfaction

Cites work

• scientific article; zbMATH DE number 4162321 (Why is no real title available?)
• scientific article; zbMATH DE number 4166938 (Why is no real title available?)
• scientific article; zbMATH DE number 3965458 (Why is no real title available?)
• scientific article; zbMATH DE number 4064466 (Why is no real title available?)
• scientific article; zbMATH DE number 4106294 (Why is no real title available?)
• scientific article; zbMATH DE number 67865 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• A Sufficient Condition for Backtrack-Free Search
• A simple parallel tree contraction algorithm
• Consistency in networks of relations
• Formula dissection: A parallel algorithm for constraint satisfaction
• Network-based heuristics for constraint-satisfaction problems
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• Parallel consistent labeling algorithms
• Scene Labeling by Relaxation Operations
• The Consistent Labeling Problem: Part I

Cited in

(8)

• scientific article; zbMATH DE number 4162274 (Why is no real title available?)
• Computing LOGCFL certificates
• Partiality and approximation schemes for local consistency in networks of constraints
• A review of literature on parallel constraint solving
• scientific article; zbMATH DE number 4166938 (Why is no real title available?)
• Deducing local rules for solving global tasks with random Boolean networks
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• On parallel partial solutions and approximation schemes for local consistency in networks of constraints

This page was built for publication: Local consistency in parallel constraint satisfaction networks

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