Skip to main content

Non-Monotonic Inference Properties for Assumption-Based Argumentation

  • Conference paper
  • First Online:
Theory and Applications of Formal Argumentation (TAFA 2015)

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

Abstract

Cumulative Transitivity and Cautious Monotonicity are widely considered as important properties of non-monotonic inference and equally as regards to information change. We propose three novel formulations of each of these properties for Assumption-Based Argumentation (ABA)—an established structured argumentation formalism, and investigate these properties under a variety of ABA semantics.

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 EPUB and 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

Notes

  1. 1.

    The modification of the rules in \(\mathcal {F}'\) is required to preserve flatness. We also slightly abuse the notation by using \(\overline{}\) for both contrary mappings: the implicit presumption is that the original contrary mapping \(\overline{}\) is extended with the assignment \(\overline{\psi } = y\), where y is new to \(\mathcal {L}\).

  2. 2.

    Again, for brevity reasons, the same symbol \(\overline{}\) is used for both contrary mappings: in \(\mathcal {F}'\), the original contrary mapping \(\overline{}\) is implicitly restricted to a diminished set of assumptions.

  3. 3.

    Deduction(s) \(\varPhi \vdash ^{R} \varphi \) with \(\psi \in \varPhi \) are replaced with the deduction(s) \(\varPhi \setminus \{ \psi \} \vdash ^{R' \cup \{ \psi \leftarrow \top \}} \varphi \) such that \(R' \subseteq R\) is the set of rules from R that do not contain \(\psi \) in their bodies.

References

  1. Amgoud, L., Vesic, S.: Rich preference-based argumentation frameworks. Int. J. Approximate Reasoning 55(2), 585–606 (2014)

    Article  MathSciNet  Google Scholar 

  2. Antoniou, G.: Nonmonotonic Reasoning. MIT Press, Cambridge (1997)

    MATH  Google Scholar 

  3. Baroni, P., Boella, G., Cerutti, F., Giacomin, M., van der Torre, L., Villata, S.: On the input/output behavior of argumentation frameworks. Artif. Intell. 217, 144–197 (2014)

    Article  MATH  Google Scholar 

  4. Bench-Capon, T.: Persuasion in practical argument using value based argumentation frameworks. J. Logic Comput. 13(3), 429–448 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Besnard, P., García, A., Hunter, A., Modgil, S., Prakken, H., Simari, G., Toni, F.: Introduction to structured argumentation. Argum. Comput. 5(1), 1–4 (2014)

    Article  Google Scholar 

  6. Bochman, A.: A foundational theory of belief and belief change. Artif. Intell. 108(1–2), 309–352 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bondarenko, A., Dung, P.M., Kowalski, R., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. Artif. Intell. 93(97), 63–101 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Booth, R., Kaci, S., Rienstra, T., van der Torre, L.: A logical theory about dynamics in abstract argumentation. In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds.) SUM 2013. LNCS, vol. 8078, pp. 148–161. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  9. Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artif. Intell. 109(1–2), 297–356 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Brewka, G., Eiter, T.: Prioritizing default logic. In: Intellectics and Computational Logic, pp. 27–45 (2000)

    Google Scholar 

  11. Brewka, G., Niemelä, I., Truszczynski, M.: Nonmonotonic reasoning. In: van Harmelen, F., Lifschitz, V., Bruce, P. (eds.) Handbook of Knowledge Representation, pp. 239–284. Elsevier (2007)

    Google Scholar 

  12. Caminada, M., Amgoud, L.: On the evaluation of argumentation formalisms. Artif. Intell. 171(5–6), 286–310 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Cayrol, C., De Saint-Cyr, F., Lagasquie-Schiex, M.: Change in abstract argumentation frameworks: adding an argument. J. Artif. Intell. Res. 38(1), 49–84 (2010)

    MATH  Google Scholar 

  14. Coste-Marquis, S., Konieczny, S., Mailly, J.G., Marquis, P.: On the revision of argumentation systems: minimal change of arguments status. In: KR (2014)

    Google Scholar 

  15. Dix, J.: A classification theory of semantics of normal logic programs: I. strong properties. Fundamenta Informaticae 22(3), 227–255 (1995)

    MATH  MathSciNet  Google Scholar 

  16. Dung, P.M.: On the acceptability of arguments and its fundamental role in non-monotonic reasoning, logic programming and n-person games. Artif. Intell. 77, 321–357 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Dung, P.M.: An axiomatic analysis of structured argumentation for prioritized default reasoning. In: ECAI, pp. 267–272 (2014)

    Google Scholar 

  18. Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artif. Intell. 171(10–15), 642–674 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  19. Dung, P.M., Mancarella, P., Toni, F.: Some design guidelines for practical argumentation systems. In: COMMA, pp. 183–194 (2010)

    Google Scholar 

  20. Falappa, M., García, A., Kern-Isberner, G., Simari, G.: On the evolving relation between belief revision and argumentation. Knowl. Eng. Rev. 26(01), 35–43 (2011)

    Article  Google Scholar 

  21. García, A., Simari, G.: Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers. Argum. Computat. 5(1), 63–88 (2014)

    Article  Google Scholar 

  22. Gorogiannis, N., Hunter, A.: Instantiating abstract argumentation with classical logic arguments: postulates and properties. Artif. Intell. 175(9–10), 1479–1497 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  23. Hunter, A.: Base logics in argumentation. In: COMMA, pp. 275–286 (2010)

    Google Scholar 

  24. Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(1–2), 167–207 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  25. Makinson, D.: General theory of cumulative inference. In: Reinfrank, M., de Kleer, J., Ginsberg, M.L., Sandewall, E. (eds.) Non-Monotonic Reasoning. Lecture Notes in Computer Science, vol. 346, pp. 1–18. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  26. Modgil, S., Prakken, H.: The ASPIC+ framework for structured argumentation: a tutorial. Argum. Comput. 5(1), 31–62 (2014)

    Article  Google Scholar 

  27. Prakken, H.: An abstract framework for argumentation with structured arguments. Argum. Comput. 1(2), 93–124 (2010)

    Article  Google Scholar 

  28. Rahwan, I., Simari, G.: Argumentation in Artificial Intelligence. Springer, Heidelberg (2009)

    Google Scholar 

  29. Rott, H.: Change, Choice and Inference: A Study of Belief Revision and Non-monotonic Reasoning. Oxford University Press, Oxford (2001)

    Google Scholar 

  30. Toni, F.: A tutorial on assumption-based argumentation. Argum. Comput. 5(1), 89–117 (2014)

    Article  MathSciNet  Google Scholar 

  31. Wakaki, T.: Assumption-based argumentation equipped with preferences. In: Dam, H.K., Pitt, J., Xu, Y., Governatori, G., Ito, T. (eds.) PRIMA 2014. LNCS, vol. 8861, pp. 116–132. Springer, Heidelberg (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kristijonas Čyras .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Čyras, K., Toni, F. (2015). Non-Monotonic Inference Properties for Assumption-Based Argumentation. In: Black, E., Modgil, S., Oren, N. (eds) Theory and Applications of Formal Argumentation. TAFA 2015. Lecture Notes in Computer Science(), vol 9524. Springer, Cham. https://doi.org/10.1007/978-3-319-28460-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28460-6_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28459-0

  • Online ISBN: 978-3-319-28460-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics