当前位置: X-MOL 学术arXiv.cs.LO › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Semiring Programming: A Declarative Framework for Generalized Sum Product Problems
arXiv - CS - Logic in Computer Science Pub Date : 2016-09-21 , DOI: arxiv-1609.06954
Vaishak Belle, Luc De Raedt

To solve hard problems, AI relies on a variety of disciplines such as logic, probabilistic reasoning, machine learning and mathematical programming. Although it is widely accepted that solving real-world problems requires an integration amongst these, contemporary representation methodologies offer little support for this. In an attempt to alleviate this situation, we introduce a new declarative programming framework that provides abstractions of well-known problems such as SAT, Bayesian inference, generative models, and convex optimization. The semantics of programs is defined in terms of first-order structures with semiring labels, which allows us to freely combine and integrate problems from different AI disciplines.

中文翻译:

半环规划:广义和积问题的声明性框架

为了解决难题,人工智能依赖于各种学科,如逻辑、概率推理、机器学习和数学编程。尽管人们普遍认为解决现实世界的问题需要在这些问题之间进行整合,但当代表示方法对此几乎没有提供支持。为了缓解这种情况,我们引入了一种新的声明式编程框架,该框架提供了众所周知的问题的抽象,例如 SAT、贝叶斯推理、生成模型和凸优化。程序的语义是根据带有半环标签的一阶结构定义的,这使我们可以自由地组合和集成来自不同 AI 学科的问题。
更新日期:2020-01-14
down
wechat
bug