Arc consistency for factorable relations.

DOI10.1016/0004-3702(92)90077-BzbMath1193.68140OpenAlexW2002847164MaRDI QIDQ989172

Mark Perlin

Publication date: 27 August 2010

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

Full work available at URL: https://doi.org/10.1016/0004-3702(92)90077-b

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (7)

Fast parallel constraint satisfaction ⋮ The complexity of constraint satisfaction revisited ⋮ An optimal coarse-grained arc consistency algorithm ⋮ A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems ⋮ Using constraint metaknowledge to reduce arc consistency computation ⋮ Fast parallel constraint satisfaction ⋮ Backjump-based backtracking for constraint satisfaction problems

Cites Work

• Consistency in networks of relations
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Arc consistency for factorable relations.