{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:43:06Z","timestamp":1725900186064},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118180"},{"type":"electronic","value":"9783642118197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11819-7_8","type":"book-chapter","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T08:04:34Z","timestamp":1281945874000},"page":"97-109","source":"Crossref","is-referenced-by-count":0,"title":["Goal-Based Game Tree Search for Complex Domains"],"prefix":"10.1007","author":[{"given":"Viliam","family":"Lis\u00fd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Branislav","family":"Bo\u0161ansk\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Jakob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"P\u011bchou\u010dek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Luckhardt, C., Irani, K.B.: An algorithmic solution of n-person games. In: Proc. of the National Conference on Artificial Intelligence (AAAI 1986), Philadelphia, Pa, August 1986, pp. 158\u2013162 (1986)"},{"issue":"11","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/34.42858","volume":"11","author":"J. Schaeffer","year":"1989","unstructured":"Schaeffer, J.: The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a011(11), 1203\u20131212 (1989)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Sailer, F., Buro, M., Lanctot, M.: Adversarial planning through strategy simulation. In: IEEE Symposium on Computational Intelligence and Games (CIG), Honolulu, pp. 80\u201387 (2007)","DOI":"10.1109\/CIG.2007.368082"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Kovarsky, A., Buro, M.: Heuristic search applied to abstract combat games. In: Canadian Conference on AI, pp. 66\u201378 (2005)","DOI":"10.1007\/11424918_9"},{"key":"8_CR5","unstructured":"van Riemsdijk, M.B., Dastani, M., Winikoff, M.: Goals in agent systems: A unifying framework. In: Padgham, Parkes, M\u00fcller, Parsons (eds.) Proc. of 7th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2008), Estoril, Portugal, May 2008, pp. 713\u2013720 (2008)"},{"key":"8_CR6","unstructured":"Carmel, D., Markovitch, S.: Learning and using opponent models in adversary search. Technical Report CIS9609, Technion (1996)"},{"key":"8_CR7","unstructured":"Semsch, E., Lis\u00fd, V., Bo\u0161ansk\u00fd, B., Jakob, M., Pavl\u00ed\u010dek, D., Doubek, J., Pechoucek, M.: Adversarial behavior testbed. Technical Report GLR 90\/09, CTU, FEE, Gerstner Lab (2009), \n                    \n                      http:\/\/agents.felk.cvut.cz\/publications"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11674399_2","volume-title":"Computers and Games","author":"D. Billings","year":"2006","unstructured":"Billings, D., Davidson, A., Schauenberg, T., Burch, N., Bowling, M., Holte, R.C., Schaeffer, J., Szafron, D.: Game-tree search with adaptation in stochastic imperfect-information games. In: van den Herik, H.J., Bj\u00f6rnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol.\u00a03846, pp. 21\u201334. Springer, Heidelberg (2006)"},{"issue":"2","key":"8_CR9","first-page":"93","volume":"19","author":"S.J.J. Smith","year":"1998","unstructured":"Smith, S.J.J., Nau, D.S., Throop, T.A.: Computer bridge - a big win for AI planning. AI Magazine\u00a019(2), 93\u2013106 (1998)","journal-title":"AI Magazine"},{"issue":"1-2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(00)00076-1","volume":"252","author":"S. Willmott","year":"2001","unstructured":"Willmott, S., Richardson, J., Bundy, A., Levine, J.: Applying adversarial planning techniques to Go. Theoretical Computer Science\u00a0252(1-2), 45\u201382 (2001)","journal-title":"Theoretical Computer Science"},{"key":"8_CR11","unstructured":"Mock, K.J.: Hierarchical heuristic search techniques for empire-based games. In: ICAI, pp. 643\u2013648 (2002)"},{"key":"8_CR12","first-page":"251","volume-title":"3.3. Strategies in Large Scale Problems. In: Adversarial Reasoning: Computational Approaches to Reading the Opponent\u2019s Mind","author":"B. Stilman","year":"2007","unstructured":"Stilman, B., Yakhnis, V., Umanskiy, O.: 3.3. Strategies in Large Scale Problems. In: Adversarial Reasoning: Computational Approaches to Reading the Opponent\u2019s Mind, pp. 251\u2013285. Chapman & Hall\/CRC, Boca Raton (2007)"}],"container-title":["Communications in Computer and Information Science","Agents and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11819-7_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:44:30Z","timestamp":1606167870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11819-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118180","9783642118197"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11819-7_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}