ProbLog: A Probabilistic Prolog and its Application in Link Discovery
ProbLog: A Probabilistic Prolog and its Application in Link Discovery
复制标题
ProbLog：概率 Prolog 及其在链路发现中的应用
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Hannu (TT) Toivonen
中科院分区：
文献类型：
--
作者：
L. D. Raedt;Angelika Kimmig;Hannu (TT) Toivonen
提出了一个基于最小化的信念改变的一般框架。问题实例由无向图组成，其中公式与每个顶点相关联。举例来说，顶点可表示空间位置、时间点或某一其它局部性概念。信息通过图上的最小化过程在顶点之间共享。我们给这个最小化的语义和句法特征。我们还表明，这种方法是一般性的，足以捕捉现有的最小化为基础的方法，信念合并，信念修订，（时间）外推算子。虽然我们专注于集理论的最小化的概念，我们也考虑其他方法，如基数为基础的和优先级为基础的最小化。
A general framework for minimisation-based belief change is presented. A problem instance is made up of an undirected graph, where a formula is associated with each vertex. For example, vertices may represent spatial locations, points in time, or some other notion of locality. Information is shared between vertices via a process of minimisation over the graph. We give equivalent semantic and syntactic characterisations of this minimisation. We also show that this approach is general enough to capture existing minimisation-based approaches to belief merging, belief revision, and (temporal) extrapolation operators. While we focus on a set-theoretic notion of minimisation, we also consider other approaches, such as cardinality-based and priority-based minimisation.