Scenario semantics of extended logic programs
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
The acceptability semantics for logic programs
Proceedings of the eleventh international conference on Logic programming
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
Dialectic semantics for argumentation frameworks
ICAIL '99 Proceedings of the 7th international conference on Artificial intelligence and law
On the computational complexity of assumption-based argumentation for default reasoning
Artificial Intelligence
Computing the Acceptability Semantics
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Two party immediate response disputes: properties and efficiency
Artificial Intelligence
Computing ideal sceptical argumentation
Artificial Intelligence
Computing Arguments and Attacks in Assumption-Based Argumentation
IEEE Intelligent Systems
Elements of Argumentation
An Algorithm for Computing Semi-stable Semantics
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Dialectical Explanations in Defeasible Argumentation
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Argue tuProlog: A Lightweight Argumentation Engine for Agent Applications
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Towards argumentation-based contract negotiation
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Hybrid argumentation and its properties
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
The computational complexity of ideal semantics
Artificial Intelligence
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Assumption-based argumentation for closed and consistent defeasible reasoning
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Some design guidelines for practical argumentation systems
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Argumentation for Aggregating Clinical Evidence
ICTAI '10 Proceedings of the 2010 22nd IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Algorithms for generating arguments and counterarguments in propositional logic
International Journal of Approximate Reasoning
Argumentation and answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
An implementation of a lightweight argumentation engine for agent applications
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Dominant decisions by argumentation agents
ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
Hi-index | 0.00 |
Assumption-based argumentation is a general-purpose argumentation framework with well-understood theoretical foundations and viable computational mechanisms (in the form of dispute derivations), as well as several applications. However, the existing computational mechanisms have several limitations, hindering their deployment in practice: (i) they are defined in terms of implicit parameters, that nonetheless need to be instantiated at implementation time; (ii) they are variations (for computing different semantics) of one another, but still require different implementation efforts; (iii) they reduce the problem of computing arguments to the problem of computing assumptions supporting these arguments, even though applications of argumentation require a justification of claims in terms of explicit arguments and attacks between them. In this context, the contribution of this paper is two-fold. Firstly, we provide a unified view of the existing (GB-, AB- and IB-)dispute derivations (for computation under the grounded, admissible and ideal semantics, respectively), by obtaining them as special instances of a single notion of X-dispute derivations that, in addition, renders explicit the implicit parameters in the original dispute derivations. Thus, X-dispute derivations address issues (i) and (ii). Secondly, we define structured X-dispute derivations, extending X-dispute derivations by computing explicitly the underlying arguments and attacks, in addition to assumptions. Thus, structured X-dispute derivations also address issue (iii). We prove soundness and completeness results for appropriate instances of (structured) X-dispute derivations, w.r.t. the grounded, admissible and ideal semantics, thus laying the necessary theoretical foundations for deployability thereof.