Implementing prioritized logic programming
Conflict resolution is an important issue in knowledge representation and reasoning. A common idea of solving conflicts in reasoning is to introduce priorities in the underlying reasoning mechanism. This paper describes an implementation of prioritized logic programs (PLPs) proposed by Zhang and Foo recently . PLPs is a non-trivial extension of Gelfond and Lifschitz’s extended logic programs  by associating preferences to the program, where answer sets provide a semantics of PLPs. As a central part of the implementation of PLPs, we present major algorithms of computing answer sets of PLPs. We show how answer sets of a PLP can be computed efficiently based on previous Niemelä and Simons’ method of computing stable models of logic programs .
Unable to display preview. Download preview PDF.
- 2.I. Niemelä and P. Simons, Efficient implementation of the well-founded and stable model semantics. International Joint Conference and Symposium on Logic programming (IJCSLP ’96), pp 289–303, 1996.Google Scholar
- 4.Y. Zhang and N.Y. Foo, Answer sets for prioritized logic programs. In Procceedings of the 1997 International Logic Programming Symposium (ILPS’97), pp69–83. MIT Press, 1997.Google Scholar