Skip to main content
SpringerLink
Log in

Modal Provability Foundations for Argumentation Networks

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

Given an argumentation network we associate with it a modal formula representing the ‘logical content’ of the network. We show a one-to-one correspondence between all possible complete Caminada labellings of the network and all possible models of the formula.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barringer, H., D. M. Gabbay, and J. Woods, ‘Temporal dynamics of argumentation networks’, in D. Hutter and W. Stephan (eds.), Mechanising Mathematical Reasoning, LNCS 2605, Springer, 2005, pp. 59–98.

  2. Boolos, G., The Logic of Provability, Cambridge University Press, 1993.

  3. Caminada, M., ‘A gentle introduction to argumentation semantics’, Lecture material, Summer 2008.

  4. Carnelli, W., M. Corniglio, D. M. Gabbay, P. Gouveia, and C. Sernadas, Analysis and Synthesis of Logics, Springer, 2008, 604 pp.

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

    Article  Google Scholar 

  6. Dung M.P.: ‘An argumentation theoretic foundation for logic programming’. Joural of Logic Programming 22(2), 151–171 (1995)

    Article  Google Scholar 

  7. Gabbay, D.M., Semantical Investigations in Modal and Tense Logics, Synthese, Volume 92, D. Reidel, 1976.

  8. Gabbay, D.M., ‘Modal provability foundations for negation by failure’, Imperial College Technical Report, 86/4, 1986.

  9. Gabbay, D.M., ‘Modal provability foundations for negation by failure’, in P. Schroeder-Heister (ed.), Extensions of Logic Programming, Vol. 475 of LNCS, Springer-Verlag, 1990, pp. 179–222.

  10. Przymusinski, T., ‘Well founded semantics coincides with three valued stable semantics’, in W. Marek (ed.), Special issue on Non-monotonic reasoning, Fundamenta Informatica 13(4): 445–464, 1990.

    Google Scholar 

  11. Solovay R.: ‘Provability interpretations of modal logic’. Israel Journal of Mathematics 25, 287–304 (1976)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. King’s College, London, UK

    Dov M. Gabbay

  2. Bar-Alan University, Romat Gan, Israel

    Dov M. Gabbay

  3. University of Luxembourg, Luxembourg, Belgium

    Dov M. Gabbay

Authors
  1. Dov M. Gabbay
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dov M. Gabbay.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gabbay, D.M. Modal Provability Foundations for Argumentation Networks. Stud Logica 93, 181 (2009). https://doi.org/10.1007/s11225-009-9215-0

Download citation

  • Published:

  • DOI: https://doi.org/10.1007/s11225-009-9215-0

Keywords

Search

Navigation