The Expressive Power of Valued Constraints: Hierarchies and Collapses
From MaRDI portal
Publication:3523088
DOI10.1007/978-3-540-74970-7_57zbMath1146.68455OpenAlexW2174425772MaRDI QIDQ3523088
Stanislav Živný, Peter G. Jeavons, David A. Cohen
Publication date: 2 September 2008
Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:d0ad4ee4-b42e-4144-a8e3-c6de99a7d677
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- Constraints, consistency and closure
- On the algebraic structure of combinatorial problems
- Minimizing symmetric submodular functions
- How to determine the expressive power of constraints
- Submodular functions and electrical networks
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- The complexity of soft constraint satisfaction
- Submodular functions and optimization.
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- The Expressive Power of Valued Constraints: Hierarchies and Collapses
- An Algebraic Characterisation of Complexity for Valued Constraint
- A Faster Scaling Algorithm for Minimizing Submodular Functions
- Principles and Practice of Constraint Programming – CP 2003
This page was built for publication: The Expressive Power of Valued Constraints: Hierarchies and Collapses
