On the computational complexity of assumption-based argumentation for default reasoning

Yannis Dimopoulos, Bernhard Nebel, Francesca Toni. On the computational complexity of assumption-based argumentation for default reasoning. Artificial Intelligence, 141(1/2):57-78, 2002. [doi]

@article{DimopoulosNT02,
  title = {On the computational complexity of assumption-based argumentation for default reasoning},
  author = {Yannis Dimopoulos and Bernhard Nebel and Francesca Toni},
  year = {2002},
  doi = {10.1016/S0004-3702(02)00245-X},
  url = {http://dx.doi.org/10.1016/S0004-3702(02)00245-X},
  tags = {rule-based},
  researchr = {https://researchr.org/publication/DimopoulosNT02},
  cites = {0},
  citedby = {0},
  journal = {Artificial Intelligence},
  volume = {141},
  number = {1/2},
  pages = {57-78},
}