Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility (bibtex)
by , ,
Reference:
Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak AdmissibilityWolfgang Dvorák, Markus Ulbricht, Stefan WoltranJournal Artificial Intelligence Research, volume 74, pages 1403–1447, 2022.
Bibtex Entry:
@string{jair="Journal Artificial Intelligence Research"}
@article{DBLP:journals/jair/DvorakUW22,
keywords = "reveal",
  author    = {Wolfgang Dvor{\'{a}}k and
               Markus Ulbricht and
               Stefan Woltran},
  title     = {Recursion in Abstract Argumentation is Hard - On the Complexity of
               Semantics Based on Weak Admissibility},
  journal   = JAIR,
  volume    = {74},
  pages     = {1403--1447},
  year      = {2022},
  url       = {10.1613/jair.1.13603">https://doi.org/10.1613/jair.1.13603},
  doi       = {10.1613/jair.1.13603},
  timestamp = {Tue, 02 Aug 2022 16:46:02 +0200},
  biburl    = {https://dblp.org/rec/journals/jair/DvorakUW22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
Powered by bibtexbrowser