Abstract
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 [4]. PLPs is a non-trivial extension of Gelfond and Lifschitz’s extended logic programs [3] 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 [2].
The first author is supported in part by a Logic Programming Research Scholarship from the University of Western Sydney, Nepean.
Preview
Unable to display preview. Download preview PDF.
References
G. Brewka, Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research 4 (1996) 19–36.
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.
M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–386, 1991.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, CM., Zhang, Y. (1999). Implementing prioritized logic programming. In: Raś, Z.W., Skowron, A. (eds) Foundations of Intelligent Systems. ISMIS 1999. Lecture Notes in Computer Science, vol 1609. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095093
Download citation
DOI: https://doi.org/10.1007/BFb0095093
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65965-5
Online ISBN: 978-3-540-48828-6
eBook Packages: Springer Book Archive