Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Prioritized logic programming and its application to commonsense reasoning
Artificial Intelligence
Coherence in finite argument systems
Artificial Intelligence
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Preferred extensions as stable models*
Theory and Practice of Logic Programming
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
On the issue of reinstatement in argumentation
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Argumentation and answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Partial semantics of argumentation
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Computing abductive argumentation in answer set programming
ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
Fundamenta Informaticae - Logic, Language, Information and Computation
Toward incremental computation of argumentation semantics: A decomposition-based approach
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.01 |
We propose a simple and generic method for computing Dung's standard argumentation semantics along with semi-stable semantics in Answer Set Programming (ASP). The different semantics captured by argumentation frameworks are all uniformly represented in our ASP setting. It is based on Caminada's reinstatement labellings for argumentation frameworks as well as our method of computing circumscription in ASP. In our approach, a given argumentation framework is translated into a single normal logic program w.r.t. the chosen semantics whose answer set (if exists) yields an argument-based extension expressed by means of a reinstatement labelling for the semantics. We show soundness and completeness theorems for our translation, which allow us not only to compute argument-based extensions but also to decide whether an argument is sceptically or credulously accepted w.r.t. the chosen semantics. Based on our theorems, the prototype argumentation system was implemented using the ASP solver, DLV, whose evaluation results verified correctness of our approach.