{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:00Z","timestamp":1725663780937},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544876"},{"type":"electronic","value":"9783540384014"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54487-9_53","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:55:30Z","timestamp":1330210530000},"page":"80-94","source":"Crossref","is-referenced-by-count":1,"title":["Efficiency considerations on goal-directed forward chaining for logic programs"],"prefix":"10.1007","author":[{"given":"Wolfram","family":"Burgard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"5_CR1","unstructured":"Burgard, W. Generating a Data Structure for Goal-Directed Forward Chaining in Logic Programming. Tech. Rept. 331, Department of Computer Science, University of Dortmund, 1989."},{"key":"5_CR2","unstructured":"Burgard, W. Goal-Directed Forward Chaining: A Linear Resolution Strategy. Tech. Rept. 360, Department of Computer Science, University of Dortmund, 1990."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Burgard, W. and Heusch, P. Complexity Results on Generating Link Clauses for Goal-Directed Forward Chaining in Logic Programming. In Proceedings of the Second PROTOS Workshop, Sils Maria, Switzerland, Appelrath, H.J., Cremers, A.B., and Herzog, O., 1990.","DOI":"10.1007\/3-540-54487-9_53"},{"key":"5_CR4","unstructured":"Chang, C.L. and Lee, R.C.T. Symbolic Logic and Mechanical Theorem Proving, Academic Press(1973)."},{"key":"5_CR5","volume-title":"Computers and Intractability: A Guide to NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S. Computers and Intractability: A Guide to NP-Completeness, W. H. Freeman and Company, San Francisco(1979)."},{"key":"5_CR6","unstructured":"Heidelbach, M. Special Problems with Forward-Chaining Logic Programs, Diploma thesis, In German, University of Dortmund, 1990."},{"key":"5_CR7","first-page":"587","volume-title":"Deductive Databases and Logic Programming","author":"J.L. Lassez","year":"1987","unstructured":"Lassez, J.L., Maher, M.J., and Mariott, K. Unification Revisited. In Deductive Databases and Logic Programming. Morgan Kaufmann Publishers, Inc., Los Altos, California, pp. 587\u2013626, 1987."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W. Foundations of Logic Programming, Second, Extended Edition, Springer Verlag(1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"5_CR9","volume-title":"IJCAI 85 Proceedings of the Ninth International Joint Conference on Artificial Intelligence","author":"E.L. Lozinskii","year":"1985","unstructured":"Lozinskii, E.L. Evaluating Queries in Deductive Databases by Generating. In IJCAI 85 Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Aravind, J., Morgan Kaufmann Publishers, Inc., Los Altos, California, 1985."},{"key":"5_CR10","unstructured":"Magura, N. An Experimental Study to Estimate the Efficiency of Goal-Directed Forward Chaining, Diploma thesis, In German, University of Dortmund, 1991."},{"issue":"2","key":"5_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF03037421","volume":"1","author":"Y. Matsumo","year":"1983","unstructured":"Matsumo, Y., Tanaka, H., Hirakawa, H., Miyoshi, H., and Yasukawa, H. BUP: A Bottom-Up Parser Embedded in Prolog. New Generation Computing 1, 2 (1983), 145\u2013158.","journal-title":"New Generation Computing"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Pl\u00fcmer, L. Termination Proofs for Logic Programs, Springer Verlag, Lecture Notes in Artificial Intelligence, 446(1990).","DOI":"10.1007\/3-540-52837-7"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Rosen, B.K. Robust Linear Algorithms for Cutsets. Journal of Algorithms 3(1982).","DOI":"10.1016\/0196-6774(82)90020-7"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Speckenmeyer, E. On Feedback Problems in Digraphs. In Proceedings of the Fifteenth Workshop on Graphs, Rolduc, Netherlands, Springer Verlag, 1989.","DOI":"10.1007\/3-540-52292-1_16"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF03037384","volume":"4","author":"A. Yamamoto","year":"1986","unstructured":"Yamamoto, A. and Tanaka, H. Translating Production Rules into a Forward Reasoning Prolog Program. New Generation Computing 4(1986), 97\u2013105.","journal-title":"New Generation Computing"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54487-9_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:55:03Z","timestamp":1605646503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54487-9_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544876","9783540384014"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-54487-9_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}