Argumentation-based Logic Programming

Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights

Publication Type:

Conference Paper

Authors:

Lluís Godo; Enrico Marchioni; Pere Pardo

Source:

13th European Conference on Logics in Artificial Intelligence (JELIA 2012), p.242-254 (2012)

Keywords:

Possibilistic Logic; Temporal Reasoning; Argumentation-based Logic Programming

Abstract:

Recently, a temporal extension of the argumentation defea- sible reasoning system DeLP has been proposed. This system, called t-DeLP, allows to reason defeasibly about changes and persistence over time but does not offer the possibility of ranking defeasible rules accord- ing to criteria of preference or certainty (in the sense of belief). In this contribution we extend t-DeLP by allowing to attach uncertainty weights to defeasible temporal rules and hence stratifying the set of defeasible rules in a program. Technically speaking, weights are modelled as neces- sity degrees within the frame of possibility theory, a qualitative model of uncertainty.

Syndicate content