Complexity Properties of Critical Sets of Arguments

Richard Booth, Martin Caminada, Paul E. Dunne, Mikolaj Podlaszewski, Iyad Rahwan. Complexity Properties of Critical Sets of Arguments. In Simon Parsons, Nir Oren, Chris Reed, Federico Cerutti, editors, Computational Models of Argument - Proceedings of COMMA 2014, Atholl Palace Hotel, Scottish Highlands, UK, September 9-12, 2014. Volume 266 of Frontiers in Artificial Intelligence and Applications, pages 173-184, IOS Press, 2014. [doi]

@inproceedings{BoothCDPR14,
  title = {Complexity Properties of Critical Sets of Arguments},
  author = {Richard Booth and Martin Caminada and Paul E. Dunne and Mikolaj Podlaszewski and Iyad Rahwan},
  year = {2014},
  doi = {10.3233/978-1-61499-436-7-173},
  url = {http://dx.doi.org/10.3233/978-1-61499-436-7-173},
  researchr = {https://researchr.org/publication/BoothCDPR14},
  cites = {0},
  citedby = {0},
  pages = {173-184},
  booktitle = {Computational Models of Argument - Proceedings of COMMA 2014, Atholl Palace Hotel, Scottish Highlands, UK, September 9-12, 2014},
  editor = {Simon Parsons and Nir Oren and Chris Reed and Federico Cerutti},
  volume = {266},
  series = {Frontiers in Artificial Intelligence and Applications},
  publisher = {IOS Press},
  isbn = {978-1-61499-436-7},
}