{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:05:12Z","timestamp":1746158712272,"version":"3.40.4"},"publisher-location":"London","reference-count":12,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540197355"},{"type":"electronic","value":"9781447137948"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-1-4471-3794-8_14","type":"book-chapter","created":{"date-parts":[[2013,12,19]],"date-time":"2013-12-19T11:23:28Z","timestamp":1387452208000},"page":"204-223","source":"Crossref","is-referenced-by-count":0,"title":["Some Algorithms for Fast and Complete Execution of Logic Programs"],"prefix":"10.1007","author":[{"given":"Roland","family":"Olsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Fribourg, L., SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting, in Proceedings of the 1985 Symposium on Logic Programming, IEEE Computer Society Press, 1985, pp. 172\u2013184."},{"key":"14_CR2","first-page":"223","volume-title":"C.","author":"C Jorgensen","year":"1986","unstructured":"Jorgensen, C., Hamel, W. and Weisbin, C., Autonomous Robot Navigation, Byte, January 1986, pp. 223\u2013235."},{"key":"14_CR3","volume-title":"Harvard University","author":"RM Karp","year":"1981","unstructured":"Karp, R.M. and Rabin, M.O., Efficient Randomized Pattern-Matching Algorithms, Technical Report TR-31\u201381, Harvard University, 1981."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf, R.E., Depth-First Iterative-Deepening: An Optimal Admissible Tree Search, Artificial Intelligence, vol. 27, 1985, pp. 97\u2013109.","journal-title":"Artificial Intelligence"},{"key":"14_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1987","unstructured":"Lloyd, J.W., Foundations of Logic Programming, Second Edition, Springer-Verlag, 1987."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Loveland, D.W., Near-Horn Prolog, in: Proceedings of the 4th International Conference on Logic Programming, Melbourne, 1987, pp. 163\u2013190.","DOI":"10.21236\/ADA185172"},{"key":"14_CR7","unstructured":"Mukai, K. and Furukawa, K., An Ordered Linear Resolution Theorem Proving Program in Prolog, ICOT TM-0027, Inst. for New Generation Computer Technology, Tokyo, 1984."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0743-1066(85)90017-2","volume":"3","author":"L Naish","year":"1985","unstructured":"Naish, L., Automating Control for Logic Programs, J. Logic Programming, no. 3, 1985, pp. 167\u2013183","journal-title":"J. Logic Programming"},{"key":"14_CR9","volume-title":"Negation and Control in Prolog, Technical Report 85\/12","author":"L Naish","year":"1985","unstructured":"Naish, L., Negation and Control in Prolog, Technical Report 85\/12, Dept. of Computer Science, University of Melbourne, 1985."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Shapiro, E.Y., Algorithmic Program Debugging, MIT Press, 1983.","DOI":"10.7551\/mitpress\/1192.001.0001"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Stickel, M.E., A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler, in Proceedings of the 8th International Conference on Automated Deduction, Oxford, 1986, pp. 583\u2013587.","DOI":"10.1007\/3-540-16780-3_122"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0743-1066(89)90032-0","volume":"6","author":"A Gelder","year":"1989","unstructured":"van Gelder, A., Negation as Failure Using Tight Derivations for General Logic Programs, J. Logic Programming, no. 6, 1989, pp. 109\u2013133.","journal-title":"J. Logic Programming"}],"container-title":["Workshops in Computing","Declarative Programming, Sasbachwalden 1991"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3794-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T07:56:22Z","timestamp":1746086182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-3794-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540197355","9781447137948"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3794-8_14","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1992]]}}}