Skip to main content
Top

2019 | OriginalPaper | Chapter

Algorithmic Approaches to Computational Models of Argumentation

Author : Matthias Thimm

Published in: Flexible Query Answering Systems

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Computational models of argumentation [1] are approaches for non-monotonic reasoning that focus on the interplay between arguments and counterarguments in order to reach conclusions.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference Besnard, P., Hunter, A.: Constructing argument graphs with deductive arguments: a tutorial. Argum. Comput. 5(1), 5–30 (2014)CrossRef Besnard, P., Hunter, A.: Constructing argument graphs with deductive arguments: a tutorial. Argum. Comput. 5(1), 5–30 (2014)CrossRef
3.
go back to reference Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)MATH Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)MATH
4.
go back to reference Cerutti, F., Gaggl, S.A., Thimm, M., Wallner, J.P.: Foundations of implementations for formal argumentation. In: Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, chap. 15. College Publications, February 2018. Also appears in IfCoLog J. Log. Appl. 4(8), 2623–2706, October 2017 Cerutti, F., Gaggl, S.A., Thimm, M., Wallner, J.P.: Foundations of implementations for formal argumentation. In: Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, chap. 15. College Publications, February 2018. Also appears in IfCoLog J. Log. Appl. 4(8), 2623–2706, October 2017
5.
go back to reference Cerutti, F., Giacomin, M., Vallati, M.: ArgSemSAT: solving argumentation problems using SAT. In: Computational Models of Argument - Proceedings of COMMA 2014, Atholl Palace Hotel, Scottish Highlands, UK, 9–12 September 2014, pp. 455–456 (2014) Cerutti, F., Giacomin, M., Vallati, M.: ArgSemSAT: solving argumentation problems using SAT. In: Computational Models of Argument - Proceedings of COMMA 2014, Atholl Palace Hotel, Scottish Highlands, UK, 9–12 September 2014, pp. 455–456 (2014)
6.
go back to reference 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)MathSciNetCrossRef 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)MathSciNetCrossRef
7.
go back to reference Dimopoulos, Y., Nebel, B., Toni, F.: On the computational complexity of assumption-based argumentation for default reasoning. Artif. Intell. 141(1), 57–78 (2002)MathSciNetCrossRef Dimopoulos, Y., Nebel, B., Toni, F.: On the computational complexity of assumption-based argumentation for default reasoning. Artif. Intell. 141(1), 57–78 (2002)MathSciNetCrossRef
8.
go back to reference Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–358 (1995)MathSciNetCrossRef Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–358 (1995)MathSciNetCrossRef
9.
go back to reference Dvořák, W., Dunne, P.E.: Computational problems in formal argumentation and their complexity. In: Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, chap. 14. College Publications, February 2018 Dvořák, W., Dunne, P.E.: Computational problems in formal argumentation and their complexity. In: Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, chap. 14. College Publications, February 2018
10.
go back to reference Egly, U., Gaggl, S.A., Woltran, S.: Answer-set programming encodings for argumentation frameworks. Technical report DBAI-TR-2008-62, Technische Universität Wien (2008) Egly, U., Gaggl, S.A., Woltran, S.: Answer-set programming encodings for argumentation frameworks. Technical report DBAI-TR-2008-62, Technische Universität Wien (2008)
11.
go back to reference Gabbay, D., Rodrigues, O.: A self-correcting iteration schema for argumentation networks. In: Proceedings of the Fifth International Conference on Computational Models of Argumentation (COMMA 2014) (2014) Gabbay, D., Rodrigues, O.: A self-correcting iteration schema for argumentation networks. In: Proceedings of the Fifth International Conference on Computational Models of Argumentation (COMMA 2014) (2014)
12.
go back to reference Gaggl, S.A., Manthey, N.: ASPARTIX-D: ASP argumentation reasoning tool - dresden. In: System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA 2015). ArXiv (2015) Gaggl, S.A., Manthey, N.: ASPARTIX-D: ASP argumentation reasoning tool - dresden. In: System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA 2015). ArXiv (2015)
13.
go back to reference García, A.J., Simari, G.R.: Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers. Argum. Comput. 5(1), 63–88 (2014)CrossRef García, A.J., Simari, G.R.: Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers. Argum. Comput. 5(1), 63–88 (2014)CrossRef
14.
go back to reference Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2012)CrossRef Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2012)CrossRef
16.
go back to reference Modgil, S., Prakken, H.: The ASPIC+ framework for structured argumentation: a tutorial. Argum. Comput. 5, 31–62 (2014)CrossRef Modgil, S., Prakken, H.: The ASPIC+ framework for structured argumentation: a tutorial. Argum. Comput. 5, 31–62 (2014)CrossRef
17.
go back to reference Nofal, S., Atkinson, K., Dunne, P.E.: Looking-ahead in backtracking algorithms for abstract argumentation. Int. J. Approx. Reason. 78, 265–282 (2016)MathSciNetCrossRef Nofal, S., Atkinson, K., Dunne, P.E.: Looking-ahead in backtracking algorithms for abstract argumentation. Int. J. Approx. Reason. 78, 265–282 (2016)MathSciNetCrossRef
19.
go back to reference Snaith, M., Reed, C.: TOAST: online ASPIC+ implementation. In: Proceedings of the Fourth International Conference on Computational Models of Argument (COMMA 2012), pp. 509–510. IOS Press (2012) Snaith, M., Reed, C.: TOAST: online ASPIC+ implementation. In: Proceedings of the Fourth International Conference on Computational Models of Argument (COMMA 2012), pp. 509–510. IOS Press (2012)
20.
go back to reference Thimm, M.: Stochastic local search algorithms for abstract argumentation under stable semantics. In: Modgil, S., Budzynska, K., Lawrence, J. (eds.) Proceedings of the Seventh International Conference on Computational Models of Argumentation (COMMA 2018). Frontiers in Artificial Intelligence and Applications, Warsaw, Poland, vol. 305, pp. 169–180, September 2018 Thimm, M.: Stochastic local search algorithms for abstract argumentation under stable semantics. In: Modgil, S., Budzynska, K., Lawrence, J. (eds.) Proceedings of the Seventh International Conference on Computational Models of Argumentation (COMMA 2018). Frontiers in Artificial Intelligence and Applications, Warsaw, Poland, vol. 305, pp. 169–180, September 2018
21.
go back to reference Thimm, M., Rienstra, T.: Approximate reasoning with ASPIC+ by argument sampling (2019, under review) Thimm, M., Rienstra, T.: Approximate reasoning with ASPIC+ by argument sampling (2019, under review)
22.
go back to reference Toni, F.: A tutorial on assumption-based argumentation. Argum. Comput. 5(1), 89–117 (2014)CrossRef Toni, F.: A tutorial on assumption-based argumentation. Argum. Comput. 5(1), 89–117 (2014)CrossRef
Metadata
Title
Algorithmic Approaches to Computational Models of Argumentation
Author
Matthias Thimm
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-030-27629-4_4

Premium Partner