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

  • Authors:
  • S. Bistarelli;U. Montanari;F. Rossi;T. Schiex;G. Verfaillie;H. Fargier

  • Affiliations:
  • University of Pisa, Dipartimento di Informatica, Corso Italia 40, 56125 Pisa, Italy;University of Pisa, Dipartimento di Informatica, Corso Italia 40, 56125 Pisa, Italy;University of Pisa, Dipartimento di Informatica, Corso Italia 40, 56125 Pisa, Italy;INRA, Chemin de Borde Rouge, BP 27, 31326 Castanet-Tolosan Cedex, France;CERT /ONERA, 2 Av. E. Belin, BP 4025, 31055 Toulouse Cedex, France;IRIT, 118 route de Narbonne, 31062, Toulouse Cedex, France

  • Venue:
  • Constraints
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Inthis paper we describe and compare two frameworks for constraintsolving where classical CSPs, fuzzy CSPs, weighted CSPs, partialconstraint satisfaction, and others can be easily cast. One isbased on a semiring, and the other one on a totally ordered commutativemonoid. While comparing the two approaches, we show how to passfrom one to the other one, and we discuss when this is possible.The two frameworks have been independently introduced in ijcai95,jacmand schiex-ijcai95.