Abstract
This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logic program, preference information is expressed at the object level by atoms of the form s ≺ t, where s and t are names of rules. An ordered logic program is transformed into a second, regular, extended logic program wherein the preferences are respected, in that the answer sets obtained in the transformed theory correspond with the preferred answer sets of the original theory. Currently, plp treats three different types of preference strategies, viz. those proposed by (i) Brewka and Eiter, (ii) Delgrande, Schaub, and Tompits, and (iii) Wang, Zhou, and Lin. Since the result of the translation is an extended logic program, existing logic programming systems can be used as underlying reasoning engine. In particular, plp is conceived as a front-end to the logic programming systems dlv and smodels.
Affiliated with the School of Computing Science at Simon Fraser University, Burnaby, Canada.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109(1-2):297–356, 1999. 411, 412
J. Delgrande and T. Schaub. Compiling reasoning with and about preferences into default logic. In Proc. IJCAI-97, pages 168–174. Morgan Kaufmann Publishers, 1997. 412
J. Delgrande, T. Schaub, and H. Tompits. A compilation of Brewka and Eiter’s approach to prioritization. In Proc. JELIA-00, pages 376–390. Springer Verlag, 2000.
J. Delgrande, T. Schaub, and H. Tompits. Logic programs with compiled preferences. In Proc. ECAI-00, pages 392–398. IOS Press, 2000. 412, 413
T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A deductive system for nonmonotonic reasoning. In Proc. LPNMR-97, pages 363–374. Springer Verlag, 1997. 412
M. Gelfond and V. Lifschitz. Classical negation in logic programs and deductive databases. New Generation Computing, 9:365–385, 1991. 411
M. Gelfond and T. Son. Reasoning with prioritized defaults. In Third International Workshop on Logic Programming and Knowledge Representation, pages 164–223. Springer Verlag, 1997. 411
I. Niemelä and P. Simons. Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. In Proc. LPNMR-97, pages 420–429. Springer Verlag, 1997. 412
T. Schaub and K. Wang. A comparative study of logic programs with preference: Preliminary report. In Proc. AAAI Spring Symposium on Answer Set Programming, pages 151–157. AAAI Press, 2001.
K. Wang, L. Zhou, and F. Lin. Alternating fixpoint theory for logic programs with priority. In Proc. First International Conference on Computational Logic, pages 164–178. Springer Verlag, 2000. 411, 412
Y. Zhang and N. Foo. Answer sets for prioritized logic programs. In Proc. ILPS-97, pages 69–84. MIT Press, 1997. 411
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delgrande, J.P., Schaub, T., Tompits, H. (2001). plp: A Generic Compiler for Ordered Logic Programs. In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_33
Download citation
DOI: https://doi.org/10.1007/3-540-45402-0_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42593-9
Online ISBN: 978-3-540-45402-1
eBook Packages: Springer Book Archive