{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:26:03Z","timestamp":1725564363197},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205456"},{"type":"electronic","value":"9783540400318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40031-8_7","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:03:50Z","timestamp":1283713430000},"page":"88-107","source":"Crossref","is-referenced-by-count":3,"title":["Proof-Set Search"],"prefix":"10.1007","author":[{"given":"Martin","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Allis, V.: Searching for Solutions in Games and Artificial Intelligence. PhD thesis, University of Limburg, Maastricht (1994)"},{"key":"7_CR2","unstructured":"Schijf, M.: Proof-number search and transpositions. Master\u2019s thesis, University of Leiden (1993)"},{"key":"7_CR3","first-page":"63","volume":"17","author":"M. Schijf","year":"1994","unstructured":"Schijf, M., Allis, V., Uiterwijk, J.: Proof-number search and transpositions. International Computer Chess Association Journal\u00a017, 63\u201374 (1994)","journal-title":"International Computer Chess Association Journal"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-48957-6_3","volume-title":"Computers and Games","author":"D. Breuker","year":"1999","unstructured":"Breuker, D., van den Herik, J., Uiterwijk, J., Allis, V.: A solution to the GHI problem for best-first search. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol.\u00a01558, pp. 25\u201349. Springer, Heidelberg (1999)"},{"key":"7_CR5","volume-title":"Algorithmic Graph Theory","author":"J. McHugh","year":"1990","unstructured":"McHugh, J.: Algorithmic Graph Theory. Prentice-Hall, Englewood Cliffs (1990)"},{"key":"7_CR6","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative Combinatorics","author":"R. Stanley","year":"1997","unstructured":"Stanley, R.: Enumerative Combinatorics. Cambridge Studies in Advanced Mathematics, vol.\u00a01(49). Cambridge University Press, Cambridge (1997)"},{"key":"7_CR7","unstructured":"Kishimoto, A.: Seminar presentation. Electrotechnical Laboratory, Tsukuba, Japan (1999)"},{"key":"7_CR8","unstructured":"Nagai, A.: DF-PN Algorithm for Searching AND\/OR Trees and Its Applications. PhD thesis, University of Tokyo (2001)"},{"key":"7_CR9","unstructured":"Breuker, D., Uiterwijk, J., van den Herik, J.: The PN2-search algorithm. In: van den Herik, J., Monien, B. (eds.) Advances in Computer Games 9, Universiteit Maastricht, pp. 115\u2013132 (2001)"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40031-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T22:02:17Z","timestamp":1553032937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40031-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205456","9783540400318"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40031-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}