The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
From MaRDI portal
(Redirected from Publication:4635926)
Recommendations
- scientific article; zbMATH DE number 6825406
- A new class of binary CSPs for which arc-consistency is a decision procedure
- The tractability of CSP classes defined by forbidden patterns
- Bounds arc consistency for weighted CSPs
- Methods and Applications of Artificial Intelligence
- scientific article; zbMATH DE number 67482
- A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
- On singleton arc consistency for CSPs defined by monotone patterns
- On singleton arc consistency for CSPs defined by monotone patterns
Cited in
(10)- The power of propagation: when GAC is enough
- On singleton arc consistency for CSPs defined by monotone patterns
- Galois connections for patterns: an algebra of labelled graphs
- On a new extension of BTP for binary CSPs
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
- The tractability of CSP classes defined by forbidden patterns
- On singleton arc consistency for CSPs defined by monotone patterns
- scientific article; zbMATH DE number 6825406 (Why is no real title available?)
- Hybrid tractable classes of constraint problems
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs
This page was built for publication: The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635926)