Arc consistency for factorable relations.

DOI10.1016/0004-3702(92)90077-BzbMATH Open1193.68140OpenAlexW2002847164MaRDI QIDQ989172FDOQ989172

Authors: 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

Recommendations

• Arc consistency revisited
• A generic arc-consistency algorithm and its specializations
• A distributed arc-consistency algorithm
• An optimal k-consistency algorithm
• scientific article; zbMATH DE number 67482

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Consistency in networks of relations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Using constraint metaknowledge to reduce arc consistency computation
• A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
• AC-*: A Configurable, Generic and Adaptive Arc Consistency Algorithm
• The complexity of constraint satisfaction revisited
• Title not available (Why is that?)
• An optimal coarse-grained arc consistency algorithm
• On the arc consistency problem
• Fast parallel constraint satisfaction
• Fast parallel constraint satisfaction
• Backjump-based backtracking for constraint satisfaction problems

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

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