{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:43:17Z","timestamp":1762101797180,"version":"3.41.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,12,18]],"date-time":"2015-12-18T00:00:00Z","timestamp":1450396800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council (BE)","doi-asserted-by":"publisher","award":["291528"],"award-info":[{"award-number":["291528"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Synthese"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11229-015-0991-y","type":"journal-article","created":{"date-parts":[[2015,12,18]],"date-time":"2015-12-18T10:00:44Z","timestamp":1450432844000},"page":"781-811","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partial-order Boolean games: informational independence in a logic-based model of strategic interaction"],"prefix":"10.1007","volume":"193","author":[{"given":"Julian","family":"Bradfield","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Gutierrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Wooldridge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,18]]},"reference":[{"issue":"4","key":"991_CR1","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1017\/S0960129503003980","volume":"13","author":"S Abramsky","year":"2003","unstructured":"Abramsky, S. (2003). Sequentiality vs. concurrency in games and logic. Mathematical Structures in Computer Science, 13(4), 531\u2013565.","journal-title":"Mathematical Structures in Computer Science"},{"key":"991_CR2","unstructured":"Abramsky, S. (2006). Socially responsive, environmentally friendly logic. Acta Philosophica Fennica 78. Truth and Games: Essays in Honour of Gabriel Sandu"},{"key":"991_CR3","doi-asserted-by":"crossref","unstructured":"Abramsky, S., & Melli\u00e8s, P.A. (1999). Concurrent games and full completeness. In LICS (pp. 431\u2013442). IEEE Computer Society","DOI":"10.1109\/LICS.1999.782638"},{"key":"991_CR4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.tcs.2013.12.020","volume":"523","author":"V Balabanov","year":"2014","unstructured":"Balabanov, V., Chiang, H. J., & Jiang, J. H. (2014). Henkin quantifers and Boolean formulae: A certification perspective of DQBF. Theoretical Computer Science, 523, 86\u2013100.","journal-title":"Theoretical Computer Science"},{"key":"991_CR5","unstructured":"Bonzon, E., Lagasquie, M., Lang, J., & Zanuttini, B. (2006) Boolean games revisited. In ECAI"},{"issue":"6","key":"991_CR6","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1016\/j.ijar.2009.02.008","volume":"50","author":"E Bonzon","year":"2009","unstructured":"Bonzon, E., Lagasquie-Schiex, M. C., & Lang, J. (2009). Dependencies between players in Boolean games. International Journal of Approximate Reasoning, 50(6), 899\u2013914.","journal-title":"International Journal of Approximate Reasoning"},{"key":"991_CR7","first-page":"757","volume-title":"Handbook of theoretical computer science volume A: Algorithms and complexity","author":"RB Boppana","year":"1990","unstructured":"Boppana, R. B., & Sipser, M. (1990). The complexity of finite functions. In A. V. Aho & M. J. Corasick (Eds.), Handbook of theoretical computer science volume A: Algorithms and complexity (pp. 757\u2013804). Amsterdam: Elsevier Science Publishers B.V."},{"key":"991_CR8","first-page":"47","volume":"78","author":"JC Bradfield","year":"2006","unstructured":"Bradfield, J. C. (2006). Independence: Logics and concurrency. Acta Philosophica Fennica, 78, 47\u201370. Truth and Games: Essays in Honour of Gabriel Sandu.","journal-title":"Acta Philosophica Fennica"},{"key":"991_CR9","doi-asserted-by":"crossref","unstructured":"Clairambault, P., Gutierrez, J., & Winskel, G. (2012). The winning ways of concurrent games. In LICS (pp. 235\u2013244) IEEE Computer Society","DOI":"10.1109\/LICS.2012.34"},{"key":"991_CR10","doi-asserted-by":"crossref","unstructured":"Clairambault, P., Gutierrez, J., & Winskel, G. (2013) Imperfect information in logic and concurrent games. In Computation, Logic, Games, and Quantum Foundations, LNCS, vol. 7860, (pp. 7\u201320). Springer","DOI":"10.1007\/978-3-642-38164-5_2"},{"issue":"3","key":"991_CR11","first-page":"119","volume":"28","author":"S Cook","year":"1999","unstructured":"Cook, S., & Soltys, M. (1999). Boolean programs and quantified propositional proof systems. Bulletin of the Section of Logic, 28(3), 119\u2013129.","journal-title":"Bulletin of the Section of Logic"},{"key":"991_CR12","unstructured":"Dunne, P.E., Kraus, S., van der Hoek, W., & Wooldridge, M. (2008) Cooperative Boolean games. In AAMAS"},{"key":"991_CR13","first-page":"996","volume-title":"Handbook of theoretical computer science volume B: Formal models and semantics","author":"EA Emerson","year":"1990","unstructured":"Emerson, E. A. (1990). Temporal and modal logic. In J. van Leeuwen (Ed.), Handbook of theoretical computer science volume B: Formal models and semantics (pp. 996\u20131072). Amsterdam, The Netherlands: Elsevier Science Publishers B.V."},{"key":"991_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about knowledge","author":"R Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. Y. (1995). Reasoning about knowledge. Cambridge, MA: The MIT Press."},{"key":"991_CR15","volume-title":"Automated planning: Theory and practice","author":"M Ghallab","year":"2004","unstructured":"Ghallab, M., Nau, D., & Traverso, P. (2004). Automated planning: Theory and practice. San Mateo, CA: Morgan Kaufmann Publishers."},{"key":"991_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-order methods for the verification of concurrent systems","author":"P Godefroid","year":"1996","unstructured":"Godefroid, P. (1996). Partial-order methods for the verification of concurrent systems., Lecture Notes in Computer Science New York: Springer."},{"key":"991_CR17","unstructured":"Grant, J., Kraus, S., Wooldridge, M., Zuckerman, I. (2011) Manipulating Boolean games through communication. In IJCAI"},{"key":"991_CR18","doi-asserted-by":"crossref","unstructured":"Gutierrez, J. (2011). Concurrent logic games on partial orders. In WoLLIC, LNCS, vol. 6642, (pp. 146\u2013160). Springer","DOI":"10.1007\/978-3-642-20920-8_17"},{"key":"991_CR19","doi-asserted-by":"crossref","unstructured":"Gutierrez, J., & Wooldridge, M. (2014). Equilibria of concurrent games on event structures. In LNCS, ACM Press","DOI":"10.1145\/2603088.2603145"},{"key":"991_CR20","unstructured":"Harrenstein, P., van der Hoek, W., Meyer, J.J., & Witteveen, C. (2001) Boolean games. In TARK, (pp. 287\u2013298)"},{"key":"991_CR21","doi-asserted-by":"crossref","DOI":"10.1201\/b10581","volume-title":"Games, puzzles, & computation","author":"RA Hearn","year":"2009","unstructured":"Hearn, R. A., & Demaine, E. D. (2009). Games, puzzles, & computation. Wellesley, MA: A. K. Peters Ltd."},{"issue":"1","key":"991_CR22","first-page":"167","volume":"30","author":"L Henkin","year":"1961","unstructured":"Henkin, L. (1961). Some remarks on infinitely long formulas. Journal of Symbolic Logic, 30(1), 167\u2013183.","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"991_CR23","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0890-5401(03)00064-6","volume":"184","author":"M Jurdzi\u0144ski","year":"2003","unstructured":"Jurdzi\u0144ski, M., Nielsen, M., & Srba, J. (2003). Undecidability of domino games and hhp-bisimilarity. Information and Computation, 184(2), 343\u2013368.","journal-title":"Information and Computation"},{"issue":"1","key":"991_CR24","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0899-8256(02)00544-4","volume":"45","author":"D Koller","year":"2003","unstructured":"Koller, D., & Milch, B. (2003). Multi-agent influence diagrams for representing and solving games. Games and Economic Behavior, 45(1), 181\u2013221.","journal-title":"Games and Economic Behavior"},{"key":"991_CR25","series-title":"LMS Lecture Note Series","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511981418","volume-title":"IIndependence-friendly logic. A game-theoretic approach","author":"AL Mann","year":"2011","unstructured":"Mann, A. L., Sandu, G., & Sevenster, M. (2011). IIndependence-friendly logic. A game-theoretic approach., LMS Lecture Note Series Cambridge: Cambridge University Press."},{"key":"991_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The temporal logic of reactive and concurrent systems","author":"Z Manna","year":"1992","unstructured":"Manna, Z., & Pnueli, A. (1992). The temporal logic of reactive and concurrent systems. Berlin: Springer."},{"key":"991_CR27","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Monien, B., & Wagner, K.W. (2007). Weighted Boolean formula games. In WINE (pp. 469\u2013481)","DOI":"10.1007\/978-3-540-77105-0_51"},{"key":"991_CR28","series-title":"CONCUR, LNCS","first-page":"395","volume-title":"Asynchronous games: Innocence without alternation","author":"PA Melli\u00e8s","year":"2007","unstructured":"Melli\u00e8s, P. A., & Mimram, S. (2007). Asynchronous games: Innocence without alternation (pp. 395\u2013411)., CONCUR, LNCS Heidelberg: Springer."},{"key":"991_CR29","unstructured":"Nielsen, M., & Winskel, G. (1995). Models for concurrency. In Handbook of logic in computer science. Oxford University Press: Oxford, England"},{"key":"991_CR30","volume-title":"A course in game theory","author":"MJ Osborne","year":"1994","unstructured":"Osborne, M. J., & Rubinstein, A. (1994). A course in game theory. Cambridge, MA: The MIT Press."},{"key":"991_CR31","unstructured":"Pauly, M. (2001). Logic for social software. Ph.D. thesis, University of Amsterdam"},{"key":"991_CR32","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/S0898-1221(00)00333-3","volume":"41","author":"GL Peterson","year":"2001","unstructured":"Peterson, G. L., Reif, J. H., & Azhar, S. (2001). Lower bounds for multiplayer noncooperative games of incomplete information. Computers and Mathematics with Applications, 41, 957\u2013992.","journal-title":"Computers and Mathematics with Applications"},{"key":"991_CR33","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A., Rinard, M.C., & Panangaden, P. (1991) Semantic foundations of concurrent constraint programming. In POPL (pp. 333\u2013352). ACM Press","DOI":"10.1145\/99583.99627"},{"issue":"4\u20136","key":"991_CR34","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1007\/s00165-012-0235-6","volume":"24","author":"G Winskel","year":"2012","unstructured":"Winskel, G. (2012). Deterministic concurrent strategies. Formal Aspects of Computing, 24(4\u20136), 647\u2013660.","journal-title":"Formal Aspects of Computing"},{"key":"991_CR35","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/j.artint.2012.11.003","volume":"195","author":"M Wooldridge","year":"2013","unstructured":"Wooldridge, M., Endriss, U., Kraus, S., & Lang, J. (2013). Incentive engineering for Boolean games. Artificial Intelligence, 195, 418\u2013439.","journal-title":"Artificial Intelligence"}],"container-title":["Synthese"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11229-015-0991-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11229-015-0991-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11229-015-0991-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T21:19:22Z","timestamp":1748726362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11229-015-0991-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,18]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["991"],"URL":"https:\/\/doi.org\/10.1007\/s11229-015-0991-y","relation":{},"ISSN":["0039-7857","1573-0964"],"issn-type":[{"type":"print","value":"0039-7857"},{"type":"electronic","value":"1573-0964"}],"subject":[],"published":{"date-parts":[[2015,12,18]]}}}