The computational complexity of ideal semantics

  title={The computational complexity of ideal semantics},
  author={Paul E. Dunne},
  journal={Artif. Intell.},
We analyse the computational complexity of the recently pro posedideal semanticswithin both abstract argumentation frameworks ( AFs) and assumption-based argumentation frameworks (ABFs). It is shown that while typically less tractable than cred ulous admissibility semantics, the natural decision problems arising with this ex tension-based model can, perhaps surprisingly, be decided more efficiently than sceptical pr eferred semantics. In particular the task offinding the unique ideal… CONTINUE READING
44 Citations
36 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 44 extracted citations


Publications referenced by this paper.
Showing 1-10 of 36 references

Similar Papers

Loading similar papers…