{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:41Z","timestamp":1749124061954,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646754"},{"type":"electronic","value":"9783540691105"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054270","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:28:51Z","timestamp":1149665331000},"page":"333-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the relationship between non-horn magic sets and relevancy testing"],"prefix":"10.1007","author":[{"given":"Yoshihiko","family":"Ohta","sequence":"first","affiliation":[]},{"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[]},{"given":"Ryuzo","family":"Hasegawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J. D., Magic sets and other strange ways to implement logic programs, in: Proc. 5th ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, pp. 1\u201315, 1986.","DOI":"10.1145\/6012.15399"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"Beeri, C. and Ramakrishnan, R., On the power of magic, J. Logic Programming, 10:255\u2013299, 1991.","journal-title":"J. Logic Programming"},{"key":"31_CR3","unstructured":"Fujita, H. and Hasegawa, R., A model generation theorem prover in KL1 using a ramified-stack algorithm, Proc. 8th Int. Conf. on Logic Programming, pp. 535\u2013548, MIT Press, 1991."},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Hasegawa, R., Inoue, K., Ohta, Y. and Koshimura, M., Non-Horn magic sets to incorporate top-down inference into bottom-up theorem proving, in: W. McCune (ed.), Proc. 14th Int. Conf. on Automated Deduction (CADE-14), Lecture Notes in Artificial Intelligence, 1249, pp. 176\u2013190, Springer, 1997.","DOI":"10.1007\/3-540-63104-6_18"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W., Foundations of Logic Programming, 2nd Edition, Springer, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00881861","volume":"14","author":"D.W. Loveland","year":"1995","unstructured":"Loveland, D.W., Reed, D. and Wilson, D.S., SATCHMORE: SATCHMO with RElevancy, J. Automated Reasoning, 14(2):325\u2013351, 1995.","journal-title":"J. Automated Reasoning"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Manthey, R. and Bry, F., SATCHMO: a theorem prover implemented in Prolog, in: E. Lusk and R. Overbeek (eds.), Proc. 9th Int. Conf. on Automated Deduction (CADE-9), Lecture Notes in Computer Science, 310, pp. 415\u2013434, Springer, 1988.","DOI":"10.1007\/BFb0012847"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Seki, H., On the power of Alexander templates, Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pp. 150\u2013158, 1989.","DOI":"10.1145\/73721.73737"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00881955","volume":"13","author":"M. E. Stickel","year":"1994","unstructured":"Stickel, M. E., Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction, J. Automated Reasoning, 13(2):189\u2013210, 1994.","journal-title":"J. Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 CADE-15"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T17:05:42Z","timestamp":1674061542000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646754","9783540691105"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0054270","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}