Skip to main content

Introducing Equational Semantics for Argumentation Networks

  • Conference paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2011)

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

Abstract

This paper provides equational semantics for Dung’s argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations correspond to the “extensions” of the network.

This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support systems, higher level attacks, Boolean networks, dependence on time, etc, etc.

The equational approach has its conceptual roots in the 19th century following the algebraic equational approach to logic by George Boole, Louis Couturat and Ernst Schroeder.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Barringer, H., Gabbay, D.M., 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. Boole, G.: The Mathematical Analysis of Logic, Cambridge and London (1847)

    Google Scholar 

  3. Brewka, G., Woltran, S.: Abstract dialectical frameworks. In: Proc. KR 2010, pp. 102–111. AAAI Press, Menlo Park (2010)

    Google Scholar 

  4. Couturat, L.: The Algebra of Logic. Open Court (1914)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. 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 

  7. Dunne, P., Hunter, A., McBurney, P., Wooldridge, M.: Weighted argument systems. Artificial Intelligence 175, 457–486 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gabbay, D.M.: Provability foundations for argumentation networks. Studia Logica 93(2-3), 181–198 (2009)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Gabbay, D.M.: Semantics for higher level attacks in extended argumentation frames. Part 1: Overview. Studia Logica 93, 355–379 (2009)

    MathSciNet  MATH  Google Scholar 

  11. Gabbay, D.M.: Equational approach to argumentation networks, 90pp (February 2011)

    Google Scholar 

  12. Gabbay, D.M., Szałas, A.: Annotation theories over finite graphs. Studia Logica 93(2-3), 147–180 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Schröder, E.: Vorlesungen über die Algebra die Logik, vol. 3, pp. 1890–1904. B. G. Tuebner, Leipzig; Reprints, Chelsea (1966); Thoemmes Press (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gabbay, D.M. (2011). Introducing Equational Semantics for Argumentation Networks. In: Liu, W. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2011. Lecture Notes in Computer Science(), vol 6717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22152-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22152-1_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22151-4

  • Online ISBN: 978-3-642-22152-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics