{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:44Z","timestamp":1725467444935},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540558446"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-55844-6_128","type":"book-chapter","created":{"date-parts":[[2006,7,13]],"date-time":"2006-07-13T05:22:29Z","timestamp":1152768149000},"page":"69-86","source":"Crossref","is-referenced-by-count":7,"title":["Why the occur-check is not a problem"],"prefix":"10.1007","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Pellegrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493\u2013574. Elsevier, 1990. Vol. B.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"5_CR2","volume-title":"Technical report","author":"R. Chadha","year":"1991","unstructured":"R. Chadha and D.A. Plaisted. Correctness of unification without occur check in Prolog. Technical report, Department of Computer Science, University of North Carolina, Chapel Hill, N.C., 1991."},{"key":"5_CR3","unstructured":"P. Deransart, G. Ferrand, and M. T\u00e9guia. NSTO programs (not subject to occur-check). In V. Saraswat and K. Ueda, editors, Proceedings of the International Logic Symposium, pages 533\u2013547. The MIT Press, 1991."},{"key":"5_CR4","unstructured":"P. Dembinski and J. Maluszynski. AND-parallelism with intelligent backtracking for annotated logic programs. In Proceedings of the International Symposium on Logic Programming, pages 29\u201338, Boston, 1985."},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0743-1066(85)90015-9","volume":"2","author":"P. Deransart","year":"1985","unstructured":"P. Deransart and J. Maluszynski. Relating Logic Programs and Attribute Grammars. Journal of Logic Programming, 2:119\u2013156, 1985.","journal-title":"Journal of Logic Programming"},{"key":"5_CR6","first-page":"389","volume-title":"International Symposium on Logic Programming","author":"W. Drabent","year":"1987","unstructured":"W. Drabent. Do Logic Programs Resemble Programs in Conventional Languages? In International Symposium on Logic Programming, pages 389\u2013396. San Francisco, IEEE Computer Society, August 1987."},{"key":"5_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, second edition, 1987.","edition":"second edition"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J.-L. Lassez","year":"1988","unstructured":"J.-L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587\u2013625. Morgan Kaufmann, Los Altos, Ca., 1988."},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4:258\u2013282, 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5_CR10","volume-title":"Technical report","author":"A. Pellegrini","year":"1992","unstructured":"A. Pellegrini. Sul problema dell' \u201doccur check\u201d in Prolog. Technical report, Department of Computer Science, University of Padova, Padova, Italy, 1992. Tesi di Laurea, in Italian, to appear."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"D.A. Plaisted. The occur-check problem in Prolog. In Proc. International Conference on Logic Programming, pages 272\u2013280. IEEE Computer Science Press, 1984.","DOI":"10.1007\/BF03037324"},{"key":"5_CR12","unstructured":"D.A. Rosenblueth. Using program transformation to obtain methods for eliminating backtracking in fixed-mode logic programs. Technical Report 7, Universidad Nacional Autonoma de Mexico, Institute de Investigaciones en Matematicas Aplicadas y en Sistemas, 1991."},{"key":"5_CR13","unstructured":"L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986."}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55844-6_128.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:36:19Z","timestamp":1619559379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55844-6_128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540558446"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-55844-6_128","relation":{},"subject":[]}}