Abstract
The aim of the work is to provide a language to reason about closed-world interaction, that is all those situations in which the outcomes of an interaction can be determined by the agents themselves and in which Nature does not play an active role. We formalize this intuition by identifying all such interactions and axiomatizing their logic. We apply the formal tools to reason about games and their regulation.
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
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science (2001)
Borgo, S.: Coalitions in action logic. In: Proc. of IJCAI, pp. 1822–1827 (2007)
Broersen, J., Mastop, R., Meyer, J.-J.Ch., Turrini, P.: A deontic logic for socially optimal norms (forthcoming, 2008)
Hansen, H.H.: Monotonic Modal Logics. Master Thesis, ILLC (2001)
Parikh, R.: Social software. Synthese 132(3), 187–211 (2002)
Pauly, M.: Logic for Social Software. ILLC Dissertation Series (2001)
von Wright, G.H.: The logic of preference. Edimburgh University Press (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broersen, J., Mastop, R., Meyer, JJ.C., Turrini, P. (2008). A Logic for Closed-World Interaction. In: Hölldobler, S., Lutz, C., Wansing, H. (eds) Logics in Artificial Intelligence. JELIA 2008. Lecture Notes in Computer Science(), vol 5293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87803-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-87803-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87802-5
Online ISBN: 978-3-540-87803-2
eBook Packages: Computer ScienceComputer Science (R0)