Analyzing the defeat relation in observation-based defeasible logic programming

In the last decade several ways to formalize defeasible reasoning have been studied. A particular approach, defeasible argumentation, has been particularly successful to achieve this goal. The inference process of argument-based systems is based on the interaction of ar- guments for and against cer...

Descripción completa

Detalles Bibliográficos
Autores principales: Capobianco, Marcela, Chesñevar, Carlos Iván, Simari, Guillermo Ricardo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2004
Materias:
Ciencias Informáticas
knowledge representation
ARTIFICIAL INTELLIGENCE
Intelligent agents
defeasible reasoning
argumentation
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22519
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-22519
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
knowledge representation
ARTIFICIAL INTELLIGENCE
Intelligent agents
defeasible reasoning
argumentation
spellingShingle Ciencias Informáticas
knowledge representation
ARTIFICIAL INTELLIGENCE
Intelligent agents
defeasible reasoning
argumentation
Capobianco, Marcela
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
Analyzing the defeat relation in observation-based defeasible logic programming
topic_facet Ciencias Informáticas
knowledge representation
ARTIFICIAL INTELLIGENCE
Intelligent agents
defeasible reasoning
argumentation
description In the last decade several ways to formalize defeasible reasoning have been studied. A particular approach, defeasible argumentation, has been particularly successful to achieve this goal. The inference process of argument-based systems is based on the interaction of ar- guments for and against certain conclusions. The relations of attack and defeat among arguments are key elements in these inference process. Usually a preference criterion is used to calculate the defeat relation to decide, in case of con ict, which argument is preferred over its contender. Speci city is a domain independent principle that has been used in several formalisms. In this work we analyze the problem of incorporating speci city to characterize defeat in a particular argumentative framework, called Observation Based Defeasible Logic Program- ming. Since e ciency is an important issue in ODeLP, we have devised a new version of this criterion, that optimizes the computation of the defeat relation. We also present a formal proof to show that this new version is equivalent to the old one.
format Objeto de conferencia
Objeto de conferencia
author Capobianco, Marcela
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
author_facet Capobianco, Marcela
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
author_sort Capobianco, Marcela
title Analyzing the defeat relation in observation-based defeasible logic programming
title_short Analyzing the defeat relation in observation-based defeasible logic programming
title_full Analyzing the defeat relation in observation-based defeasible logic programming
title_fullStr Analyzing the defeat relation in observation-based defeasible logic programming
title_full_unstemmed Analyzing the defeat relation in observation-based defeasible logic programming
title_sort analyzing the defeat relation in observation-based defeasible logic programming
publishDate 2004
url http://sedici.unlp.edu.ar/handle/10915/22519
work_keys_str_mv AT capobiancomarcela analyzingthedefeatrelationinobservationbaseddefeasiblelogicprogramming
AT chesnevarcarlosivan analyzingthedefeatrelationinobservationbaseddefeasiblelogicprogramming
AT simariguillermoricardo analyzingthedefeatrelationinobservationbaseddefeasiblelogicprogramming
bdutipo_str Repositorios
_version_ 1764820465893769217

Ejemplares similares