{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:32:12Z","timestamp":1743136332469,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540236108"},{"type":"electronic","value":"9783540304760"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30476-0_43","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T17:51:35Z","timestamp":1294854695000},"page":"491-494","source":"Crossref","is-referenced-by-count":0,"title":["Solving Box-Pushing Games via Model Checking with Optimizations"],"prefix":"10.1007","author":[{"given":"Gihwon","family":"Kwon","sequence":"first","affiliation":[]},{"given":"Taehoon","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-45657-0_29","volume-title":"Computer Aided Verification","author":"A. Cimatti","year":"2002","unstructured":"Cimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: An openSource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, p. 359. Springer, Heidelberg (2002)"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Junghanns, A., Schaeffer, J.: Sokoban: Evaluating single search agent search techniques in the presence of deadlock. In: Proceedings of CSCSI 1998 (1998)","DOI":"10.1007\/3-540-64575-6_36"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BFb0095430","volume-title":"KI-98: Advances in Artificial Intelligence","author":"S. Edelkamp","year":"1998","unstructured":"Edelkamp, S., Reffel, F.: OBDDs in Heuristic Search. In: Herzog, O. (ed.) KI 1998. LNCS, vol.\u00a01504, pp. 81\u201392. Springer, Heidelberg (1998)"},{"key":"43_CR5","unstructured":"Junghanns, A., Schaeffer, J.: Sokoban: A Challenging Single-Agent Search Problem. Games in AI Research (1999)"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Informatics","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Progress on the State Explosion Problem in Model Checking. In: Wilhelm, R. (ed.) Informatics: 10 Years Back, 10 Years Ahead. LNCS, vol.\u00a02000, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"43_CR7","unstructured":"Lu, Y.: Automatic Abstraction in Model Checking. Ph.D. thesis, Carnegie Mellon University, Department of Electrical and Computer Engineering (2000)"},{"key":"43_CR8","unstructured":"Kwon, G.: Abstraction of Models with State Projections in Model Checking. Journal of Korea Information Processing Society (December 2004) (to be published)"},{"key":"43_CR9","unstructured":"Lee, T., Kwon, G.: Relay Model checking for Avoiding The State Explosion Problem. In: Proceedings of SERA 2004, pp. 305\u2013310 (2004)"},{"key":"43_CR10","unstructured":"Kwon, G.: Efficient Counterexample Generations for Solving Reachability Games.In: Proceedings of SERA 2004, pp. 8\u201313 (2004)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30476-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T01:15:09Z","timestamp":1676078109000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30476-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540236108","9783540304760"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30476-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}