Show simple item record

dc.contributor.authorChesñevar, Carlos Iván
dc.contributor.authorSimari, Guillermo Ricardo
dc.contributor.authorGodo i Lacasa, Lluís
dc.date.accessioned2016-07-13T11:08:48Z
dc.date.issued2005
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/10459.1/57612
dc.description.abstractPossibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Solving a P-DeLP query Q accounts for performing an exhaustive analysis of arguments and defeaters for Q, resulting in a so-called dialectical tree, usually computed in a depth-first fashion. Computing dialectical trees efficiently in P-DeLP is an important issue, as some dialectical trees may be computationally more expensive than others which lead to equivalent results. In this paper we explore different aspects concerning how to speed up dialectical inference in P-DeLP. We introduce definitions which allow to characterize dialectical trees constructively rather than declaratively, identifying relevant features for pruning the associated search space. The resulting approach can be easily generalized to be applied in other argumentation frameworks based in logic programming.ca_ES
dc.description.sponsorshipThis research was partially supported by Projects TIC2003-00950, TIN2004-07933-C03-01/03, by Ramón y Cajal Program (Ministerio de Ciencia y Tecnología, Spain), by CONICET (Argentina), by the Secretaría General de Ciencia y Tecnología de la Universidad Nacional del Sur and by Agencia Nacional de Promoción Científica y Tecnológica (PICT 2002 No. 13096).ca_ES
dc.language.isoengca_ES
dc.publisherSpringer Verlagca_ES
dc.relationMICYT/PN2000-2003/TIC2003-00950ca_ES
dc.relationMIECI/PN2004-2007/TIN2004-07933-C03-01/03ca_ES
dc.relation.isformatofReproducció del document publicat a https://doi.org/10.1007/11546207_13ca_ES
dc.relation.ispartofLecture Notes in Computer Science, 2005, vol. 3662, p. 158-171ca_ES
dc.rights(c) Springer-Verlag Berlin Heidelberg, 2005ca_ES
dc.subjectDefeasible Argumentationca_ES
dc.subjectLogic Programmingca_ES
dc.subjectDialectical Reasoningca_ES
dc.titleComputing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programmingca_ES
dc.typearticleca_ES
dc.identifier.idgrec007877
dc.type.versionpublishedVersionca_ES
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccessca_ES
dc.identifier.doihttps://doi.org/10.1007/11546207_13
dc.date.embargoEndDate10000-01-01


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record