Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach

Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati. Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach. In Elizabeth Black, Sanjay Modgil, Nir Oren, editors, Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers. Volume 8306 of Lecture Notes in Computer Science, pages 176-193, Springer, 2013. [doi]

@inproceedings{CeruttiDGV13,
  title = {Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach},
  author = {Federico Cerutti and Paul E. Dunne and Massimiliano Giacomin and Mauro Vallati},
  year = {2013},
  doi = {10.1007/978-3-642-54373-9_12},
  url = {http://dx.doi.org/10.1007/978-3-642-54373-9_12},
  researchr = {https://researchr.org/publication/CeruttiDGV13},
  cites = {0},
  citedby = {0},
  pages = {176-193},
  booktitle = {Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers},
  editor = {Elizabeth Black and Sanjay Modgil and Nir Oren},
  volume = {8306},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-54372-2},
}