Semiring-based CSPs and Valued CSPs: Frameworks, Properties, and Comparison (1999)
| Venue: | Constraints |
| Citations: | 92 - 25 self |
BibTeX
@ARTICLE{Bistarelli99semiring-basedcsps,
author = {S. Bistarelli and U. Montanari and F. Rossi and T. Schiex and G. Verfaillie and H. Fargier},
title = {Semiring-based CSPs and Valued CSPs: Frameworks, Properties, and Comparison},
journal = {Constraints},
year = {1999},
volume = {4}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we describe and compare two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. While comparing the two approaches, we show how to pass from one to the other one, and we discuss when this is possible. The two frameworks have been independently introduced in [2], [3] and [35].
