In this paper, we investigate the extent to which knowledge compilation can be used to improve inference from propositional weighted bases. We present a general notion of compilation of a weighted base that is parametrized by any equivalence--preserving compilation function. Both negative and positive results are presented. On the one hand, complexity results are identified, showing that the inference problem from a compiled weighted base is as difficult as in the general case, when the prime implicates, Horn cover or renamable Horn cover classes are targeted. On the other hand, we show that the inference problem becomes tractable whenever DNNF-compilations are used and clausal queries are considered. Moreover, we show that the set of all preferred models of a DNNF-compilation of a weighted base can be computed in time polynomial in the output size. Finally, we sketch how our results can be used in model-based diagnosis in order to compute the most probable diagnoses of a system.
Monte Carlo Anti-Differentiation for Approximate Weighted Model Integration
KU Leuven(鲁汶大学)
混合域中的概率推理,即离散-连续域上的推理,需要解决两个众所周知的#P-hard问题:1)离散变量上的加权模型计数(WMC)和2)连续变量上的积分。对于这两个问题的推理技术已分别开发,以管理其#P-硬度,如知识汇编WMC和蒙特卡洛(MC)方法(近似)集成在连续域。加权模型集成(WMC)的混合域的扩展,已被提出作为一种形式主义来研究离散和连续变量的概率推理。最近开发的非线性规划求解器集中于利用非线性规划问题中的结构,对于这些非线性规划问题,它们依赖于符号积分来找到被积函数的本原,即执行反微分。为了将这些进展与最先进的Monte Carlo积分技术相结合,我们引入了\textit{Monte Carlo anti-differentiation}(MCAD),它计算反导数的MC近似。在我们的经验评估中,我们用MCAD后端代替现有的双稳态解算器中的精确符号积分后端。我们的实验表明,装备现有的MCAD求解器产生一个快速而可靠的近似推理方案。
Solving Combinatorial Counting Problems with Weighted First-Order Model Counting
School of Artificial Intelligence, Jilin University, Changchun, China;State Key Laboratory of Complex \& Critical Software Environment, Beihang University, China;National Research Center for Educational Materials, China;Tengen Intelligence Institute, China;Czech Technical University in Prague, Prague, Czech Republic