A hybrid tractable class for non-binary CSPs
From MaRDI portal
Publication:903910
DOI10.1007/s10601-015-9185-yzbMath1329.90149OpenAlexW2036690199MaRDI QIDQ903910
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux
Publication date: 15 January 2016
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-015-9185-y
Related Items (5)
A hybrid tractable class for non-binary CSPs ⋮ Hybrid Tractable Classes of Constraint Problems ⋮ The Broken-Triangle Property with Adjoint Values ⋮ On a new extension of BTP for binary CSPs ⋮ Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems
Cites Work
- Unnamed Item
- Unnamed Item
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
- A hybrid tractable class for non-binary CSPs
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- Characterising tractable constraints
- Domain filtering consistencies for non-binary constraints
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- Graph minors. II. Algorithmic aspects of tree-width
- A Sufficient Condition for Backtrack-Free Search
- On the minimality and global consistency of row-convex constraint networks
- Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Principles and Practice of Constraint Programming – CP 2003
- Tractable constraints on ordered domains
This page was built for publication: A hybrid tractable class for non-binary CSPs
