The expressive power of valued constraints: Hierarchies and collapses

Authors:
David A. Cohen;Peter G. Jeavons;Stanislav ivný
Affiliations:
Department of Computer Science, Royal Holloway, University of London, UK;Computing Laboratory, University of Oxford, UK;Computing Laboratory, University of Oxford, UK
Venue:
Theoretical Computer Science
Year:
2008

Citing 20
Cited 2

Tree clustering for constraint networks (research note)

Artificial Intelligence
Tractable constraints on ordered domains

Artificial Intelligence
Closure properties of constraints

Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems

Theoretical Computer Science
Constraints, consistency and closure

Artificial Intelligence
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)
Universal Algebra and Applications in Theoretical Computer Science

Universal Algebra and Applications in Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
How to Determine the Expressive Power of Constraints

Constraints
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
Pseudo-boolean optimization

Discrete Applied Mathematics
Classifying the Complexity of Constraints Using Finite Algebras

SIAM Journal on Computing
Bases for boolean co-clones

Information Processing Letters
The complexity of soft constraint satisfaction

Artificial Intelligence
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Submodular function minimization

Mathematical Programming: Series A and B
A maximal tractable class of soft constraints

Journal of Artificial Intelligence Research
On the expressiveness of networks with hidden variables

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
An algebraic characterisation of complexity for valued constraint

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

A note on some collapse results of valued constraints

Information Processing Letters
An algebraic theory of complexity for valued constraints: establishing a Galois connection

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we investigate the ways in which a fixed collection of valued constraints can be combined to express other valued constraints. We show that in some cases, a large class of valued constraints, of all possible arities, can be expressed by using valued constraints over the same domain of a fixed finite arity. We also show that some simple classes of valued constraints, including the set of all monotonic valued constraints with finite cost values, cannot be expressed by a subset of any fixed finite arity, and hence form an infinite hierarchy.