{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:36:47Z","timestamp":1736573807306,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540396253"},{"type":"electronic","value":"9783540396277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11853886_13","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T16:40:30Z","timestamp":1158165630000},"page":"138-150","source":"Crossref","is-referenced-by-count":2,"title":["Modal Logics of Negotiation and Preference"],"prefix":"10.1007","author":[{"given":"Ulle","family":"Endriss","sequence":"first","affiliation":[]},{"given":"Eric","family":"Pacuit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Sandholm, T.W.: Contract types for satisficing task allocation: I Theoretical results. In: Proc. AAAI Spring Symposium: Satisficing Models (1998)"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1613\/jair.1870","volume":"25","author":"U. Endriss","year":"2006","unstructured":"Endriss, U., Maudet, N., Sadri, F., Toni, F.: Negotiating socially optimal allocations of resources. Journal of Artificial Intelligence Research\u00a025, 315\u2013348 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1-2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.artint.2005.01.006","volume":"164","author":"P.E. Dunne","year":"2005","unstructured":"Dunne, P.E., Wooldridge, M., Laurence, M.: The complexity of contract negotiation. Artificial Intelligence\u00a0164(1-2), 23\u201346 (2005)","journal-title":"Artificial Intelligence"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/A:1020391420768","volume":"132","author":"R. Parikh","year":"2002","unstructured":"Parikh, R.: Social software. Synthese\u00a0132, 187\u2013211 (2002)","journal-title":"Synthese"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Pacuit, E., Parikh, R.: Social interaction, knowledge, and social software. In: Interactive Computation: The New Paradigm. Springer, Heidelberg (forthcoming)","DOI":"10.1007\/3-540-34874-3_17"},{"key":"13_CR6","unstructured":"Pauly, M., Wooldridge, M.: Logic for mechanism design: A manifesto. In: Proc. 5th Workshop on Game-theoretic and Decision-theoretic Agents (2003)"},{"key":"13_CR7","volume-title":"Modal Logic","author":"P. Blackburn","year":"2002","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)"},{"key":"13_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Boston (2000)"},{"key":"13_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL0521360552","volume-title":"Axioms of Cooperative Decision Making","author":"H. Moulin","year":"1988","unstructured":"Moulin, H.: Axioms of Cooperative Decision Making. Cambridge University Press, Cambridge (1988)"},{"key":"13_CR10","unstructured":"van Benthem, J., van Otterloo, S., Roy, O.: Preference logic, conditionals and solution concepts in games. In: Modality Matters: Twenty-Five Essays in Honour of Krister Segerberg, University of Uppsala (2006)"},{"key":"13_CR11","volume-title":"Handbook of Philosophical Logic","author":"S.O. Hansson","year":"2001","unstructured":"Hansson, S.O.: Preference logic. In: Handbook of Philosophical Logic, 2nd edn. Kluwer Academic Publishers, Dordrecht (2001)","edition":"2"},{"key":"13_CR12","unstructured":"Dunne, P.E., Chevaleyre, Y.: Negotiation can be as hard as planning: Deciding reachability properties of distributed negotiation schemes. Technical Report ULCS-05-009, Department of Computer Science, University of Liverpool (2005)"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jal.2005.08.002","volume":"4","author":"M. Lange","year":"2005","unstructured":"Lange, M.: Model checking propositional dynamic logic with all extras. Journal of Applied Logic\u00a04(1), 39\u201349 (2005)","journal-title":"Journal of Applied Logic"},{"key":"13_CR14","volume-title":"Proc. 4th International Joint Conference on Autonomous Agents and Multiagent Systems","author":"Y. Chevaleyre","year":"2005","unstructured":"Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: Negotiating over small bundles of resources. In: Proc. 4th International Joint Conference on Autonomous Agents and Multiagent Systems. ACM Press, New York (2005)"},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0890-5401(91)90026-X","volume":"93","author":"S. Passy","year":"1991","unstructured":"Passy, S., Tinchev, T.: An essay in combinatory dynamic logic. Information and Computation\u00a093(2), 263\u2013332 (1991)","journal-title":"Information and Computation"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FUN-2001-45302","volume":"45","author":"P. Balbiani","year":"2001","unstructured":"Balbiani, P., Vakarelov, D.: Iteration-free PDL with intersection: A complete axiomatization. Fundamenta Informaticae\u00a045, 1\u201322 (2001)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences\u00a018(2), 194\u2013211 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR18","first-page":"109","volume-title":"Proc. 17th Annual Symposium on Foundations of Computer Science","author":"V.R. Pratt","year":"1976","unstructured":"Pratt, V.R.: Semantical considerations on Floyd-Hoare logic. In: Proc. 17th Annual Symposium on Foundations of Computer Science, pp. 109\u2013121. IEEE, Los Alamitos (1976)"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3166\/jancl.15.189-213","volume":"15","author":"C. Lutz","year":"2005","unstructured":"Lutz, C., Walther, D.: PDL with negation of atomic programs. Journal of Applied Non-Classical Logics\u00a015(2), 189\u2013214 (2005)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"13_CR20","volume-title":"Proc. 5th Workshop on Computation Theory","author":"R. Danecki","year":"1985","unstructured":"Danecki, R.: Non-deterministic propositional dynamic logic with intersection is decidable. In: Proc. 5th Workshop on Computation Theory. Springer, Heidelberg (1985)"},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.2178\/jsl\/1129642115","volume":"70","author":"M. Lange","year":"2005","unstructured":"Lange, M., Lutz, C.: 2-EXPTIME lower bounds for propositional dynamic logics with intersection. Journal of Symbolic Logic\u00a070(4), 1072\u20131086 (2005)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11853886_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T21:08:47Z","timestamp":1736543327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11853886_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540396253","9783540396277"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11853886_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}