On the Accrual of Arguments in Defeasible Logic Programming
نویسندگان
چکیده
Recently, the notion of accrual of arguments has received some attention from the argumentation community. Three principles for argument accrual have been identified as necessary to hold in argumentation frameworks. In this paper we propose an approach to model the accrual of arguments in the context of Defeasible Logic Programming, a logic programming approach to argumentationwhich has proven to be successful for many real-world applications. We will analyze the above mentioned principles in the context of our proposal, studying other interesting properties.
منابع مشابه
Generalizing GraphPlan by Formulating Planning as a CSP
Recently, the notion of accrual of arguments has received some attention from the argumentation community. Three principles for argument accrual have been identified as necessary to hold in argumentation frameworks. In this paper we propose an approach to model the accrual of arguments in the context of Defeasible Logic Programming, a logic programming approach to argumentationwhich has proven ...
متن کاملModelling Argument Accrual in Possibilistic Defeasible Logic Programming
Argumentation frameworks have proven to be a successful approach to formalizing commonsense reasoning. Recently, some argumentation frameworks have been extended to deal with possibilistic uncertainty, notably Possibilistic Defeasible Logic Programming (P-DeLP). At the same time, modelling argument accrual has gained attention from the argumentation community. Even though some preliminary forma...
متن کاملAccrual of arguments in defeasible argumentation
In this paper we address an often overlooked problem in defeasible argumentation: how do we deal with arguments that are on their own defeated, but together remain undefeated? Pollock (1991) finds this accrual of arguments a natural supposition, but then surprisingly denies its existence. We think that arguments do accrue. To handle the accrual of arguments, we introduce compound defeat of argu...
متن کاملModeling Defeasible Argumentation within a Possibilistic Logic Framework with Fuzzy Unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at object-language level. This paper presents a first approach towards extending P-DeLP to incorporate fuzzy constants and fuzzy propositional variables. We focus on how to characteri...
متن کاملA Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming
Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at object-language level. In P-DeLP, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in the context of so-called rationality postulates for rule-based argumentation systems...
متن کامل