An alternative foundation for DeLP: defeating relations and truth values

Authors:
Ignacio D. Viglizzo;Fernando A. Tohmé;Guillermo R. Simari
Affiliations:
Artificial Intelligence Res. and Development Lab., Univ. Nacional del Sur, Bahía Blanca, Argentina and Dept. of Mathematics, Univ. Nacional del Sur, Bahía Blanca, Argentina and Consejo N ...;Artificial Intelligence Res. and Development Lab., Univ. Nacional del Sur, Bahía Blanca, Argentina and Dept. of Economics, Univ. Nacional del Sur, Bahía Blanca, Argentina and Consejo Nac ...;Artificial Intelligence Research and Development Laboratory, Universidad Nacional del Sur, Bahía Blanca, Argentina and Department of Computer Science and Engineering, Universidad Nacional del ...
Venue:
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Year:
2008

Citing 15
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
Logical models of argument

ACM Computing Surveys (CSUR)
A logic-based theory of deductive arguments

Artificial Intelligence
Cognitive Carpentry: A Blueprint for how to Build a Person

Cognitive Carpentry: A Blueprint for how to Build a Person
A Reasoning Model Based on the Production of Acceptable Arguments

Annals of Mathematics and Artificial Intelligence
Extensive Games as Process Models

Journal of Logic, Language and Information
Games That Agents Play: A Formal Framework for Dialogues between Autonomous Agents

Journal of Logic, Language and Information
Relating defeasible and normal logic programming through transformation properties

Theoretical Computer Science
Modeling Dialogues Using Argumentation

ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Defeasible logic programming: an argumentative approach

Theory and Practice of Logic Programming
Coherence and Flexibility in Dialogue Games for Argumentation

Journal of Logic and Computation
On the comparison of theories: preferring the most specific explanation

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

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

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Proponent and an Opponent, in which they present arguments for and against each literal we obtain a bigger gamut of truth values for those literals and their negations as they are defended and attacked. An important role in the determination of warranted literals is assigned to a defeating relation among arguments. 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. We also show how alternative characterizations of the defeating relation may lead to different assignations of truth values to the literals in a DeLP program.