{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:28Z","timestamp":1725663028507},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164920"},{"type":"electronic","value":"9783540398318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16492-8_108","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:49:50Z","timestamp":1330195790000},"page":"593-599","source":"Crossref","is-referenced-by-count":2,"title":["Cyclic tree traversal"],"prefix":"10.1007","author":[{"given":"Martin","family":"Nilsson","sequence":"first","affiliation":[]},{"given":"Hidehiko","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"unstructured":"Colmerauer, A.: \"Prolog and Infinite Trees\". In Clark. K. and T\u00e4rnlund, S.-\u00c5.: (eds.): \"Logic Programming.\" Academic Press, 1982.","key":"48_CR1"},{"unstructured":"Fages. F.: \"Note sur l'unification des termes de premier ordre finis et infinis.\" In conf. proc. Dincbas. M. (ed.): \"Programmation en logique.\" Perros-Guirrec. France. March 22\u201323. 1983.","key":"48_CR2"},{"key":"48_CR3","volume-title":"Implementations of Prolog","author":"M. Filgueiras","year":"1985","unstructured":"Filgueiras, M.: \"A Prolog interpreter working with infinite terms\u201d. In Campbell, J.A. (ed.); \u201cImplementations of Prolog,\u201d Ellis Horwood, Chichester, 1985."},{"key":"48_CR4","volume-title":"Implementations of Prolog","author":"S. Haridi","year":"1985","unstructured":"Haridi, S., Sahlin, D.: \u201cEfficient implementation of unification of cyclic structures.\u201d In Campbell, J.A. (ed.): \u201cImplementations of Prolog.\u201d Ellis Horwood, Chichester, 1985."},{"unstructured":"Knuth, D.E.: \u201cThe Art of Computer Programming,\u201d vol. 2, Seminumerical Algorithms, 2nd ed., problems 3.1.6-7. p. 7, 517\u2013518. Addison-Wesley, 1981.","key":"48_CR5"},{"unstructured":"Mukai, K.: \u201cA Unification algorithm for Infinite Trees.\u201d In Bundy, A. (ed.): Proc. of the Int. Joint Conf. on Artificial Intelligence. August 1983.","key":"48_CR6"},{"unstructured":"Nilsson, M., Tanaka, H., Moto-oka, T.: \u201cDetection of Cyclic Tree Structures:\u201d In The Japanese Information Processing Society: Proc. 32nd Nat. Japanese Conf. Information Processing, 4C-6, 1986.","key":"48_CR7"},{"key":"48_CR8","first-page":"74","volume":"11","author":"R. Sedgewick","year":"1979","unstructured":"Sedgewick, R. and Szymanski, S.G.: \u201cThe Complexity of Finding Periods.\u201d In Proc. ACM Symp. Th. Comp. 11. p. 74\u201380, 1979.","journal-title":"Proc. ACM Symp. Th. Comp."},{"unstructured":"Yuhara, M., Koike, H., Tanaka, H., Moto-oka, T.: \u201cA Unify Processor Pilot Machine for PIE.\u201d In Proc. of the Japanese Logic Programming Conference '84, Tokyo, March 1984.","key":"48_CR9"}],"container-title":["Lecture Notes in Computer Science","Third International Conference on Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16492-8_108.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:04:39Z","timestamp":1619557479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16492-8_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164920","9783540398318"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-16492-8_108","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}