arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1707.06325cs.AIcs.LO
收藏

使用ASP和MLN求解器计算LPMLN

Computing LPMLN Using ASP and MLN Solvers

Arizona State University(亚利桑那州立大学)

Joohyung Lee, Samidh Talsania, Yi Wang

摘要:

LPMLN是概率逻辑程序设计语言的新成员。它的主要思想是通过以类似于马尔可夫逻辑定义的方式为每个规则分配权重来克服稳定模型语义的刚性。我们提出了两个实现的LPMLN,$\text{LPMLN2ASP}$和$\text{LPMLN2MLN}$。系统$\text{LPMLN2ASP}$将LPMLN程序转换为答案集求解器$\text{CLINGO}$的输入语言,并利用弱约束和稳定模型枚举,计算最可能的稳定模型以及精确的条件概率和边际概率。系统$\text{LPMLN2MLN}$将LPMLN程序翻译成马尔可夫逻辑解算器的输入语言,诸如$\text{ALCHEMY}$、$\text{TUFFY}$和$\text{ROCKIT}$,并且允许对LPMLN程序执行近似概率推断。我们还证明了有用的LPMLN系统计算其他语言,如ProbLog和珍珠的因果模型,被证明是可翻译成LPMLN。(正在考虑接受TPLP)

英文摘要:

LPMLN is a recent addition to probabilistic logic programming languages. Its main idea is to overcome the rigid nature of the stable model semantics by assigning a weight to each rule in a way similar to Markov Logic is defined. We present two implementations of LPMLN, $\text{LPMLN2ASP}$ and $\text{LPMLN2MLN}$. System $\text{LPMLN2ASP}$ translates LPMLN programs into the input language of answer set solver $\text{CLINGO}$, and using weak constraints and stable model enumeration, it can compute most probable stable models as well as exact conditional and marginal probabilities. System $\text{LPMLN2MLN}$ translates LPMLN programs into the input language of Markov Logic solvers, such as $\text{ALCHEMY}$, $\text{TUFFY}$, and $\text{ROCKIT}$, and allows for performing approximate probabilistic inference on LPMLN programs. We also demonstrate the usefulness of the LPMLN systems for computing other languages, such as ProbLog and Pearl's Causal Models, that are shown to be translatable into LPMLN. (Under consideration for acceptance in TPLP)

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑