arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.04527cs.AI
收藏

答案集程序的概率扩展中的权学习

Weight Learning in a Probabilistic Extension of Answer Set Programs

School of Computing, Informatics and Decision Systems Engineering(计算、信息与决策系统工程学院);Arizona State University(亚利桑那州立大学)

Joohyung Lee, Yi Wang

摘要:

LPMLN是答案集程序的概率扩展,其权重方案源自马尔可夫逻辑。以前的工作已经表明如何在LPMLN推理可以实现。本文提出了LPMLN中权学习的概念,并从Markov逻辑的权学习算法中导出了LPMLN的学习算法。我们还提出了一个原型实现,使用答案集求解器的学习,以及一些示例域,说明不同的LPMLN学习功能。在LPMLN学习是根据稳定的模型语义,从而学习参数的概率扩展知识丰富的领域,答案集编程已被证明是有用的,但限于确定性的情况下,如可达性分析和推理的行动在动态域。我们还应用该方法来学习参数的概率溯因推理的行动。

英文摘要:

LPMLN is a probabilistic extension of answer set programs with the weight scheme derived from that of Markov Logic. Previous work has shown how inference in LPMLN can be achieved. In this paper, we present the concept of weight learning in LPMLN and learning algorithms for LPMLN derived from those for Markov Logic. We also present a prototype implementation that uses answer set solvers for learning as well as some example domains that illustrate distinct features of LPMLN learning. Learning in LPMLN is in accordance with the stable model semantics, thereby it learns parameters for probabilistic extensions of knowledge-rich domains where answer set programming has shown to be useful but limited to the deterministic case, such as reachability analysis and reasoning about actions in dynamic domains. We also apply the method to learn the parameters for probabilistic abductive reasoning about actions.

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

↑