Abstract
A Timed Abstract Argumentation Framework is a novel formalism where arguments are only valid for consideration in a given period of time, which is defined for every individual argument. Thus, the attainability of attacks and defenses is related to time, and the outcome of the framework may vary accordingly. In this work we study the notion of stable extensions applied to timed-arguments. The framework is extended to include intermittent arguments, which are available with some repeated interruptions in time.
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
Allen, J.: Maintaining knowledge about temporal intervals. Communications of the ACM (26), 832–843 (1983)
Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. Annals of Mathematics and Artificial Intelligence
Amgoud, L., Cayrol, C.: On the acceptability of arguments in preference-based argumentation. In: 14th Conference on Uncertainty in Artificial Intelligence (UAI 1998), pp. 1–7. Morgan Kaufmann (1998)
Augusto, J.C., Simari, G.R.: Temporal defeasible reasoning. Knowl. Inf. Syst. 3(3), 287–318 (2001)
Baroni, P., Giacomin, M.: Resolution-based argumentation semantics. In: Proc. of 2nd International Conf. on Computational Models of Argument (COMMA 2008), pp. 25–36 (2008)
Bench-Capon, T.: Value-based argumentation frameworks. In: Proc. of Nonmonotonic Reasoning, pp. 444–453 (2002)
Cobo, M., Martinez, D., Simari, G.: An approach to timed abstract argumentation. In: Proc. of Int. Workshop of Non-monotonic Reasoning 2010 (2010)
Cobo, M.L., Martinez, D.C., Simari, G.R.: On admissibility in timed abstract argumentation frameworks. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 1007–1008. IOS Press (2010)
Dechter, R., Meiri, I., Pearl, J.: Temporal constaints networks. In: Proceedings KR 1989, pp. 83–93 (1989)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77(2), 321–358
Jakobovits, H.: Robust semantics for argumentation frameworks. Journal of Logic and Computation 9(2), 215–261 (1999)
Mann, N., Hunter, A.: Argumentation using temporal knowledge. In: Proc. of 2nd International Conf. on Computational Models of Argument (COMMA 2008), pp. 204–215 (2008)
Martínez, D.C., García, A.J., Simari, G.R.: Modelling well-structured argumentation lines. In: Proc. of XX IJCAI 2007, pp. 465–470 (2007)
Meiri, I.: Combining qualitative and quantitative contraints in temporal reasoning. In: Proceedings of AAAI 1992, pp. 260–267 (1992)
Vreeswijk, G.A.W.: Abstract argumentation systems. Artificial Intelligence 90(1–2), 225–279 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cobo, M.L., Martinez, D.C., Simari, G.R. (2012). Stable Extensions in Timed Argumentation Frameworks. In: Modgil, S., Oren, N., Toni, F. (eds) Theorie and Applications of Formal Argumentation. TAFA 2011. Lecture Notes in Computer Science(), vol 7132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29184-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-29184-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29183-8
Online ISBN: 978-3-642-29184-5
eBook Packages: Computer ScienceComputer Science (R0)