INVESTIGADORES
TOHME Fernando Abel
artículos
Título:
The foundations of DeLP: defeating relations, games and truth values
Autor/es:
VIGLIZZO, IGNACIO; TOHMÉ, FERNANDO; SIMARI, GUILLERMO
Revista:
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
Editorial:
SPRINGER
Referencias:
Lugar: Berlin; Año: 2010
ISSN:
1012-2443
Resumen:
In this paper we examine the mechanism of DeLP (Defeasible Logic Programming). We first study the definition of the defeating relation in a formal setting that allows us to uncover some hidden assumptions, and suggest an alternative definition. Then we introduce a game-theoretic characterization of the system. We obtain a new set of truth values arising from games in which arguments for and against a given literal are played out. We study how additional constraints define protocols of admissible attacks. The DeLP protocol ensures the finiteness of the games, and therefore the existence of winning strategies for the corresponding games. The defeating relation among arguments determines the strategies that will win and consequently the truth values of queries. We find that the DeLP protocol also excludes the warranting of a literal and its negation.