Skip to main content

Preferences for Argumentation Semantics

  • Conference paper
Human-Inspired Computing and Its Applications (MICAI 2014)

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

Included in the following conference series:

  • 1728 Accesses

Abstract

We propose an engineering approach for assembling argumentation theory with a preference approach, which allows us to give as input an argumentation problem with preferences and return the stable argumentation extensions that fulfill the preferences.

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

Access this chapter

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. Bench-Capon, T.J.M., Dunne, P.E.: Argumentation in artificial intelligence. Artificial Intelligence 171(10-15), 619–641 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brewka, G.: Logic Programming with Ordered Disjunction. In: Proceedings AAAI-2002(2002)

    Google Scholar 

  3. Carballido, J.L., Nieves, J.C., Osorio, M.: Inferring Preferred Extensions by Pstable Semantics. Revista Iberomericana de Inteligencia Artificial 13(41), 38–53 (2009)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Kowalski, R., Bowen, K. (eds.) 5th Conference on Logic Programming, pp. 1070–1080. MIT Press (1988)

    Google Scholar 

  6. Nevar, C.I.C., Maguitman, A.G., Loui, R.P.: Logical models of argument. ACM Comput. Surv. 32(4), 337–383 (2000)

    Article  Google Scholar 

  7. Nieves, J.C., Osorio, M., Cortés, U.: Preferred extensions as stable models. Theory and Practice of Logic Programming (TPLP) 8(4), 527–543 (2008)

    MATH  Google Scholar 

  8. Nieves, J.C., Osorio, M., Zepeda, C.: A schema for generating relevant logic programming semantics and its applications in argumentation theory. Fundamenta Informaticae 106(2-4), 295–319 (2011)

    MATH  MathSciNet  Google Scholar 

  9. van Dalen, D.: Logic and structure, 3rd Augmented edn. Springer, Berlin (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Osorio, M., Zepeda, C., Carballido, J.L. (2014). Preferences for Argumentation Semantics. In: Gelbukh, A., Espinoza, F.C., Galicia-Haro, S.N. (eds) Human-Inspired Computing and Its Applications. MICAI 2014. Lecture Notes in Computer Science(), vol 8856. Springer, Cham. https://doi.org/10.1007/978-3-319-13647-9_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13647-9_37

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13646-2

  • Online ISBN: 978-3-319-13647-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics