Semiring-based Constraint Logic Programming
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction. Pages 352-356.
Abstract
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiringbased constraint systems. This allows us to perform in the same language both constraint solving and optimization. In fact, constraint systems based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability, fuzzyness, and optimization. We then provide this class of languages with three equivalent semantics: model-theoretic, fixpoint, and proof-theoretic, in the style of CLP programs.
@inproceedings{ijcai1997p52,
title = {Semiring-based Constraint Logic Programming},
author = {Bistarelli, Stefano and Montanari, Ugo and Rossi, Francesca},
booktitle = {Proceedings of the Fifteenth International Joint Conference on
Artificial Intelligence, {IJCAI-97}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Martha E. Pollack},
pages = {352--356},
year = {1997},
note = {Constraint Satisfaction},
url = {https://ijcai.org/proceedings/1997/52},
}
TY - CPAPER TI - Semiring-based Constraint Logic Programming AU - Bistarelli, Stefano AU - Montanari, Ugo AU - Rossi, Francesca T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 352 EP - 356 UR - https://ijcai.org/proceedings/1997/52 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
