Affiliation:
1. Univ. of Pisa, Pisa, Italy
2. Univ. of Padova, Padua, Italy
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sequential composition of propositional logic programs;Annals of Mathematics and Artificial Intelligence;2024-02-15
2. Antisimple Γ – Semirings and conditions on a Γ – Semiring with strong identity;INTERNATIONAL CONFERENCE ON ADVANCES IN MULTI-DISCIPLINARY SCIENCES AND ENGINEERING RESEARCH: ICAMSER-2021;2022
3. Chapter 3. Logic Meets Learning: From Aristotle to Neural Networks;Frontiers in Artificial Intelligence and Applications;2021-12-22
4. ON SOME PROPERTIES OF A Γ-SEMIRING;JP Journal of Algebra, Number Theory and Applications;2021-11-10
5. Anti-unification and the theory of semirings;Theoretical Computer Science;2020-12