{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T18:32:17Z","timestamp":1791397937879,"version":"4.3.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642161100","type":"print"},{"value":"9783642161117","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16111-7_29","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T12:57:36Z","timestamp":1283950656000},"page":"255-262","source":"Crossref","is-referenced-by-count":10,"title":["Instantiating General Games Using Prolog or Dependency Graphs"],"prefix":"10.1007","author":[{"given":"Peter","family":"Kissmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. In: IJCAI, pp. 1636\u20131642 (1995)","DOI":"10.21236\/ADA303260"},{"issue":"8","key":"29_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"issue":"1-2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00129-1","volume":"134","author":"M. Campbell","year":"2002","unstructured":"Campbell, M., Hoane Jr., A.J., Hsu, F.-H.: Deep Blue. Artificial Intelligence\u00a0134(1-2), 57\u201383 (2002)","journal-title":"Artificial Intelligence"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/10720246_11","volume-title":"Recent Advances in AI Planning","author":"S. Edelkamp","year":"2000","unstructured":"Edelkamp, S., Helmert, M.: Exhibiting knowledge in planning problems to minimize state encoding length. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS, vol.\u00a01809, pp. 135\u2013147. Springer, Heidelberg (2000)"},{"key":"29_CR5","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: AAAI, pp. 259\u2013264 (2008)"},{"key":"29_CR6","series-title":"LNAI","volume-title":"Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition","author":"M. Helmert","year":"2008","unstructured":"Helmert, M.: Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition. LNCS (LNAI), vol.\u00a04929. Springer, Heidelberg (2008)"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. JAIR\u00a014, 253\u2013302 (2001)","journal-title":"JAIR"},{"key":"29_CR8","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic and stochastic search. In: AAAI, pp. 1194\u20131201 (1996)"},{"key":"29_CR9","unstructured":"Kissmann, P., Edelkamp, S.: Instantiating general games. In: IJCAI-Workshop on General Game Playing, pp. 43\u201350 (2009)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Kissmann, P., Edelkamp, S.: Layer-abstraction for symbolically solving general two-player games. In: SoCS (2010)","DOI":"10.1609\/socs.v1i1.18170"},{"key":"29_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"29_CR12","unstructured":"Kuhlmann, G., Dresner, K., Stone, P.: Automatic heuristic construction in a complete general game player. In: AAAI, pp. 1457\u20131462 (2006)"},{"key":"29_CR13","unstructured":"Love, N.C., Hinrichs, T.L., Genesereth, M.R.: General game playing: Game description language specification. Technical Report LG-2006-01, Stanford Logic Group (April 2006)"},{"key":"29_CR14","unstructured":"M\u00e9hat, J., Cazenave, T.: Ary, a general game playing program. In: 13th Board Game Studies Colloquium (2010)"},{"key":"29_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-76576-1","volume-title":"One Jump Ahead: Computer Perfection at Checkers","author":"J. Schaeffer","year":"2009","unstructured":"Schaeffer, J.: One Jump Ahead: Computer Perfection at Checkers. Springer, Heidelberg (2009)"},{"key":"29_CR16","unstructured":"Schiffel, S., Thielscher, M.: Fluxplayer: A successful general game player. In: AAAI, pp. 1191\u20131196 (2007)"}],"container-title":["Lecture Notes in Computer Science","KI 2010: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16111-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T06:35:11Z","timestamp":1685774111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16111-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161100","9783642161117"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16111-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}