Relaxation of soft constraints via a unified semiring

Authors:
Peter Harvey;Aditya Ghose
Affiliations:
Decision Systems Laboratory, School of IT and Computer Science, University of Wollongong, NSW, Australia;Decision Systems Laboratory, School of IT and Computer Science, University of Wollongong, NSW, Australia
Venue:
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Year:
2006

Citing 5
Cited 0

Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
Encoding Partial Constraint Satisfaction in the Semiring-Based Framework for Soft Constraints

ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Semiring-based constraint logic programming

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Constraint solving over semirings

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The semiring framework for constraint satisfaction allows us to model a wide variety of problems of choice. Semiring constraint satisfaction problems are able to represent both classical consistency and optimisation problems, as well as soft constraint problems such as valued and weight CSPs. In this paper we pose and answer the question: how can we represent and ‘solve' the relaxation of a semiring constraint satisfaction problem?