Abstract
Recently, Governatori et al. (2014) formulated a notion of strategic argumentation in the context of a dialogue game with incomplete knowledge, where arguments are constructed in a defeasible logic. Such a framework reflects aspects of the practice of legal argumentation. They show that a certain element of reasoning within strategic argumentation is NP-complete. In this paper we establish several related complexity results. To begin with, we present a much simpler proof of this result. Then the result is extended to allow the players the flexibility to have a wider variety of aims, and to address reasoning in a broad range of defeasible logics. Finally, we introduce some computational problems arising from violation of the privacy of a player in a strategic argumentation game, and establish their complexity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: On the modelling and analysis of regulations. In: Proc. Australasian Conf. on Information Systems, pp. 20–29 (1999)
Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: A flexible framework for defeasible logics. In: AAAI/IAAI, pp. 405–410. AAAI Press/The MIT Press (2000)
Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Representation results for defeasible logic. ACM Trans. Comput. Log. 2(2), 255–287 (2001)
Bartholdi, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Social Choice and Welfare 6(3), 227–241 (1989)
Billington, D., Antoniou, G., Governatori, G., Maher, M.J.: An inclusion theorem for defeasible logics. ACM Trans. Comput. Log. 12(1), 6 (2010)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–358 (1995)
Gordon, T.F.: The Pleadings Game. Artif. Intell. Law 2(4), 239–292 (1993)
Governatori, G., Olivieri, F., Scannapieco, S., Rotolo, A., Cristani, M.: Strategic argumentation is NP-complete. In: Proc. European Conf. on Artificial Intelligence. pp. 399–404 (2014)
Governatori, G., Rotolo, A.: BIO logical agents: Norms, beliefs, intentions in defeasible logic. J. Autonomous Agents and Multi Agent Systems 17(1), 36–69 (2008)
Jakobovits, H., Vermeir, D.: Dialectic semantics for argumentation frameworks. In: ICAIL, pp. 53–62 (1999)
Maher, M.J.: Relative expressiveness of defeasible logics. TPLP 12(4-5), 793–810 (2012)
Maher, M.J.: Relative expressiveness of defeasible logics II. TPLP 13(4-5), 579–592 (2013)
Maher, M.J.: Relative expressiveness of well-founded defeasible logics. In: Proc. Australasian Joint Conf. on Artificial Intelligence, pp. 338–349 (2013)
Maher, M.J.: Comparing defeasible logics. In: Proc. European Conf. on Artificial Intelligence, pp. 585–590 (2014)
Maher, M.J., Governatori, G.: A semantic decomposition of defeasible logics. In: AAAI/IAAI, pp. 299–305. AAAI Press (1999)
Maier, F., Nute, D.: Well-founded semantics for defeasible logic. Synthese 176(2), 243–274 (2010)
Nute, D.: Defeasible logic. In: Bartenstein, O., Geske, U., Hannebauer, M., Yoshie, O. (eds.) INAP 2001. LNCS (LNAI), vol. 2543, pp. 151–169. Springer, Heidelberg (2003)
Prakken, H.: Coherence and flexibility in dialogue games for argumentation. J. Log. Comput. 15(6), 1009–1040 (2005)
Prakken, H., Sartor, G.: Modelling reasoning with precedents in a formal dialogue game. Artif. Intell. Law 6(2-4), 231–287 (1998)
Rahwan, I., Larson, K., Tohmé, F.A.: A characterisation of strategy-proofness for grounded argumentation semantics. In: Boutilier, C. (ed.) IJCAI, pp. 251–256 (2009)
Satoh, K., Takahashi, K.: A semantics of argumentation under incomplete information. In: JURISIN, pp. 86–97 (2011)
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
Maher, M.J. (2014). Complexity of Exploiting Privacy Violations in Strategic Argumentation. In: Pham, DN., Park, SB. (eds) PRICAI 2014: Trends in Artificial Intelligence. PRICAI 2014. Lecture Notes in Computer Science(), vol 8862. Springer, Cham. https://doi.org/10.1007/978-3-319-13560-1_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-13560-1_42
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13559-5
Online ISBN: 978-3-319-13560-1
eBook Packages: Computer ScienceComputer Science (R0)