Argument exchange over the semantic web

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 intended meaning. Defeasible Logic Programming is a knowledge representation and reasoning formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information. In this article we explore what is required in order to provide Defeasible Logic Programming knowledge representation and reasoning over the semantic web.Eje: Agentes y Sistemas InteligentesRed de Universidades con Carreras en Informática (RedUNCI

About the use of time on argumentative systems

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 results from Logic Programming and Defeasible Argumentation. DeLP in particular provides the possibility of representing defeasible information in a declarative way and a defeasible argumentation inference mechanism to warrant conclusions. Although this formalism and Defeasible logic programming in general are very useful has left apart an issue that is crucial on several kind of problems, namely time. There are also many developments that face temporal reasoning, in particular Event Calculus, but non of them consider defeasible information or what to do if we have incomplete or not completely reliable information. In this work we try to attempt an exploration of a possible combination of these two reasoning areas, temporal and defeasible.Eje: VI Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI

Defeasible Logic Programming: An Argumentative Approach

The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules in a declarative manner, and a defeasible argumentation inference mechanism for warranting the entailed conclusions. In DeLP an argumentation formalism will be used for deciding between contradictory goals. Queries will be supported by arguments that could be defeated by other arguments. A query q will succeed when there is an argument A for q that is warranted, ie, the argument A that supports q is found undefeated by a warrant procedure that implements a dialectical analysis. The defeasible argumentation basis of DeLP allows to build applications that deal with incomplete and contradictory information in dynamic domains. Thus, the resulting approach is suitable for representing agent's knowledge and for providing an argumentation based reasoning mechanism to agents.Comment: 43 pages, to appear in the journal "Theory and Practice of Logic Programming

Genes and Ant for Defaults Logic

Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitable for non monotonic reasoning, but the counterpart is their very high level of theoretical complexity. The purpose of this paper is to show how heuristics issued from combinatorial optimization and operation research can be used to built non monotonic reasonning systems

Argument exchange over the semantic web

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 intended meaning. Defeasible Logic Programming is a knowledge representation and reasoning formalism that by combining Logic Programming with Defeasible Argumentation is able to represent incomplete and potentially contradictory information. In this article we explore what is required in order to provide Defeasible Logic Programming knowledge representation and reasoning over the semantic web.Eje: Agentes y Sistemas InteligentesRed de Universidades con Carreras en Informática (RedUNCI

About the use of time on argumentative systems

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 results from Logic Programming and Defeasible Argumentation. DeLP in particular provides the possibility of representing defeasible information in a declarative way and a defeasible argumentation inference mechanism to warrant conclusions. Although this formalism and Defeasible logic programming in general are very useful has left apart an issue that is crucial on several kind of problems, namely time. There are also many developments that face temporal reasoning, in particular Event Calculus, but non of them consider defeasible information or what to do if we have incomplete or not completely reliable information. In this work we try to attempt an exploration of a possible combination of these two reasoning areas, temporal and defeasible.Eje: VI Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI