An Algebraic Prolog for Reasoning about Possible Worlds
An Algebraic Prolog for Reasoning about Possible Worlds
复制标题
推理可能世界的代数序言
DOI：
10.1609/aaai.v25i1.7852
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
L. D. Raedt
中科院分区：
文献类型：
--
作者：
Angelika Kimmig;Guy Van den Broeck;L. D. Raedt
我们介绍了aproblog，这是概率逻辑编程语言problog的概括。 aproblog程序由一组确定的子句和一组代数事实组成；每个事实都标有半度性的元素。从概率值到实数（代表成本或公用事业），多项式，布尔函数或数据结构，可以进行多种标签。然后，该半度用于计算可能的世界和查询的标签。我们正式定义了aproblog的语义，并研究了aproblog推理问题，该问题与计算查询的标签有关。引入了两个条件，可以简化推理问题，从而产生四种不同的算法和设置。这四个设置中每一个的代表性基本问题是：查询是正确的（SAT），有多少此类可能的世界（#SAT）的可能世界（#sat），查询的可能性是什么（prob）？查询是真实的最有可能的世界（MPE）。我们进一步说明了这些设置，其中许多任务需要更复杂的半程。
We introduce aProbLog, a generalization of the probabilistic logic programming language ProbLog. An aProbLog program consists of a set of definite clauses and a set of algebraic facts; each such fact is labeled with an element of a semiring. A wide variety of labels is possible, ranging from probability values to reals (representing costs or utilities), polynomials, Boolean functions or data structures. The semiring is then used to calculate labels of possible worlds and of queries. We formally define the semantics of aProbLog and study the aProbLog inference problem, which is concerned with computing the label of a query. Two conditions are introduced that allow one to simplify the inference problem, resulting in four different algorithms and settings. Representative basic problems for each of these four settings are: is there a possible world where a query is true (SAT), how many such possible worlds are there (#SAT), what is the probability of a query being true (PROB), and what is the most likely world where the query is true (MPE). We further illustrate these settings with a number of tasks requiring more complex semirings.