Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming

Chesñevar, Carlos Iván; Simari, Guillermo Ricardo; Godo i Lacasa, Lluís

doi:https://doi.org/10.1007/11546207_13

View/Open

007877.pdf (280.3Kb)
Sol·licita una còpia

Issue date

2005

Author

Chesñevar, Carlos Iván

Simari, Guillermo Ricardo

Godo i Lacasa, Lluís

Suggested citation

Chesñevar, Carlos Iván; Simari, Guillermo Ricardo; Godo i Lacasa, Lluís; . (2005) . Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming. Lecture Notes in Computer Science, 2005, vol. 3662, p. 158-171. https://doi.org/10.1007/11546207_13.

Abstract

Possibilistic 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.

URI

http://hdl.handle.net/10459.1/57612

DOI

https://doi.org/10.1007/11546207_13

Is part of

Lecture Notes in Computer Science, 2005, vol. 3662, p. 158-171