{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:02:36Z","timestamp":1742940156291,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319394015"},{"type":"electronic","value":"9783319394022"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39402-2_12","type":"book-chapter","created":{"date-parts":[[2016,5,11]],"date-time":"2016-05-11T12:54:04Z","timestamp":1462971244000},"page":"165-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Space-Consistent Game Equivalence Detection in General Game Playing"],"prefix":"10.1007","author":[{"given":"Haifeng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Dangyi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Wenxin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,12]]},"reference":[{"key":"12_CR1","unstructured":"Een, N., S\u00f6rensson, N.: MiniSat: a SAT solver with conflict-clause minimization. SAT 5 (2005)"},{"issue":"2","key":"12_CR2","first-page":"62","volume":"26","author":"M Genesereth","year":"2005","unstructured":"Genesereth, M., Love, N., Pell, B.: General game playing: overview of the AAAI competition. AI Mag. 26(2), 62\u201372 (2005)","journal-title":"AI Mag."},{"key":"12_CR3","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. Springer, New York (1972)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-74958-5_20","volume-title":"Machine Learning: ECML 2007","author":"G Kuhlmann","year":"2007","unstructured":"Kuhlmann, G., Stone, P.: Graph-based domain mapping for transfer learning in general games. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) ECML 2007. LNCS (LNAI), vol. 4701, pp. 188\u2013200. Springer, Heidelberg (2007)"},{"key":"12_CR5","unstructured":"Love, N., Hinrichs, T., Haley, D., Schkufza, E., Genesereth, M.: General game playing: game description language specification (2008)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"key":"12_CR7","unstructured":"Pell, B.: Strategy generation and evaluation for meta-game playing. Ph.D. thesis, University of Cambridge (1993)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Schiffel, S.: Symmetry detection in general game playing. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7649"},{"key":"12_CR9","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-11819-7_4","volume-title":"Agents and Artificial Intelligence","author":"S Schiffel","year":"2010","unstructured":"Schiffel, S., Thielscher, M.: A multiagent semantics for the game description language. In: Filipe, J., Fred, A., Sharp, B. (eds.) ICAART 2009. CCIS, vol. 67, pp. 44\u201355. Springer, Heidelberg (2010)"},{"key":"12_CR10","first-page":"234","volume":"8","author":"GS Tseitin","year":"1968","unstructured":"Tseitin, G.S.: On the complexity of proof in prepositional calculus. Zapiski Nauchnykh Seminarov POMI 8, 234\u2013259 (1968)","journal-title":"Zapiski Nauchnykh Seminarov POMI"}],"container-title":["Communications in Computer and Information Science","Computer Games"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39402-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T05:11:44Z","timestamp":1692335504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39402-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319394015","9783319394022"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39402-2_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"12 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}