{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:43Z","timestamp":1725663643630},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569442"},{"type":"electronic","value":"9783540478300"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56944-8_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:58:26Z","timestamp":1330257506000},"page":"52-63","source":"Crossref","is-referenced-by-count":2,"title":["Search space pruning by checking dynamic term growth"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Br\u00fcning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"5_CR1","volume-title":"On the safe termination of PROLOG programs","author":"K. R. Apt","year":"1989","unstructured":"K. R. Apt, R. N. Bol and J. W. Klop: On the safe termination of PROLOG programs, Proc. 6th Conf. on Logic Programming, G. Levi and M. Martelli (eds.), MIT Press, Cambridge MA, 1989."},{"unstructured":"P. Besnard: On infinite loops in logic programming, IRISA, Publication Interne No. 488, 1989.","key":"5_CR2"},{"unstructured":"E. W. Beth: Semantic entailment and formal derivability, Mededlingen der Koninklijke Nederlandse Akademie van Wetenschappen, 18(13), 1955.","key":"5_CR3"},{"key":"5_CR4","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":"5_CR5","doi-asserted-by":"crossref","DOI":"10.1515\/9783110701128","volume-title":"Deduktion, Automatisierung der Logik","author":"W. Bibel","year":"1992","unstructured":"W. Bibel: Deduktion, Automatisierung der Logik, Oldenbourg Verlag, M\u00fcnchen, 1992."},{"unstructured":"S. Br\u00fcning: Search Space Pruning by Checking Dynamic Term Growth, Technical Report AIDA-92-19, TH Darmstadt, 1992.","key":"5_CR6"},{"unstructured":"S. Br\u00fcning: On Search Space Pruning by Checking Dynamic Term Growth, Technical Report, TH Darmstadt, forthcoming.","key":"5_CR7"},{"unstructured":"J. E. Hopcroft and J. D. Ullman: Formal languages and their relation to automata, Addison-Wesley, 1969.","key":"5_CR8"},{"doi-asserted-by":"crossref","unstructured":"P. Hanschke and J. W\u00fcrtz: Satisfiability of the smallest binary program, Information Processing Letters 45(5), 1993.","key":"5_CR9","DOI":"10.1016\/0020-0190(93)90210-Z"},{"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.","key":"5_CR10","DOI":"10.1007\/BF00244282"},{"doi-asserted-by":"crossref","unstructured":"L. Pl\u00fcmer: Termination proofs for Logic Programs, LNAI 446, 1990.","key":"5_CR11","DOI":"10.1007\/3-540-52837-7"},{"doi-asserted-by":"crossref","unstructured":"M. O. Rabin: Decidability of second order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141, 1969.","key":"5_CR12","DOI":"10.2307\/1995086"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","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"},{"unstructured":"G. Salzer: Solvable Classes of Cycle Unification Problems, Proc. IMYCS'92, 1992.","key":"5_CR14"},{"key":"5_CR15","doi-asserted-by":"publisher","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"},{"unstructured":"R. M. Smullyan: First-Order Logic, Ergebnisse der Mathematik und ihrer Grenzgebiete, Springer-Verlag, 1971.","key":"5_CR16"},{"key":"5_CR17","doi-asserted-by":"publisher","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"},{"unstructured":"J. W\u00fcrtz: Unifying Cycles, research report RR-92-22, DFKI, Saarbr\u00fccken, 1992.","key":"5_CR18"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56944-8_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:09:33Z","timestamp":1640927373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56944-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569442","9783540478300"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-56944-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}