Skip to main content
SpringerLink
Log in

Preference-Based Argumentation Handling Dynamic Preferences Built on Prioritized Logic Programming

  • Conference paper
Agents in Principle, Agents in Practice (PRIMA 2011)

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

Abstract

To treat dynamic preferences correctly is crucially required in the fields of argumentation as well as nonmonotonic reasoning. To meet such requirements, first, we propose a hierarchical Prioritized Logic Program (or a hierarchical PLP, for short), which enhances the formalism of Sakama and Inoue’s PLP so that it can represent and reason about dynamic preferences. Second, using such a hierarchical PLP as the underlying language, the proposed method defines the preference-based argumentation framework (called the dynamic PAF) built from it. This enables us to argue and reason about dynamic preferences in argumentation. Finally we show the interesting relationship between semantics of a hierarchical PLP given by preferred answer sets and semantics of the dynamic PAF given by \({\cal P}\)-extensions.

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. Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. Annals of Mathematics and Artificial Intelligence 34(1-3), 197–215 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Amgoud, L., Vesic, S.: Repairing preference-based argumentation frameworks. In: Proceedings of IJCAI 2009, pp. 665–670 (2009)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  4. Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artificial Intelligence 109, 297–356 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred answer sets by meta-interpretation in answer set programming. Theory and Practice of Logic Programming 3(4-5), 463–498 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Caminada, M., Amgoud, L.: On the evaluation of argumentation formalisms. Artificial Intelligence 171(5-6), 286–310 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. 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  MathSciNet  MATH  Google Scholar 

  8. Delgrande, J.P., Schaub, T., Tompits, H., Wang, K.: A Classification and survey of preference handling approaches in nonmonotonic reasoning. Computational Intelligence 20(2), 308–334 (2004)

    Article  MathSciNet  Google Scholar 

  9. Dung, P.M.: An argumentation semantics for logic programming with explicit negation. In: Proceedings of the Tenth International Conference on Logic programming (ICLP 1993), pp. 616–630. MIT press (1993)

    Google Scholar 

  10. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and n-person games. Artificial Intelligence 77, 321–357 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the Fifth International Conference and Symposium on Logic Programming (ICLP/SLP-1988), pp. 1070–1080. MIT Press (1988)

    Google Scholar 

  12. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)

    Article  MATH  Google Scholar 

  13. Gordon, T.F.: The pleadings game: An Artificial Intelligence Model of Procedural Justice, Ph.D. thesis, TU Darmstadt (1993)

    Google Scholar 

  14. Modgil, S.: Reasoning about preferences in argumentation frameworks. Artificial Intelligence 173, 901–934 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Modgil, S., Prakken, H.: Reasoning about preferences in Structured Extended Argumentation Frameworks. In: Proceedings of COMMA 2010, pp. 347–358. IOS (2010)

    Google Scholar 

  16. Prakken, H., Sartor, G.: Argument-based extended logic programming with defeasible priorities. Journal of Applied Non-Classical Logics 7(1), 25–75 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  17. Schweimeier, R., Schroeder, M.: A Parameterized hierarchy of argumentation semantics for extended logic programming and its application to the well-founded semantics. Theory and Practice of Logic Programming 5(1,2), 207–242 (2005)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  19. Wakaki, T.: Preference-Based Argumentation Capturing Prioritized Logic Programming. In: McBurney, P. (ed.) ArgMAS 2010. LNCS (LNAI), vol. 6614, pp. 306–325. Springer, Heidelberg (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shibaura Institute of Technology, 307 Fukasaku, Minuma-ku, Saitama-city, Saitama, 337–8570, Japan

    Toshiko Wakaki

Authors
  1. Toshiko Wakaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Social Informatics, Engineering, Kyoto University, Building 10, 6006-8501, Kyoto, Japan

    David Kinny

  2. Department of Computer Science and Information Engineering, National Taiwan University, 1 Roosevelt Road, 106, Taipei, Taiwan

    Jane Yung-jen Hsu

  3. Queensland Research Lab, NICTA, Australia

    Guido Governatori

  4. Decision Systems Lab School of Computer Science and Software Engineering, University of Wollongong, 2522, NSW, Australia

    Aditya K. Ghose

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wakaki, T. (2011). Preference-Based Argumentation Handling Dynamic Preferences Built on Prioritized Logic Programming. In: Kinny, D., Hsu, J.Yj., Governatori, G., Ghose, A.K. (eds) Agents in Principle, Agents in Practice. PRIMA 2011. Lecture Notes in Computer Science(), vol 7047. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25044-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25044-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25043-9

  • Online ISBN: 978-3-642-25044-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation