Abstract
We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a “best” answer set.Within the context of inconsistent programs, it is natural to have a partial order on rules, representing a preference for satisfying certain rules, possibly at the cost of violating less important ones.We showthat such a rule order induces a natural order on extended answer sets, the minimal elements of which we call preferred answer sets. We characterize the expressiveness of the resulting semantics and show that it can simulate negation as failure as well as disjunction.We illustrate an application of the approach by considering database repairs, where minimal repairs are shown to correspond to preferred answer sets.
Supported by the FWO
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
Marcelo Arenas, Leopoldo Bertossi, and Jan Chomicki. Specifying and querying database repairs using logic programs with exceptions. In Proceedings of the 4th International Conference on Flexible Query Answering Systems, pages 27–41, Warsaw, Octobre 2000. Springer-Verlag.
Thomas Eiter, Georg Gottlob, and Nicola Leone. Abduction from logic programs: Semantics and complexity. Theoretical Computer Science, 189(1–2):129–177, 1997.
T. Eiter and G. Gottlob. Complexity results for disjunctive logic programming and application to nonmonotnic logics. In Proceedings of the 1983 International Logic Programming Symposium, pages 266–279, Vancouver, October 1993. MIT Press.
Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming, Proceedings of the Fifth International Conference and Symposium, pages 1070–1080, Seattle, Washington, August 1988. The MIT Press.
Robert A. Kowalski and Fariba Sadri. Logic programs with exceptions. In David H. D. Warren and Peter Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 598–613, Jerusalem, 1990. The MIT Press.
Els Laenens and Dirk Vermeir. Assumption-free semantics for ordered logic programs: On the relationship between well-founded and stable partial models. Journal of Logic and Computation, 2(2):133–172, 1992.
Vladimir Lifschitz. Answer set programming and plan generation. Journal of Artificial Intelligence, to appear.
Raymond Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57–95, 1987.
Chiaki Sakama and Katsumi Inoue. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning, 13(1):145–172, 1994.
M.H. van Emden and R. Kowalski. The semantics of predicate logic as a programming language. Journal of the Association for Computing Machinery, 23(4):733–742, 1976.
M. De Vos and D. Vermeir. Semantic forcing in disjunctive logic programs. Computational Intelligence, 17(4):651–684, 2001.
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
Van Nieuwenborgh, D., Vermeir, D. (2002). Preferred Answer Sets for Ordered Logic Programs. 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_36
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_36
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