Handbook of logic in artificial intelligence and logic programming (vol. 3)
ACM Computing Surveys (CSUR)
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
Dialectical argumentation with argumentation schemes: an approach to legal logic
Artificial Intelligence and Law - Law, logic and defeasibility
Backing and undercutting in defeasible logic programming
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Backing and undercutting in abstract argumentation frameworks
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Arguing with justifications between collaborating agents
ArgMAS'11 Proceedings of the 8th international conference on Argumentation in Multi-Agent Systems
| Hi-index | 0.00 |
In several formalisms of classical argumentation two kinds of defeaters are considered: rebutting and undercutting. The former represents an attack to a conclusion and the latter an attack to an inference step. Defeasible Logic Programming (DeLP) is a formalism that combines argumentation and logic programming and provides a concrete argumentation system where arguments are built using program rules and facts. DeLP allows to identify arguments whose conclusions or intermediate conclusions are in contradiction. In that way, rebutting defeaters are captured. Nevertheless, in DeLP is not possible to represent an explicit attack to a program rule in order to capture undercutting defeaters. The contribution of this work is to extend the formalism of DeLP in order to allow the representation of both support and attack for defeasible rules. Therefore, it will be possible to build arguments that provide reasons for or against a defeasible rule and thus, undercutting defeaters and backings could be constructed.