Knowledge representation models are very important in the design of intelligent agents because they provide with mechanisms to manage beliefs and their dynamics. In this paper, we propose the use of AnsProlog* as a knowledge representation language, and develop a…

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…

In this work we analyze the problem of incorporating specificity to characterize defeat in a particular argumentative framework, called observation based defeasible logic programming (ODeLP) [1]. Eficiency is an important issues in ODeLP, since this framework has been de ned…

In this paper, we build on previous work on Belief Revision operators based on the use of logic programming with Answer Set semantics as a representation language. We present a set of postulates for Answer Set Revision with respect to…

Ontology integration is the problem of combining data sources in the SemanticWeb. Concepts in source ontologies are captured in terms of concepts de ned in a global ontology. When some of these ontologies are inconsistent, the knowledge engineer often has…

We identify different kinds of relevance relations between formulas that emerge in the process of belief revision. Informal definitions for alternative notions of relevance are suggested and a set of schemas and intuitive postulates for formalizing these notions are proposed.

Defeasible Logic Programming (DeLP) is a knowledge representation formalism that combines results from Logic Programming and Defeasible Argumentation to provide reasoning based on contradictory and potentially incomplete information. DeLP allows information representation by using weak rules and provides an argumentation…

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…

In logic programs, negation-as-failure has been used both for representing negative information and for providing default nonmonotonic inference. In this paper we argue that this twofold role is not only unnecessary for the expressiveness of the language, but it also…

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…