Symmetric Weighted First-Order Model Counting
Symmetric Weighted First-Order Model Counting
复制标题
对称加权一阶模型计数
DOI：
10.1145/2745754.2745760
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Dan Suciu
中科院分区：
文献类型：
--
作者：
P. Beame;Guy Van den Broeck;Eric Gribkoff;Dan Suciu
FO模型计数问题（FOMC）是以下内容：在FO中给定一个句子和数字n，计算大小n域上的φ模型数量；在本文中，每个元组和定义模型的重量是其元组的产物。重要的应用，具有软限制的知识基础，例如Markov逻辑网络，但问题也具有独立的理论利益。 FOMC的FO3公式是＃P1 complete，并且存在WFOMC为＃p1 complete的连接查询。 γ-酰基查询具有多项式时间数据的复杂性。
The FO Model Counting problem (FOMC) is the following: given a sentence Φ in FO and a number n, compute the number of models of Φ over a domain of size n; the Weighted variant (WFOMC) generalizes the problem by associating a weight to each tuple and defining the weight of a model to be the product of weights of its tuples. In this paper we study the complexity of the symmetric WFOMC, where all tuples of a given relation have the same weight. Our motivation comes from an important application, inference in Knowledge Bases with soft constraints, like Markov Logic Networks, but the problem is also of independent theoretical interest. We study both the data complexity, and the combined complexity of FOMC and WFOMC. For the data complexity we prove the existence of an FO3 formula for which FOMC is #P1-complete, and the existence of a Conjunctive Query for which WFOMC is #P1-complete. We also prove that all γ-acyclic queries have polynomial time data complexity. For the combined complexity, we prove that, for every fragment FOk, k ≥ 2, the combined complexity of FOMC (or WFOMC) is #P-complete.
影响因子：
14.4
作者：
Hoffart, Johannes;Suchanek, Fabian M.;Weikum, Gerhard
通讯作者：
Weikum, Gerhard