t-DeLP: A Temporal Extension of the Defeasible Logic Programming Argumentative Framework

  title={t-DeLP: A Temporal Extension of the Defeasible Logic Programming Argumentative Framework},
  author={Pere Pardo and Llu{\'i}s Godo},
The aim of this paper is to offer an argumentation-based defeasible logic that enables temporal forward reasoning. We extend the DeLP logical framework by associating temporal parameters to literals. A temporal logic program is a set of temporal literals and durative rules. These temporal facts and rules combine into durative arguments representing temporal processes, that permit us to reason defeasibly about future states. The corresponding notion of logical consequence, or warrant, is defined… 
t-DeLP: an argumentation-based Temporal Defeasible Logic Programming framework
The aim of this paper is to propose an argumentation-based defeasible logic, called t-DeLP, that focuses on forward temporal reasoning for causal inference. We extend the language of the DeLP logical
Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights
This contribution extends the argumentation defeasible reasoning system $\mbox{\textsf{t-DeLP} by allowing to attach uncertainty weights to defeasibles temporal rules and hence stratifying the set of defeasibility rules in a program.
Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers
Defeasible Logic Programming offers a computational reasoning system that uses an argumentation engine to obtain answers from a knowledge base represented using a logic programming language extended with defeasible rules.
Bipolarity in temporal argumentation frameworks
An Approach to Argumentation Considering Attacks through Time
This work presents an instantiation of the abstract framework E-TAF on an extension of Defeasible Logic Programming incorporating the representation of temporal availability and strength factors of arguments varying over time, associating these characteristics with the language of DeLP.
Cooperative Dialogues for Defeasible Argumentation-Based Planning
This contribution proposes a model for argumentation-based multi-agent planning, with a focus on cooperative scenarios, by imposing agents a standard representation of planning domains that facilitates argumentative planning.
Argumentation in Multi-Agent Systems
The feasibility of the approach is illustrated in an agent-based web linkage scenario, showing that its performance is comparable to that of simple proposal-based negotiation while accommodating much stricter constraints regarding “what can be said” like those used in argumentation.
Logical planning in Temporal Defeasible and Dynamic Epistemic Logics: the case of t-DeLP and LCC
En esta tesis, estudiamos sistemas de planificacion basados en logicas, para los casos particulares de las logicas Temporal Defeasible Logic Programming t-DeLP y Logics of Communication and Change
Defeasible Argumentation for Cooperative Multi-Agent Planning
Dentro de la Inteligencia Artificial (IA), existen tres ramas que han sido ampliamente estudiadas en los ultimos anos: Sistemas Multi-Agente (SMA), Argumentacion y Planificacion Automatica. Un SMA es


Defeasible Logic Programming: An Argumentative Approach
The work reported here introducesdefeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation and a defeasible argumentation inference mechanism for warranting the entailed conclusions.
Temporal Extensions to Defeasible Logic
The logic is extended to cope with durative facts, as well as with delays between the antecedent and the consequent of rules, and it is shown that the extended temporalised framework is suitable to model different types of causal relations.
Temporal Defeasible Reasoning
An argumentation system that allows temporal reasoning using the notions of instant and interval is presented and the proposal is illustrated showing how to solve well-known problems of the literature.
Defeasible Logic is Stable
This work defines, and gives some of the intuition behind the definition of, a nonmonotonic logic called defeasible logic, and shows how well the definition captures the authors' intuitions.
On the evaluation of argumentation formalisms
On Admissibility in Timed Abstract Argumentation Frameworks
In this work, we define Timed Abstract Argumentation Frameworks, a novel argumentation formalism where arguments are only valid for consideration in a given period of time, which is defined for every
Argumentation and the Dynamics of Warranted Beliefs in Changing Environments
A new argument-based formalism specifically designed for representing knowledge and beliefs of agents in dynamic environments, called Observation-based Defeasible Logic Programming (ODeLP), which allows an ODeLP-based agent to model new incoming perceptions, and modify the agent’s knowledge about the world accordingly.
Argumentation Using Temporal Knowledge
A calculus for representing temporal knowledge is proposed, and defined in terms of propositional logic, with respect to argumentation, where an argument is pair such that Φ a minimally consistent subset of a database entailing α.
Defeasible Logic
A theoretical approach to this problem is described, implementation of this approach as an extension of Prolog is discussed, and some application of this work to normative reasoning, learning, planning, and other types of automated reasoning is described.