...
首页> 外文期刊>Theory and Practice of Logic Programming >MAP Inference for Probabilistic Logic Programming
【24h】

MAP Inference for Probabilistic Logic Programming

机译:概率逻辑编程的地图推断

获取原文
获取原文并翻译 | 示例
           

摘要

In Probabilistic Logic Programming (PLP) the most commonly studied inference task is to compute the marginal probability of a query given a program. In this paper, we consider two other important tasks in the PLP setting: the Maximum-A-Posteriori (MAP) inference task, which determines the most likely values for a subset of the random variables given evidence on other variables, and the Most Probable Explanation (MPE) task, the instance of MAP where the query variables are the complement of the evidence variables. We present a novel algorithm, included in the PITA reasoner, which tackles these tasks by representing each problem as a Binary Decision Diagram and applying a dynamic programming procedure on it. We compare our algorithm with the version of ProbLog that admits annotated disjunctions and can perform MAP and MPE inference. Experiments on several synthetic datasets show that PITA outperforms ProbLog in many cases.
机译:在概率逻辑编程(PLP)中,最常见的推理任务是根据程序计算查询的边际概率。在本文中,我们考虑了PLP设置中的另外两个重要任务:最大-A-Bouthiori(MAP)推断任务,它确定随机变量子集的最可能值给出了其他变量的证据,以及最可能的说明(MPE)任务,查询变量的地图实例是证据变量的补充。我们介绍了一种小说算法,包括在皮塔饼推理中,通过将每个问题作为二进制决策图并应用动态编程过程来解决这些任务。我们将算法与录取的算法进行比较,该算法承认注释剖钉,可以执行地图和MPE推断。在若干合成数据集上的实验表明,在许多情况下,皮塔饼突出了职能。

著录项

  • 来源
    《Theory and Practice of Logic Programming》 |2020年第5期|641-655|共15页
  • 作者单位

    Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy;

    Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 I-44122 Ferrara Italy;

    Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 I-44122 Ferrara Italy;

    Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号