Skip to main content
SpringerLink
Log in

A Forward Propagation Algorithm for the Computation of the Semantics of Argumentation Frameworks

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

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

Abstract

In this paper we propose a novel algorithm for the computation of the semantics of argumentation frameworks. The algorithm can generate all complete extensions and thus can be used in problems involving the grounded, complete, preferred and stable semantics. The algorithm takes advantage of the constraints imposed on legal labelling functions to prune the search space of possible solutions.

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

Access this chapter

Log in via an institution
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.

    For easier understanding the algorithm is broken into functional sub-components.

  2. 2.

    This is called the horizontal combination of solutions of the layer.

  3. 3.

    Unlike ours, Modgil-Caminada’s algorithm does not guarantee the generation of all complete extensions.

  4. 4.

    We know that \(\lambda (X)=\mathbf {und}\) by (I1), but we still want to make sure that X can be re-labelled \(\mathbf {in}\) which is not the case if an external attacker \(Y \in X^{-}\) has \(\text {f}(Y)=\mathbf {und}\).

  5. 5.

    The set \(\varLambda \) is updated according to the desired semantics (see Sect. 3.3).

  6. 6.

    There is an analogous branch for all other arguments \(A_2\),...,\(A_5\).

  7. 7.

    A more robust SAT-based argumentation solver would employ special techniques to maximise the performance of the underlying SAT solver.

References

  1. Baroni, P., Giacomin, M., Guida, G.: SCC-recursiveness: a general schema for argumentation semantics. Artif. Intell. 168(1), 162–210 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baumann, R.: Splitting an argumentation framework. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 40–53. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20895-9_6

    Chapter  Google Scholar 

  3. Baumann, R., Brewka, G., Wong, R.: Splitting argumentation frameworks: an empirical evaluation. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS (LNAI), vol. 7132, pp. 17–31. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29184-5_2

    Chapter  Google Scholar 

  4. Caminada, M.: A labelling approach for ideal and stage semantics. Argum. Comput. 2(1), 1–21 (2011)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Cerutti, F., Giacomin, M., Vallati, M., Zanella, M.: A SCC recursive meta-algorithm for computing preferred labellings in abstract argumentation. In: 14th International Conference on Principles of Knowledge Representation and Reasoning (2014)

    Google Scholar 

  7. Cerutti, F., Vallati, M., Giacomin, M.: Where are we now? State of the art and future trends of solvers for hard argumentation problems. In: Baroni, P., Gordon, T., Scheffler, T. (eds.) Proceedings of COMMA, Frontiers in Artificial Intelligence and Applications, vol. 287, pp. 207–218. IOS Press (2016)

    Google Scholar 

  8. Charwat, G., Dvořák, W., Gaggl, S.A., Wallner, J.P., Woltran, S.: Methods for solving reasoning problems in abstract argumentation a survey. Artif. Intell. 220, 28–63 (2015)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Gabbay, D.M., Rodrigues, O.: Further applications of the Gabbay-Rodrigues iteration schema. In: Beierle, C., Brewka, G., Thimm, M. (eds.) Computational Models of Rationality, vol. 29, pp. 392–407. College Publications (2016)

    Google Scholar 

  11. Liao, B.: Toward incremental computation of argumentation semantics: a decomposition-based approach. Ann. Math. Artif. Intell. 67(3), 319–358 (2013). http://dx.doi.org/10.1007/s10472-013-9364-8

  12. Modgil, S., Caminada, M.: Proof theories and algorithms for abstract argumentation frameworks. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 105–129. Springer, Boston (2009). https://doi.org/10.1007/978-0-387-98197-0_6

    Chapter  Google Scholar 

  13. Nofal, S., Atkinson, K., Dunne, P.E.: Algorithms for decision problems in argument systems under preferred semantics. Artif. Intell. 207, 23–51 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Rodrigues, O.: GRIS system description. In: Thimm, M., Villata, S. (eds.) System Descriptions of the 1st International Competition on Computational Models of Argumentation, pp. 37–40. Cornell University Library (2015)

    Google Scholar 

  15. Wu, Y., Caminada, M.: A labelling-based justification status of arguments. Stud. Log. 3(4), 12–29 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, King’s College London, London, UK

    Odinaldo Rodrigues

Authors
  1. Odinaldo Rodrigues
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Odinaldo Rodrigues .

Editor information

Editors and Affiliations

  1. Department of Informatics, King's College London, London, United Kingdom

    Elizabeth Black

  2. King's College London , London, United Kingdom

    Sanjay Modgil

  3. Department of Computing Science, University of Aberdeen , Aberdeen, United Kingdom

    Nir Oren

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rodrigues, O. (2018). A Forward Propagation Algorithm for the Computation of the Semantics of Argumentation Frameworks. In: Black, E., Modgil, S., Oren, N. (eds) Theory and Applications of Formal Argumentation. TAFA 2017. Lecture Notes in Computer Science(), vol 10757. Springer, Cham. https://doi.org/10.1007/978-3-319-75553-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75553-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75552-6

  • Online ISBN: 978-3-319-75553-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation