INVESTIGADORES
TOHME Fernando Abel
congresos y reuniones científicas
Título:
Winning Arguments in Defeasible Logic Programming
Autor/es:
VIGLIZZO, IGNACIO; TOHMÉ, FERNANDO; SIMARI, GUILLERMO
Lugar:
Bloomington, IN
Reunión:
Otro; Logic Seminar, Mathematics Dept., Indiana University, Bloomington; 2007
Institución organizadora:
Department of Mathematics, Indiana University, Bloomington
Resumen:
In this paper we recast the formalism of DelP (Defeasible Logic Programming) in order to clarify the role of the defeating relation in the determination of warranted literals. The tools employed are basic set algebra and some game theory. By considering a game between a Proponent and an Opponent to each literal we obtain a bigger gamut of truth values for those literals and their negations as they are defended and attacked. We consider first an unrestricted version in which these games may be infinite and then we analyze the underlying assumptions commonly used to make them finite. Under these restrictions the games are always determined -one of the players has a winning strategy. We show how varying the defeating relation may alter the set of truth values reachable under this formalism.
