The Semantic Web purports to give computeraccessible meaning to the content of the World Wide Web. The rationale behind this project is to create an environment where all this information could be freely exchanged among diverse entities, yet retaining its…

There exists a large amount of knowledge representation models. But most of them have significant limitations at the epistemic level. They do not have explanatory power. Most of them do not have means to represent some functional needs to work…

Defeasible argumentation is one of the approaches that attempt to address the challenges arising when we reason defeasibly, with several formalisms in the literature reaching a mature state. Nowadays, several of them started shifting their semantics towards a dialectical characterization.…

The development of systems with the ability to reason about change notion and actions has been of great importance for the artificial intelligence community. The definition and implementation of systems capable of managing defeasible, incomplete, unreliable, or uncertain information has…

In this paper, we establish a relation between an argumentation based system: Defeasible Logic Programming (DELP), and a nonmonotonic system: Reiter’s Default Logic. This relation is achieved by introducing a variant of DELP and a transformation that maps default theories…

There are many areas in Computer Science where time plays an important role. Artificial Intelligence is one of them. In this particular area Defeasible Logic Programming (DeLP) was developed to cope with incomplete and potentially inconsistent information. This formalism combines…

In this work we analyze the problem of knowledge representation in a collaborative multi-agent system where agents can obtain new information from others through communication. Namely, we analyze several approaches of belief revision in multi-agent systems. We will describe different…