Phan Minh Dung, Paolo Mancarella, Francesca Toni
We present a procedure for computing the sceptical "ideal semantics" for argumentation in assumption-based frameworks. This semantics was first
proposed for logic programming, extending the well-founded semantics. The proof procedure is defined by means of a form of dispute derivations, obtained by modifying dispute derivations for computing credulous admissible argumentation. The new dispute derivations are sound for the "ideal semantics" in all cases where the original dispute derivations are complete for admissible argumentation. We prove that this is the case
for the special kind of assumption-based frameworks with a finite underlying language and with the property of being "p-acyclic".
pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.