An Implementation of Extended P-Log Using XASP

We propose a new approach for implementing P-log using XASP, the interface of XSB with Smodels. By using the tabling mechanism of XSB, our system is most of the times faster than P-log. In addition, our implementation has query features not supported by P-log, as well as new set operations for domain definition.

[1]  J. Nelson Rushton,et al.  Combining Logical and Probabilistic Reasoning , 2006, AAAI Spring Symposium: Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering.

[2]  Theresa Swift.  Tabling for non‐monotonic programming , 2004, Annals of Mathematics and Artificial Intelligence.

[3]  J. Nelson Rushton,et al.  Probabilistic reasoning with answer sets , 2004, Theory and Practice of Logic Programming.

[4]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.

[5]  Ilkka Niemelä,et al.  Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.