A new class of binary CSPs for which arc-consistency is a decision procedure

DOI10.1007/B13743zbMATH Open1273.68341OpenAlexW2497660909MaRDI QIDQ5897229FDOQ5897229

Authors: David A. Cohen 

Publication date: 2 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13743

Recommendations

• Arc consistency and friends
• Principles and Practice of Constraint Programming – CP 2004
• A generic arc-consistency algorithm and its specializations
• Arc consistency revisited
• scientific article; zbMATH DE number 67482

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (8)

• Title not available (Why is that?)
• A hybrid tractable class for non-binary CSPs
• Hybrid tractability of valued constraint problems
• Binary constraint satisfaction problems defined by excluded topological minors
• The power of propagation: when GAC is enough
• The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
• Domain permutation reduction for constraint satisfaction problems
• A new branch-and-filter exact algorithm for binary constraint satisfaction problems

This page was built for publication: A new class of binary CSPs for which arc-consistency is a decision procedure

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