Arc consistency and friends

DOI10.1093/logcom/exr039zbMath1282.68134OpenAlexW1972179987MaRDI QIDQ4914413

Hubie Chen, Victor Dalmau, Berit Grußien

Publication date: 19 April 2013

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exr039

zbMATH Keywords

constraint satisfactionpolymorphismsarc consistencyconstraint languagespolynomial-time tractability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (8)

Tractability in constraint satisfaction problems: a survey ⋮ CLAP: A New Algorithm for Promise CSPs ⋮ On Singleton Arc Consistency for CSPs Defined by Monotone Patterns ⋮ On tree-preserving constraints ⋮ On singleton arc consistency for CSPs defined by monotone patterns ⋮ Decomposing Quantified Conjunctive (or Disjunctive) Formulas ⋮ A polynomial relational class of binary CSP ⋮ Solving CSPs Using Weak Local Consistency

This page was built for publication: Arc consistency and friends