Skip to main content
SpringerLink
Log in

Computing Preferred Answer Sets in Answer Set Programming

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2850))

Abstract.

Prioritized logic programs (PLPs) have a mechanism of representing priority knowledge in logic programs. The declarative semantics of a PLP is given as preferred answer sets which are used for representing nonmonotonic reasoning as well as preference abduction. From the computational viewpoint, however, its implementation issues have little been studied and no sound procedure is known for computing preferred answer sets of PLPs. In this paper, we present a sound and complete procedure to compute all preferred answer sets of a PLP in answer set programming. The procedure is based on a program transformation from a PLP to a logic program and is realized on top of any procedure for answer set programming. The proposed technique also extends PLPs to handle dynamic preference and we address its application to legal reasoning.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brewka, G., Niemelä, I., Syrjänen, T.: Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 445–455. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Brewka, G., Eiter, T.: Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence 109, 297–356 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brewka, G.: Well-founded Semantics for Extended Logic Programs with Dynamic Preferences. Journal of Artificial Intelligence Research 4, 19–36 (1996)

    MATH  MathSciNet  Google Scholar 

  4. Delgrande, J.P., Schaub, T.: Expressing Preferences in Default Logic. Artificial Intelligence 123, 41–87 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Delgrande, J.P., Schaub, T., Tompits, H.: A Framework for Compiling Preferences in Logic Programs. Theory and Practice of Logic Programming 3(2), 129–187 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 364–375. Springer, Heidelberg (1997)

    Google Scholar 

  7. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)

    Article  Google Scholar 

  8. Gelfond, M., Lifschitz, V.: Compiling Circumscriptive Theories into Logic Programs. In: Proc. AAA1 1988, pp. 455-459 (1988); Extended version in Reinfrank, M., Ginsberg, M.L., de Kleer, J., Sandewall, E. (eds.): Non-Monotonic Reasoning 1988. LNCS, vol. 346, pp. 74–99. Springer, Heidelberg (1988)

    Google Scholar 

  9. Gorden, T.F.: The Pleadings Game: An Artifical Intelligence Model of Procedural Justice. Ph.D. thesis, TU Darmstadt (1993)

    Google Scholar 

  10. Inoue, K., Koshimura, M., Hasegawa, R.: Embedding negation as failure into a model generation theorem prover. In: Kapur, D. (ed.) CADE 1992. LNCS (LNAI), vol. 607, pp. 400–415. Springer, Heidelberg (1992)

    Google Scholar 

  11. Inoue, K., Sakama, C.: On Positive Occurrences of Negation as Failure. In: Proc. KR 1994, pp. 293–304 (1994)

    Google Scholar 

  12. Inoue, K., Sakama, C.: Abducing Priorities to Derive Intended Conclusions. In: Proc. Sixteenth International Joint Conference on Artificial Intelligence, pp. 44–49 (1999)

    Google Scholar 

  13. Lifschitz, V.: Computing Circumscription. In: Proc. IJCAI 1985, pp. 121–127 (1985)

    Google Scholar 

  14. McCarthy, J.: Applications of Circumscription to Formalizing Commonsense Knowledge. Artificial Intelligence 28, 89–116 (1986)

    Article  MathSciNet  Google Scholar 

  15. Niemelä, I., Simons, P.: Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. In: Proc. the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 420–429. Springer, Heidelberg (1997)

    Google Scholar 

  16. Poole, D.: A Logical framework for default reasoning. Artificial Intelligence 36, 27–47 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sakama, C., Inoue, K.: Representing Priorities in Logic Programs. In: Proc. Joint International Conference and Symposium on Logic Programming, pp. 82–96 (1996)

    Google Scholar 

  18. Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence 123, 185–222 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Information Systems, Shibaura Institute of Technology, 307 Fukasaku, Minuma-ku, Saitama-City, 337-8570, Saitama, Japan

    Toshiko Wakaki

  2. Department of Electrical and Electronics Engineering, Kobe University, Rokkodai, Nada, 657-8501, Kobe, Japan

    Katsumi Inoue

  3. Center for Information Science, Wakayama University, 930 Sakaedani, 640-8510, Wakayama, Japan

    Chiaki Sakama

  4. Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology, 4259 Nagatsuta, Midori-ku, 226-8502, Yokohama, Japan

    Katsumi Nitta

Authors
  1. Toshiko Wakaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Katsumi Inoue
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chiaki Sakama
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Katsumi Nitta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Rice University, 77251-1892, Houston, TX, U.S.A.

    Moshe Y. Vardi

  2. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wakaki, T., Inoue, K., Sakama, C., Nitta, K. (2003). Computing Preferred Answer Sets in Answer Set Programming. In: Vardi, M.Y., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2003. Lecture Notes in Computer Science(), vol 2850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39813-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39813-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20101-4

  • Online ISBN: 978-3-540-39813-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation