{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:59:56Z","timestamp":1725533996908},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027369"},{"type":"electronic","value":"9783642027376"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02737-6_27","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T08:40:30Z","timestamp":1246351230000},"page":"334-347","source":"Crossref","is-referenced-by-count":1,"title":["A Game-Theoretic Characterization of Boolean Grammars"],"prefix":"10.1007","author":[{"given":"Vassilis","family":"Kountouriotis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Nomikos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Rondogiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2\u20133","key":"27_CR1","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.apal.2007.10.004","volume":"151","author":"C. Galanaki","year":"2008","unstructured":"Galanaki, C., Rondogiannis, P., Wadge, W.: An Infinite-Game Semantics for Well-Founded Negation in Logic Programming. Annals of Pure and Applied Logic\u00a0151(2\u20133), 70\u201388 (2008)","journal-title":"Annals of Pure and Applied Logic"},{"key":"27_CR2","first-page":"245","volume":"28","author":"D. Gale","year":"1953","unstructured":"Gale, D., Stewart, F.M.: Infinite Games with Perfect Information. Annals of Mathematical Studies\u00a028, 245\u2013266 (1953)","journal-title":"Annals of Mathematical Studies"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/11779148_19","volume-title":"Developments in Language Theory","author":"V. Kountouriotis","year":"2006","unstructured":"Kountouriotis, V., Nomikos, C., Rondogiannis, P.: Well-founded semantics for boolean grammars. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 203\u2013214. Springer, Heidelberg (2006)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Martin, D.A.: Borel Determinacy. Annals of Mathematics 102, 363\u2013371 (1975)","DOI":"10.2307\/1971035"},{"key":"27_CR5","volume-title":"Descriptive Set Theory","author":"Y.N. Moschovakis","year":"1980","unstructured":"Moschovakis, Y.N.: Descriptive Set Theory. North-Holland, Amsterdam (1980)"},{"issue":"9-10","key":"27_CR6","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/j.ic.2008.03.022","volume":"206","author":"C. Nomikos","year":"2008","unstructured":"Nomikos, C., Rondogiannis, P.: Locally Stratified Boolean Grammars. Information and Computation\u00a0206(9-10), 1219\u20131233 (2008)","journal-title":"Information and Computation"},{"issue":"4","key":"27_CR7","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive Grammars. Journal of Automata, Languages and Combinatorics\u00a06(4), 519\u2013535 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ic.2004.03.006","volume":"194","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: Boolean Grammars. Information and Computation\u00a0194(1), 19\u201348 (2004)","journal-title":"Information and Computation"},{"key":"27_CR9","unstructured":"Okhotin, A.: Nine open problems on conjunctive and Boolean grammars. TUCS Technical Report No 794, Turku Centre for Computer Science, Turku, Finland (November 2006)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-74510-5_19","volume-title":"Computer Science \u2013 Theory and Applications","author":"A. Je\u017c","year":"2007","unstructured":"Je\u017c, A., Okhotin, A.: Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol.\u00a04649, pp. 168\u2013181. Springer, Heidelberg (2007)"},{"key":"27_CR11","first-page":"321","volume-title":"Formal Techniques in Artificial Intelligence: a Source-Book","author":"H. Przymusinska","year":"1990","unstructured":"Przymusinska, H., Przymusinski, T.: Semantic Issues in Deductive Databases and Logic Programs. In: Banerji, R. (ed.) Formal Techniques in Artificial Intelligence: a Source-Book, pp. 321\u2013367. North-Holland, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02737-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:25:12Z","timestamp":1558398312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02737-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027369","9783642027376"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02737-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}