Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar registro sencillo

dc.date.accessioned 2012-10-26T12:22:24Z
dc.date.available 2012-10-26T12:22:24Z
dc.date.issued 2005-10
dc.identifier.uri http://hdl.handle.net/10915/23000
dc.description.abstract Defeasible Logic Programming (DeLP) is a suitable tool for knowledge representation and reasoning. Its operational semantics is based on a dialectical analysis where arguments for and against a literal interact in order to determine whether this literal is believed by a reasoning agent. The semantics GS is a declarative trivalued game-based semantics for DeLP that is sound and complete for DeLP operational semantics. Complexity theory has become an important tool for comparing different formalism and for helping to improve implementations whenever is possible. For these reasons, it is important to investigate the computational complexity and expressive power of DeLP. In this paper we present a complexity analysis of DeLP through game-semantics GS. In particular, we have determined that computing rigorous consequences is P-complete and that the decision problem “a set of defeasible rules is an argument for a literal under a de.l.p.” is in P. en
dc.format.extent 12 p. es
dc.language en es
dc.title An analysis of the computational complexity of DeLP through game semantics en
dc.type Objeto de conferencia es
sedici.creator.person Cecchi, Laura es
sedici.creator.person Fillottrani, Pablo Rubén es
sedici.creator.person Simari, Guillermo Ricardo es
sedici.description.note VI Workshop de Agentes y Sistemas Inteligentes (WASI) es
sedici.subject.materias Ciencias Informáticas es
sedici.subject.keyword argumentative systems en
sedici.subject.keyword defeasible reasoning en
sedici.description.fulltext true es
mods.originInfo.place Red de Universidades con Carreras en Informática (RedUNCI) es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
sedici.date.exposure 2005-10
sedici.relation.event XI Congreso Argentino de Ciencias de la Computación es
sedici.description.peerReview peer-review es
sedici.subject.acmcss98 Logic Programming es
sedici.subject.acmcss98 Semantics es
sedici.subject.acmcss98 Games es


Descargar archivos

Este ítem aparece en las siguientes colecciones:

Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)