Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming
Issue date
2005Author
Chesñevar, Carlos Iván
Simari, Guillermo Ricardo
Godo i Lacasa, Lluís
Metadata
Show full item recordAbstract
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.