Abstract
We show how to compile programs formalizing update plus preference reasoning into standard generalized logic programs and show the correctness of the transformation.
This work was partially supported by POCTI project 40958 “FLUX - FleXible Logical Updates”. The second author acknowledges a Research Grant by the Stiftelsen Lars Hiertas Minne.
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.
Similar content being viewed by others
References
J. J. Alferes, P. Dell’Acqua, and L. M. Pereira. A compilation of updates plus preferences. Technical report, LiTH-ITN-R-2002-7, Dept. of Science and Technology, Linköping University, Sweden, 2002. Available at: http://www.itn.liu.se/english/research/.
J. J. Alferes, J. A. Leite, L. M. Pereira, H. Przymusinska, and T. C. Przymusinski. Dynamic updates of non-monotonic knowledge bases. The J. of Logic Programming, 45(1–3):43–70, 2000.
J. J. Alferes and L. M. Pereira. Updates plus preferences. In M. O. Aciego, I. P. de Guzman, G. Brewka, and L. M. Pereira (eds.) Logics in AI, Procs. JELIA’00, LNAI 1919, pp. 345–360, Berlin, 2000. Springer.
J. J. Alferes and L. M. Pereira. Logic Programming Updating-a guided approach-Essays in honour of Robert Kowalski. In A. Kakas and F. Sadri (eds.) Computational Logic: From Logic Programming into the Future. Springer, 2002. To appear. Available at: http://centria.di.fct.unl.pt/~lmp/.
G. Brewka. Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research, 4, 1996.
G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109, 1999.
G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109:297–356, 1999.
B. Cui and T. Swift. Preference logic grammars: Fixed-point semantics and application to data standardization. Artificial Intelligence, 2002. To appear.
J. Delgrande, T. Schaub, and H. Tompits. A compilation of Brewka and Eiter’s approach to prioritization. In M. O. Aciego, I. P. de Guzman, G. Brewka, and L. M. Pereira (eds.), Logics in AI, Procs. JELIA’00, LNAI 1919, pp. 376–390, 2000.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. Bowen (eds.) Proceedings of the Fifth International Conference on Logic Programming, pp. 1070–1080, 1988. The MIT Press.
B. Grosof. Courteous logic programs: Prioritized conflict handling for rules. Research Report RC 20836, IBM, 1997.
K. Inoue and C. Sakama. Negation as failure in the head. Journal of Logic Programming, 35:39–78, 1998.
V. Lifschitz and T. Woo. Answer sets in general non-monotonic reasoning (preliminary report). In B. Nebel, C. Rich, and W. Swartout (eds.) KR’92. Morgan-Kaufmann, 1992.
H. Prakken. Logical Tools for Modelling Legal Argument: A Study of Defeasible Reasoning in Law, volume 32 of Law and Philosophy Library. Kluwer academic publishers, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alferes, J.J., Dell’Acqua, P., Pereira, L.M. (2002). A Compilation of Updates plus Preferences. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44190-8
Online ISBN: 978-3-540-45757-2
eBook Packages: Springer Book Archive