Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Arc Consistency for Soft Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison
Over-Constrained Systems
Relaxations of semiring constraint satisfaction problems
Information Processing Letters
Semiring-Based Soft Constraints
Concurrency, Graphs and Models
A relaxation of a semiring constraint satisfaction problem using combined semirings
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
| Hi-index | 0.00 |
The Semiring CSP (SCSP) framework is a popular and robust approach to solving partial constraint satisfaction problems which generalizes several other schemes such as fuzzy CSP, weighted CSP etc. We argue in this paper that it is useful to augment the SCSP framework such that each constraint specifies, in addition, a metric on the semiring values. The additional knowledge of distances between 'preference values' (the elements of the semiring) permits us to define a notion of parameterized solving of SCSPs where we can seek solutions with a preference value no worse than a given value.