Abstract
Petri nets are a mathematical modelling tool suitable for describing dynamic computational systems. In this work we present a formalization of abstract argumentation frameworks using Petri nets, where arguments and attacks are represented as places and transitions. This provides a formalism to study the semantic consequences of a procedural evaluation of argument attacks. The relation between markings of the net and argument extensions is analysed.
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.
Similar content being viewed by others
References
van der Aalst, W.M.P., Stahl, C., Westergaard, M.: Strategies for modeling complex processes using colored petri nets. In: Jensen, K., van der Aalst, W.M.P., Balbo, G., Koutny, M., Wolf, K. (eds.) ToPNoc VII. LNCS, vol. 7480, pp. 6–55. Springer, Heidelberg (2013)
Barringer, H., Gabbay, D.M., Woods, J.: Temporal, numerical and meta-level dynamics in argumentation networks. Argument & Computation 3(2-3), 143–202 (2012)
Brewka, G.: Dynamic argument systems: A formal model of argumentation processes based on situation calculus. J. Log. Comput. 11(2), 257–282 (2001)
Cobo, M.L., Martinez, D.C., Simari, G.R.: Stable extensions in timed argumentation frameworks. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS, vol. 7132, pp. 181–196. Springer, Heidelberg (2012)
Cobo, M.L., Martinez, D.C., Simari, G.R.: An approach to timed abstract argumentation. In: Proc. of Int. Workshop of Non-Monotonic Reasoning 2010 (2010)
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
García, A.J., Simari, G.R.: Defeasible logic programming: An argumentative approach. Theory and Practice of Logic Programming 4(1-2), 95–138 (2004)
Rintanen, J., Thiébaux, S., White, L., Hickmott, S.: Planning via petri net unfolding. In: Proc. of 20th Int. Joint Conference on Artificial Intelligence, pp. 1904–1911. AAAI Press, Menlo Park (2007)
Iordache, M.V., Antsaklis, P.J.: Generalized conditions for liveness enforcement and deadlock prevention in petri nets. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 184–203. Springer, Heidelberg (2001)
Murata, T.: Petri nets: properties, analysis and applications. Proc. of IEEE 77(4) (1989)
Pardo, P., Godo, L.: t-delp: an argumentation-based temporal defeasible logic programming framework. Annals of Mathematics and Artificial Intelligence, 1–33 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Martinez, D.C., Cobo, M.L., Simari, G.R. (2014). A Petri Net Model of Argumentation Dynamics. In: Straccia, U., Calì, A. (eds) Scalable Uncertainty Management. SUM 2014. Lecture Notes in Computer Science(), vol 8720. Springer, Cham. https://doi.org/10.1007/978-3-319-11508-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-11508-5_20
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11507-8
Online ISBN: 978-3-319-11508-5
eBook Packages: Computer ScienceComputer Science (R0)