The foundations of DeLP: defeating relations, games and truth values

Authors:
Ignacio Darío Viglizzo;Fernando A. Tohmé;Guillermo R. Simari
Affiliations:
CONICET, Cdad. de Buenos Aires, Argentina CP C1033AAJ and Universidad Nacional del Sur, Bahía Blanca, Argentina B8000CPB;CONICET, Cdad. de Buenos Aires, Argentina CP C1033AAJ and Universidad Nacional del Sur, Bahía Blanca, Argentina B8000CPB;Universidad Nacional del Sur, Bahía Blanca, Argentina B8000CPB
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2009

Citing 13
Cited 1

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
A mathematical treatment of defeasible reasoning and its implementation

Artificial Intelligence
Defeasible logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
Abstract argumentation systems

Artificial Intelligence
Foundations of logic programming

Principles of knowledge representation
Representation results for defeasible logic

ACM Transactions on Computational Logic (TOCL)
Logical models of argument

ACM Computing Surveys (CSUR)
Cognitive Carpentry: A Blueprint for how to Build a Person

Cognitive Carpentry: A Blueprint for how to Build a Person
Relating defeasible and normal logic programming through transformation properties

Theoretical Computer Science
Defeasible logic programming: an argumentative approach

Theory and Practice of Logic Programming
Argumentation Semantics for Defeasible Logic

Journal of Logic and Computation
An alternative foundation for DeLP: defeating relations and truth values

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems

Modelling argument accrual with possibilistic uncertainty in a logic programming setting

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.