Skip to main content

Modal and Temporal Argumentation Networks

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6200))

Abstract

The traditional Dung networks depict arguments as atomic and studies the relationships of attack between them. This can be generalised in two ways. One is to consider, for example, various forms of attack, support and feedback. Another is to add content to nodes and put there not just atomic arguments but more structure, for example, proofs in some logic or simply just formulas from a richer language. This paper offers to use temporal and modal language formulas to represent arguments in the nodes of a network. The suitable semantics for such networks is Kripke semantics. We also introduce a new key concept of usability of an argument.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barringer, H., Gabbay, D., Woods, J.: Temporal dynamics of support and attack networks. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning. LNCS (LNAI), vol. 2605, pp. 59–98. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Caminada, M.W.A.: On the issue of reinstatement in argumentation. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 111–123. Springer, Heidelberg (2006), http://icr.uni.lu/~martinc/publications/JELIA_reinstatement.pdf

    Chapter  Google Scholar 

  3. Caminada, M.W.A.: An algorithm for computing semi-stable semantics. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 222–234. Springer, Heidelberg (2007), http://icr.uni.lu/~martinc/publications/algorithm_eCSQARU.pdf

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Gabbay, D.M.: Fibring Logics, OUP (1996)

    Google Scholar 

  6. Hunter, A.: Ramification analysis with structured news reports using temporal argumentation. In: Proc. of the Adventures in Argumentation Workshop (at 6th ECSQARU) (2001), http://www.cs.ucl.ac.uk/staff/a.hunter/papers/ra2.ps

  7. Jakobovits, H., Vermeir, D.: Robust semantics for argumentation frameworks. Journal of Logic and Computation 9, 215–261 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gabbay, D.M., d’Avila Garcez, A.S.: Logical Modes of Attack in Argumentation Networks. Studia Logica 93(2-3), 199–230 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Caminada, M., Gabbay, D.M.: A logical account of formal argumentation. Studia Logica 93(2-3), 109–145 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gabbay, D.M.: Modal foundations for argumentation networks. Studia Logica 93(2-3), 199–230 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gabbay, D.M.: Fibring argumentation frames. Studia Logica 93(2-3), 231–295 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mann, N., Hunter, A.: Argumentation Using Temporal Knowledge. In: COMMA 2008, Toulouse, France, May 28-30, pp. 204–215. IOS Press, Amsterdam (2008)

    Google Scholar 

  13. Augusto, J.C., Simari, G.R.: A temporal argumentative system. AI Communications 12, 237–257 (1999)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Barringer, H., Gabbay, D.M. (2010). Modal and Temporal Argumentation Networks. In: Manna, Z., Peled, D.A. (eds) Time for Verification. Lecture Notes in Computer Science, vol 6200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13754-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13754-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13753-2

  • Online ISBN: 978-3-642-13754-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics