Handling Preferences in LPMLN: A Preliminary Report

In this paper, we present a new knowledge representation and reasoning tool to handle uncertainty, inconsistencies, and preferences by combining the ideas of LPMLN and logic programming with ordered disjunction (LPOD). The former is an extension of Answer Set Programming (ASP) that is designed for handling uncertainty and inconsistencies in knowledge representation by incorporating the method in Markov Logic Networks (MLN). The latter is a logic formalism to represent preferences in ASP, which is a simple yet effective way to handle preferences. Firstly, we present a new knowledge representation language o-LPMLN that extends LPMLN by introducing ordered disjunctions. Then, we present an example to show the use of the language. Finally, we present an approach to computing o-LPMLN programs by translating them into regular LPMLN programs. Results obtained in this paper provide an alternative tool to handle inconsistencies, uncertainty, and preferences in a unified framework. Moreover, a by-product of the paper is that we present an approach to implementing LPOD via using LPMLN solvers.

[1]  Torsten Schaub,et al.  asprin: Customizing Answer Set Preferences without a Headache , 2015, AAAI.

[2]  Joohyung Lee,et al.  Translating LPOD and CR-Prolog2 into Standard Answer Set Programs , 2018, Theory Pract. Log. Program..

[3]  Matthew Richardson,et al.  Markov logic networks , 2006, Machine Learning.

[4]  Ilkka Niemelä,et al.  Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs , 2002, JELIA.

[5]  Gerhard Brewka,et al.  Logic programming with ordered disjunction , 2002, NMR.

[6]  Joohyung Lee,et al.  LPMLN, Weak Constraints, and P-log , 2017, AAAI.

[7]  Joohyung Lee,et al.  Weighted Rules under the Stable Model Semantics , 2016, KR.

[8]  Gerhard Brewka Preferences in Answer Set Programming , 2005, CAEPIA.

[9]  Gerhard Brewka,et al.  Answer Sets: From Constraint Programming Towards Qualitative Optimization , 2004, LPNMR.

[10]  Igor Stéphan,et al.  Possibilistic uncertainty handling for answer set programming , 2006, Annals of Mathematics and Artificial Intelligence.

[11]  Martin Gebser,et al.  Complex optimization in answer set programming , 2011, Theory and Practice of Logic Programming.

[12]  Joohyung Lee,et al.  Computing LPMLN using ASP and MLN solvers , 2017, Theory Pract. Log. Program..

[13]  Henri Prade,et al.  Using possibilistic logic for modeling qualitative decision: Answer Set Programming algorithms , 2014, Int. J. Approx. Reason..

[14]  Bin Wang,et al.  Splitting an LPMLN Program , 2018, AAAI.

[15]  Bin Wang,et al.  A Parallel LPMLN Solver: Primary Report , 2017, ASPOCP@LPNMR.

[16]  Michael Gelfond,et al.  On the Relationship between P-log and LPMLN , 2016, IJCAI.

[17]  Juan Carlos Nieves,et al.  Dealing with explicit preferences and uncertainty in answer set programming , 2012, Annals of Mathematics and Artificial Intelligence.