Splitting an LPMLN Program

Authors

  • Bin Wang Southeast University
  • Zhizheng Zhang Southeast University
  • Hongxiang Xu Southeast University
  • Jun Shen Southeast University

Keywords:

logic programs

Abstract

The technique called splitting sets has been proven useful in simplifying the investigation of Answer Set Programming (ASP). In this paper, we investigate the splitting set theorem for LPMLN that is a new extension of ASP created by combining the ideas of ASP and Markov Logic Networks (MLN). Firstly, we extend the notion of splitting sets to LPMLN programs and present the splitting set theorem for LPMLN. Then, the use of the theorem for simplifying several LPMLN inference tasks is illustrated. After that, we give two parallel approaches for solving LPMLN programs via using the theorem. The preliminary experimental results show that these approaches are alternative ways to promote an LPMLN solver.

Downloads

Published

2018-04-25

How to Cite

Wang, B., Zhang, Z., Xu, H., & Shen, J. (2018). Splitting an LPMLN Program. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/11570

Issue

Section

AAAI Technical Track: Knowledge Representation and Reasoning