{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:20:34Z","timestamp":1725538834224},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642053009"},{"type":"electronic","value":"9783642053016"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05301-6_3","type":"book-chapter","created":{"date-parts":[[2009,10,13]],"date-time":"2009-10-13T07:41:56Z","timestamp":1255419716000},"page":"32-50","source":"Crossref","is-referenced-by-count":1,"title":["Modal Logics for Preferences and Cooperation: Expressivity and Complexity"],"prefix":"10.1007","author":[{"given":"C\u00e9dric","family":"D\u00e9gremont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lena","family":"Kurzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/12.1.149","volume":"12","author":"M. Pauly","year":"2002","unstructured":"Pauly, M.: A modal logic for coalitional power in games. JLC\u00a012(1), 149\u2013166 (2002)","journal-title":"JLC"},{"key":"3_CR2","unstructured":"Broersen, J., Herzig, A., Troquard, N.: Normal Coalition Logic and its conformant extension. In: Samet, D. (ed.) TARK 2007, PUL, pp. 91\u2013101 (2007)"},{"key":"3_CR3","unstructured":"Girard, P.: Modal Logic for Preference Change. PhD thesis, Stanford (2008)"},{"key":"3_CR4","unstructured":"Kurzen, L.: Logics for Cooperation, Actions and Preferences. Master\u2019s thesis, Universiteit van Amsterdam, The Netherlands (2007)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"\u00c5gotnes, T., Dunne, P.E., van der Hoek, W., Wooldridge, M.: Logics for coalitional games. In: LORI 2007, Beijing, China (2007) (to appear)","DOI":"10.1145\/1160633.1160659"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. In: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, Florida (October 1997)","DOI":"10.1109\/SFCS.1997.646098"},{"key":"3_CR7","first-page":"259","volume-title":"TARK 2001","author":"V. Goranko","year":"2001","unstructured":"Goranko, V.: Coalition games and alternating temporal logics. In: TARK 2001, pp. 259\u2013272. Morgan Kaufmann, San Francisco (2001)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73859-6_19","volume-title":"Algebra and Coalgebra in Computer Science","author":"H.H. Hansen","year":"2007","unstructured":"Hansen, H.H., Kupke, C., Pacuit, E.: Bisimulation for neighbourhood structures. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 279\u2013293. Springer, Heidelberg (2007)"},{"key":"3_CR9","unstructured":"de Jongh, D., Liu, F.: Optimality, belief and preference. In: Artemov, S., Parikh, R. (eds.) Proc. of the Workshop on Rationality and Knowledge, ESSLLI (2006)"},{"key":"3_CR10","volume-title":"A course in game theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A course in game theory. MIT Press, Cambridge (1994)"},{"key":"3_CR11","unstructured":"Cate, B.: Model theory for extended modal languages. PhD thesis, University of Amsterdam, ILLC Dissertation Series DS-2005-01 (2005)"},{"key":"3_CR12","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol.\u00a053. Cambridge University Press, UK (2001)"},{"key":"3_CR13","volume-title":"Modal Logic and Classical Logic","author":"J. Benthem van","year":"1983","unstructured":"van Benthem, J.: Modal Logic and Classical Logic. Bibliopolis, Napoli (1983)"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"977","DOI":"10.2307\/2695090","volume":"66","author":"C. Areces","year":"2001","unstructured":"Areces, C., Blackburn, P., Marx, M.: Hybrid logics: characterization, interpolation and complexity. The Journal of Symbolic Logic\u00a066(3), 977\u20131010 (2001)","journal-title":"The Journal of Symbolic Logic"},{"key":"3_CR15","first-page":"29","volume":"20","author":"S. Feferman","year":"1969","unstructured":"Feferman, S.: Persistent and invariant formulas for outer extensions. Compositio Mathematica\u00a020, 29\u201352 (1969)","journal-title":"Compositio Mathematica"},{"key":"3_CR16","series-title":"LNM","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BFb0062855","volume-title":"Algebra and Logic: Papers 14th Summer Research Inst. of the Australian Math. Soc.","author":"R.I. Goldblatt","year":"1975","unstructured":"Goldblatt, R.I., Thomason, S.K.: Axiomatic classes in propositional modal logic. In: Crossley, J.N. (ed.) Algebra and Logic: Papers 14th Summer Research Inst. of the Australian Math. Soc. LNM, vol.\u00a0450, pp. 163\u2013173. Springer, Berlin (1975)"},{"key":"3_CR17","unstructured":"D\u00e9gremont, C., Kurzen, L.: Modal logics for preferences and cooperation: Expressivity and complexity. ILLC PP-2008-39, University of Amsterdam (2008), http:\/\/staff.science.uva.nl\/~cdegremo\/"},{"key":"3_CR18","volume-title":"Computational complexity","author":"C.M. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.M.: Computational complexity. Addison-Wesley, MA (1994)"},{"key":"3_CR19","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0(125). North-Holland, Amsterdam (1989)"},{"key":"3_CR20","first-page":"51","volume-title":"Topics in the theory of computation","author":"D. Harel","year":"1985","unstructured":"Harel, D.: Recurring dominoes: making the highly undecidable highly understandable. In: Topics in the theory of computation, New York, NY, USA, pp. 51\u201371. Elsevier, Amsterdam (1985)"},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R.E. Ladner","year":"1977","unstructured":"Ladner, R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput.\u00a06(3), 467\u2013480 (1977)","journal-title":"SIAM J. Comput."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. (1979)","DOI":"10.1016\/0022-0000(79)90046-1"},{"issue":"3","key":"3_CR23","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"J.Y. Halpern","year":"1992","unstructured":"Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence\u00a054(3), 319\u2013379 (1992)","journal-title":"Artificial Intelligence"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11538363_24","volume-title":"Computer Science Logic","author":"B. Cate ten","year":"2005","unstructured":"ten Cate, B., Franceschet, M.: On the complexity of hybrid logics with binders. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 339\u2013354. Springer, Heidelberg (2005)"},{"key":"3_CR25","unstructured":"Franceschet, M., de Rijke, M.: Model checking for hybrid logics. In: Proceedings of the Workshop Methods for Modalities (2003)"},{"key":"3_CR26","volume-title":"Perspectives in Mathematical Logic","author":"Y. Gurevich","year":"1997","unstructured":"Gurevich, Y.: The classical decision problem. In: Perspectives in Mathematical Logic. Springer, Heidelberg (1997)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Lutz, C., Sattler, U.: The complexity of reasoning with boolean modal logics. In: Wolter, W., de Rijke, Z. (eds.) AiML, WS, pp. 329\u2013348 (2000)","DOI":"10.1142\/9789812776471_0018"},{"issue":"1","key":"3_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jal.2005.08.002","volume":"4","author":"M. Lange","year":"2006","unstructured":"Lange, M.: Model checking pdl with all extras. J. Applied Logic\u00a04(1), 39\u201349 (2006)","journal-title":"J. Applied Logic"},{"issue":"3","key":"3_CR29","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.jal.2005.06.010","volume":"4","author":"M. Franceschet","year":"2006","unstructured":"Franceschet, M., de Rijke, M.: Model checking hybrid logics (with an application to semistructured data). J. Applied Logic\u00a04(3), 279\u2013304 (2006)","journal-title":"J. Applied Logic"},{"key":"3_CR30","unstructured":"Donini, F.M., Lenzerini, M., Nardi, D., Nutt, W.: The complexity of concept languages. In: KR, pp. 151\u2013162 (1991)"},{"key":"3_CR31","unstructured":"Spaan, E.: Complexity of modal logics. PhD thesis, ILLC Amsterdam (1993)"},{"issue":"2","key":"3_CR32","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1305\/ndjfl\/1040046086","volume":"37","author":"E. Hemaspaandra","year":"1996","unstructured":"Hemaspaandra, E.: The price of universality. NDJFL\u00a037(2), 174\u2013203 (1996)","journal-title":"NDJFL"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-48168-0_22","volume-title":"Computer Science Logic","author":"C. Areces","year":"1999","unstructured":"Areces, C., Blackburn, P., Marx, M.: A road-map on complexity for hybrid logics. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 307\u2013321. Springer, Heidelberg (1999)"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/800070.802186","volume-title":"STOC 1982: Proceedings of the fourteenth annual ACM symposium on Theory of computing","author":"M.Y. Vardi","year":"1982","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: STOC 1982: Proceedings of the fourteenth annual ACM symposium on Theory of computing, pp. 137\u2013146. ACM, New York (1982)"},{"key":"3_CR35","first-page":"1181","volume-title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007)","author":"T. \u00c5gotnes","year":"2007","unstructured":"\u00c5gotnes, T., van der Hoek, W., Wooldridge, M.: Quantified coalition logic. In: Veloso, M.M. (ed.) Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), California, pp. 1181\u20131186. AAAI Press, Menlo Park (2007)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Representation for Agents and Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05301-6_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:50:44Z","timestamp":1606168244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05301-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642053009","9783642053016"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05301-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}