Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent…

Dentro del lenguaje de la Programación en Lógica tradicional, el operador de negación por falla "not" ha sido empleado tanto para representar información negativa como para proveer el fundamento básico de inferencias no monótonas.
En este trabajo se analiza este…

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…

In this work two declarative approaches based on the BDI theory are studied, an agent programming language 3APL and an agent architecture that uses defeasible argumentation for knowledge representation and reasoning. Based on that study and considering that in 3APL…

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 tools for fault impact analysis are important for the deployment of critical mission systems. These tools can be also used as a development phase aid. We introduce several concepts related to "business alarms". Business alarms are an approximation to…

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…