{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:03Z","timestamp":1725455643792},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540571841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022562","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:14:45Z","timestamp":1131862485000},"page":"144-151","source":"Crossref","is-referenced-by-count":2,"title":["On loop detection in connection calculi"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Br\u00fcning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"P. Besnard: On infinite loops in logic programming, IRISA, Publ. Interne 488, 1989."},{"key":"16_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-90102-6","volume-title":"Automated Theorem Proving","author":"W. Bibel","year":"1987","unstructured":"W. Bibel: Automated Theorem Proving, Vieweg Verlag, Braunschweig, second edition, 1987.","edition":"second edition"},{"key":"16_CR3","volume-title":"Deduction: Automated Logic","author":"W. Bibel","year":"1993","unstructured":"W. Bibel: Deduction: Automated Logic, Academic Press, London, 1993."},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(91)90004-L","volume":"86","author":"R. N. Bol","year":"1991","unstructured":"R. N. Bol, K. R. Apt, and J. W. Klop: An analysis of loop checking mechanisms for logic programs, Theoretical Computer Science 86, 35\u201379, 1991.","journal-title":"Theoretical Computer Science"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0743-1066(93)90017-B","volume":"15","author":"R. N. Bol","year":"1993","unstructured":"R. N. Bol: Loop Checking and Negation, JLP, 15:147\u2013175, 1993.","journal-title":"JLP"},{"key":"16_CR6","unstructured":"S. Br\u00fcning: Search Space Pruning by Checking Dynamic Term Growth, Technical Report AIDA-92-19, TH Darmstadt, to appear in proceedings of LPAR'93."},{"key":"16_CR7","unstructured":"S. Br\u00fcning: On Loop Detection in Connection Calculi, Technical Report, TH Darmstadt, in preparation."},{"key":"16_CR8","unstructured":"D. R. Brough and A. Walker: Some practical properties of logic programming interpreters, Proc. Conf. on Fifth Generation Computer Systems, 149\u2013156, 1984."},{"issue":"1","key":"16_CR9","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/988284.988288","volume":"20","author":"M. A. Covington","year":"1985","unstructured":"M. A. Covington: Eliminating unwanted loops in logic programming, Sigplan Notices 20 (1), 22\u201326, 1985.","journal-title":"Sigplan Notices"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"R. Letz and J. Schumann and S. Bayerl and W. Bibel: SETHEO: A High-Performance Theorem Prover, Journal of Automated Reasoning 8, 1992.","DOI":"10.1007\/BF00244282"},{"key":"16_CR11","unstructured":"G. Neugebauer: From Horn Clauses to First Order Logic: A Graceful Ascent, Technical report, Darmstadt, 1992."},{"issue":"1","key":"16_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"J. A. Robinson: A machine-oriented logic based on the resolution principle, Journal of the ACM, 12(1), 23\u201341, 1965.","journal-title":"Journal of the ACM"},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(86)90003-2","volume":"30","author":"D. E. Smith","year":"1986","unstructured":"D. E. Smith and M. R. Genesereth and M. L. Ginsberg: Controlling recursive inference, Artificial Intelligence, 30, 343\u2013389, 1986.","journal-title":"Artificial Intelligence"},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00297245","volume":"4","author":"M. E. Stickel","year":"1988","unstructured":"M. E. Stickel: A PROLOG technology theorem prover: implementation by an extended PROLOG compiler, Journal of Automated Reasoning, 4, 353\u2013380, 1988.","journal-title":"Journal of Automated Reasoning"},{"key":"16_CR15","unstructured":"L. Vieille: Recursive Query Processing: The Power of Logic, ECRC Munich, Technical Report TR-KB-17, 1987."}],"container-title":["Lecture Notes in Computer Science","Computational Logic and Proof Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022562.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:49:02Z","timestamp":1607550542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540571841"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0022562","relation":{},"subject":[]}}