{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:26:32Z","timestamp":1725456392250},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055727X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013059","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:02:07Z","timestamp":1132729327000},"page":"172-177","source":"Crossref","is-referenced-by-count":0,"title":["Pruning infinite failure branches in programs with occur-check"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Neumerkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"A. Colmerauer. Prolog and infinite trees. Logic Programming, Academic Press 231\u2013251, (1982)."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming, (2nd.Ed.) Springer-Verlag, (1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"16_CR3","unstructured":"P. Deransart and G. Ferrand and M. T\u00e9guia, NSTO Programs (Not Subject To Occur-check), ISLP'91, 533\u2013550, (1991)."},{"key":"16_CR4","unstructured":"L. Pl\u00fcmer, Automatic Termination Proofs for Prolog Programs Operating on Non-ground Terms, ISLP'91 503\u2013517, (1991)."},{"key":"16_CR5","unstructured":"M. Proietti and A. Pettorossi, Construction of Efficient Logic Programs by Loop Absorption and Generalization. Proc. Meta 90, Leuven, 57\u201381, (1990)."},{"key":"16_CR6","first-page":"63","volume":"6","author":"J. Robinson","year":"1971","unstructured":"J. Robinson, Computational logic: The unification computation. Machine Intelligence 6, 63\u201372, (1971).","journal-title":"Machine Intelligence"},{"key":"16_CR7","unstructured":"L.S. Sterling and E. Shapiro, The Art of Prolog, MIT Press, (1986)."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013059.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:06:55Z","timestamp":1607353615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055727X"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0013059","relation":{},"subject":[]}}