Semiring-based Constraint Logic Programming: Syntax and semantics
Stefano Bistarelli, Rossi F., Ugo Montanari · CINECA IRIS Institutial research information system (University of Pisa) · 2001
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiring-based constraints. This allows us to perform in the same language both constraint solving and optimization. In fact, constraints based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability, fuzziness, and optimization. We then provide this class of languages with three equivalent semantics: model-theoretic, fix-point, and proof-theoretic, in the style of classical CLP programs.