Towards an abstract characterization of the subargument relation

Dung’s classic framework is formed by abstract arguments and a binary relation denoting attacks between arguments. Several semantic elaboration and extensions based on this framework are present in the literature. The notion of subargument, however, was not widely studied as an abstract concept although it is an important part of fully implemented argument systems. In this paper we introduce the characterization of properties of a sensible subargument relation in abstract argumentation frameworksWorkshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI

Towards an abstract characterization of the subargument relation

Dung’s classic framework is formed by abstract arguments and a binary relation denoting attacks between arguments. Several semantic elaboration and extensions based on this framework are present in the literature. The notion of subargument, however, was not widely studied as an abstract concept although it is an important part of fully implemented argument systems. In this paper we introduce the characterization of properties of a sensible subargument relation in abstract argumentation frameworksWorkshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI

A comparison between non-monotonic formalisms

It is interesting and important to compare, analyze and assess the alternative tools that could be used in the area of Knowledge Representation. In this paper we present a reasearch line associated to this goal: to formally establish the relation among Knowledge Representation formalisms in order to make a sensible use of them. As a part of this main task, we present a comparison between Normal Default Theory and Defeasible Logic Programming. This comparison is achieved introducing a DELP variant, called DELP;, which allows to associate the answers of a DELP interpreter to the consequences, credulous and skeptical, of a Normal Default Theory.Eje: Agentes y Sistemas InteligentesRed de Universidades con Carreras en Informática (RedUNCI

Reasoning about intentions: a defeasible argumentation approach

In this work we present an approach to model an action-oriented system controlled by BDI agents using a defeasible argumentation formalism to represent its knowledge. Here, our main concern will be modelling the software agents that drive the physical robots. The chosen agent architecture will be BDI and it will use defeasible argumentation to perform the reasoning part of the system. Provided that our laboratory has the basic setup to implement a robotic soccer team, that is the application domain selected to test this approach.VI Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI

Handling inconsistency on ontologies through a generalized dynamic argumentation framework

In this article we present a generalized dynamic argumentation framework that handles arguments expressed in an abstract language assumed to be some first order logic fragment. Once the formalism is presented, we propose a reification to the description logic ALC with the intention to handle ontology debugging. In this sense, since argumentation frameworks reason over graphs that relate arguments through attack, our methodology is proposed to bridge ontological inconsistency sources to attack relations in argumentation. Finally, an argumentation semantics is proposed as a consistency restoration tool to cope with the ontology debugging.Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI

Introducing multiple preference criteria in defeasible argumentation

In this research line we are exploring the possibility of having multiple preference criteria to compare arguments in in Defeasible Argumentation. In this work we are assuming a goaloriented Argumentative System, to which an application or an agent may seek an answer in response to a query. Thus, based on the current knowledge available, the system will decide whether there exists undefeated support for that query.Eje: Inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI

Towards an abstract characterization of the subargument relation

Dung’s classic framework is formed by abstract arguments and a binary relation denoting attacks between arguments. Several semantic elaboration and extensions based on this framework are present in the literature. The notion of subargument, however, was not widely studied as an abstract concept although it is an important part of fully implemented argument systems. In this paper we introduce the characterization of properties of a sensible subargument relation in abstract argumentation frameworksWorkshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI

Evasión de obstáculos con bajo costo computacional para un equipo de fútbol de robots

En este trabajo se presenta un método de evasión de obstáculos desarrollado para un equipo de robots que compitió en la E-League dentro del Campeonato Mundial de Fútbol de Robots RoboCup 2004. La solución a este problema es central dentro de este desarrollo ya que una tarea básica que debe realizar un robot es la de trasladarse evadiendo posibles obstáculos, los cuales pueden estar en movimiento. El método propuesto está basado en la teoría de los campos de potencial y fue desarrollado desde su concepción para lograr un muy bajo costo computacional. El objetivo de este trabajo es describir el método desarrollado y su implementación. También se incluye un análisis del mismo indicando su costo computacional y sus limitaciones.Eje: V - Workshop de agentes y sistemas inteligentesRed de Universidades con Carreras en Informática (RedUNCI