@article{
 title = {Semiring-based constraint logic programming: Syntax and semantics},
 type = {article},
 year = {2001},
 identifiers = {[object Object]},
 keywords = {D.3.1 [Programming languages]: Formal Definitions,D.3.2 [Programming languages]: Language Classifica,F.3.2 [Logics And Meanings Of Programs]: Semantics},
 volume = {23},
 id = {c083f0e0-8c26-31a8-bca3-6302c84c7ee7},
 created = {2017-04-06T22:52:20.009Z},
 file_attached = {false},
 profile_id = {903920d0-d2a6-30df-a1d5-ff042699cff4},
 last_modified = {2017-04-06T22:52:20.009Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 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.},
 bibtype = {article},
 author = {Bistarelli, S. and Montanari, U. and Rossi, F.},
 journal = {ACM Transactions on Programming Languages and Systems},
 number = {1}
}

{"_id":{"_str":"53f4b84d3d9d602c1a001480"},"__v":0,"authorIDs":["5457089d8b01c8193000012f"],"author_short":["Bistarelli, S.","Montanari, U.","Rossi, F."],"bibbaseid":"bistarelli-montanari-rossi-semiringbasedconstraintlogicprogrammingsyntaxandsemantics-2001","bibdata":{"title":"Semiring-based constraint logic programming: Syntax and semantics","type":"article","year":"2001","identifiers":"[object Object]","keywords":"D.3.1 [Programming languages]: Formal Definitions,D.3.2 [Programming languages]: Language Classifica,F.3.2 [Logics And Meanings Of Programs]: Semantics","volume":"23","id":"c083f0e0-8c26-31a8-bca3-6302c84c7ee7","created":"2017-04-06T22:52:20.009Z","file_attached":false,"profile_id":"903920d0-d2a6-30df-a1d5-ff042699cff4","last_modified":"2017-04-06T22:52:20.009Z","read":false,"starred":false,"authored":"true","confirmed":false,"hidden":false,"private_publication":false,"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.","bibtype":"article","author":"Bistarelli, S. and Montanari, U. and Rossi, F.","journal":"ACM Transactions on Programming Languages and Systems","number":"1","bibtex":"@article{\n title = {Semiring-based constraint logic programming: Syntax and semantics},\n type = {article},\n year = {2001},\n identifiers = {[object Object]},\n keywords = {D.3.1 [Programming languages]: Formal Definitions,D.3.2 [Programming languages]: Language Classifica,F.3.2 [Logics And Meanings Of Programs]: Semantics},\n volume = {23},\n id = {c083f0e0-8c26-31a8-bca3-6302c84c7ee7},\n created = {2017-04-06T22:52:20.009Z},\n file_attached = {false},\n profile_id = {903920d0-d2a6-30df-a1d5-ff042699cff4},\n last_modified = {2017-04-06T22:52:20.009Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n 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.},\n bibtype = {article},\n author = {Bistarelli, S. and Montanari, U. and Rossi, F.},\n journal = {ACM Transactions on Programming Languages and Systems},\n number = {1}\n}","author_short":["Bistarelli, S.","Montanari, U.","Rossi, F."],"bibbaseid":"bistarelli-montanari-rossi-semiringbasedconstraintlogicprogrammingsyntaxandsemantics-2001","role":"author","urls":{},"keyword":["D.3.1 [Programming languages]: Formal Definitions","D.3.2 [Programming languages]: Language Classifica","F.3.2 [Logics And Meanings Of Programs]: Semantics"],"downloads":1},"bibtype":"article","biburl":null,"creationDate":"2014-08-20T15:01:33.338Z","downloads":1,"keywords":["d.3.1 [programming languages]: formal definitions","d.3.2 [programming languages]: language classifica","f.3.2 [logics and meanings of programs]: semantics"],"search_terms":["semiring","based","constraint","logic","programming","syntax","semantics","bistarelli","montanari","rossi"],"title":"Semiring-based constraint logic programming: Syntax and semantics","year":2001}