Weighted First Order Model Counting (WFOMC) is the task of computing the weighted sum of the models of a first-order logic sentence. Probabilistic inference problems in many statistical relational learning frameworks can be cast as a WFOMC problem. However, in general, WFOMC is known to be intractable (#P_1- complete). Hence, logical fragments that admit polynomial time WFOMC are of significant interest. Such fragments are called domain liftable. Recent works have identified the two-variable fragment of first-order logic, extended with counting quantifiers, to be domain liftable. In this paper, we extend this fragment with a Directed Acyclic Graph axiom, i.e., a relation is interpreted as a Directed Acyclic Graph.
翻译：加权一等计算模型(WFOMC)的任务是计算一等逻辑句数模型的加权总和。许多统计关系学习框架中的概率推论问题可以作为WFOMC问题。然而,一般而言,WFOMC已知是棘手的(#P_1-完整),因此,允许多环时间WFOMC的逻辑碎片具有重大意义。这些碎片被称为可提升的域。最近的工作确定了一级逻辑的两可变碎片,通过计算量化符加以扩展,以可提升域。在本文中,我们用直向环形图轴扩展了这一碎片,也就是说,一种关系被解释为直接的环形图。
相关内容
微信扫码咨询专知VIP会员