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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. Annals of Mathematics and Artificial Intelligence 34, 197–215 (2002)
Besnard, P., Hunter, A.: A logic-based theory of deductive arguments. Artificial Intelligence 128, 203–235 (2001)
Brewka, G.: Dynamic argument systems: a formal model of argumentation processes based on situation calculus. Journal of Logic and Computation 11, 257–282 (2001)
Chesñevar, C., Dix, J., Stolzenburg, F., Simari, G.: Relating defeasible and normal logic programming through transformation properties. Theor. Comput. Sci. 290(1), 499–529 (2003)
Cecchi, L., Fillottrani, P., Simari, G.: On the complexity of delp through game semantics. In: Dix, J., Hunter, A. (eds.) NMR 2006. Proc. 11th Intl. Workshop on Nonmonotonic Reasoning. IfI Technical Report Series, pp. 386–394. Clausthal University, Windermere (2006)
Chesñevar, C., Maguitman, A., Loui, R.: Logical models of argument. ACM Computing Surveys 32(4), 337–383 (2000)
Cecchi, L., Simari, G.: Sobre la relación entre la semántica gs y el razonamiento rebatible. In: X CACiC, pp. 1883–1894. Universidad Nacional de La Matanza (2004)
Dung, P.: On the acceptability of arguments and its fundamental role in non-monotonic reasoning, logic programming, and n-person games. Artificial Intelligence 77, 321–357 (1995)
García, A., Simari, G.: Defeasible logic programming: An argumentative approach. Theory and Practice of Logic Programming 4(1), 95–138 (2004)
Hamblin, C.: Fallacies. Methuen, London (1970)
Hamblin, C.: Mathematical models of dialogue. Theoria 37, 130–155 (1971)
Hintikka, J.: Language Games and Information. Clarendon Press, London (1973)
Hintikka, J., Sandu, G.: Game-Theoretical Semantics. In: Handbook of Logic and Language, Elsevier, Amsterdam (1997)
Maudet, N., Amgoud, L., Parsons, S.: Modelling dialogues using argumentation. In: Proceedings of the Fourth International Conference on MultiAgent Systems. Boston, MA, pp. 31–38 (2000)
Lorenzen, P., Lorenz, K.: Dialogische Logik. Wissenschaftliche Buchgesellschaft, Darmstadt (1978)
Lloyd, J.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
Loui, R.: Process and policy: Resource-bounded non-demonstrative reasoning. Computational Intelligence 14, 1–38 (1998)
McBurney, P., Parsons, S.: Games that agents play: A formal framework for dialogues between autonomous agents. Journal of Logic, Language and Information 13, 315–343 (2002)
Mycielski, J.: Games with perfect information. In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory with Economic Applications, ch. 3, vol. 1, pp. 41–70. Elsevier, Amsterdam (1992), http://ideas.repec.org/h/eee/gamchp/1-03.html
Nute, D.: Defeasible logic. In: Gabbay, D., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming. Nonmonotonic Reasoning and Uncertain Reasoning, vol. 3, pp. 353–395. Oxford University Press, Oxford (1994)
Osborne, M., Rubinstein, A.: A course in game theory. MIT Press, Cambridge (1994)
Pollock, J.: Defeasible reasoning. Cognitive Science 11(4), 481–518 (1987)
Pollock, J.: Cognitive Carpentry: A Blueprint for how to Build a Person. MIT Press, Cambridge (1995)
Poole, D.: On the comparison of theories: Preferring the most specific explanation. In: IJCAI, pp. 144–147 (1985)
Prakken, H.: Coherence and flexibility in dialogue games for argumentation. Journal of Logic and Computation 15, 1009–1040 (2005)
Prakken, H., Vreeswijk, G.: Logics for defeasible argumentation. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 4, pp. 219–318. Kluwer Academic, Dordrecht (2002)
Parsons, S., Wooldridge, M., Amgoud, L.: Properties and complexity of some formal interagent dialogues. Journal of Logic and Computation 13, 347–376 (2003)
Stolzenburg, F., García, A., Chesñevar, C., Simari, G.: Computing generalized specificity. Journal of Applied Non-Classical Logics 13(1), 87 (2003)
Simari, G., Loui, R.: A mathematical treatment of defeasible reasoning and its implementation. Artif. Intell. 53(2–3), 125–157 (1992)
van Benthem, J.: Extensive games as process models. Journal of Logic, Language and Information 11, 289–313 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Viglizzo, I.D., Tohmé, F.A., Simari, G.R. (2008). An Alternative Foundation for DeLP: Defeating Relations and Truth Values. In: Hartmann, S., Kern-Isberner, G. (eds) Foundations of Information and Knowledge Systems. FoIKS 2008. Lecture Notes in Computer Science, vol 4932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77684-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-77684-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77683-3
Online ISBN: 978-3-540-77684-0
eBook Packages: Computer ScienceComputer Science (R0)