ML Anthology

Semiring-Based Constraint Logic Programming

Stefano Bistarelli, Ugo Montanari, Francesca Rossi
IJCAI 1997 pp. 352-357
doi:10.1145/383721.383725 /ijcai/1997/bistarelli1997ijcai-semiring/

Abstract

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.

PDF Semantic Scholar

Cite

Text

Bistarelli et al. "Semiring-Based Constraint Logic Programming." International Joint Conference on Artificial Intelligence, 1997. doi:10.1145/383721.383725

Markdown

[Bistarelli et al. "Semiring-Based Constraint Logic Programming." International Joint Conference on Artificial Intelligence, 1997.](https://mlanthology.org/ijcai/1997/bistarelli1997ijcai-semiring/) doi:10.1145/383721.383725

BibTeX

@inproceedings{bistarelli1997ijcai-semiring,
  title     = {{Semiring-Based Constraint Logic Programming}},
  author    = {Bistarelli, Stefano and Montanari, Ugo and Rossi, Francesca},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1997},
  pages     = {352-357},
  doi       = {10.1145/383721.383725},
  url       = {https://mlanthology.org/ijcai/1997/bistarelli1997ijcai-semiring/}
}