{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:12:15Z","timestamp":1758265935267},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf00881861","type":"journal-article","created":{"date-parts":[[2005,1,7]],"date-time":"2005-01-07T05:02:27Z","timestamp":1105074147000},"page":"325-351","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["SATCHMORE: SATCHMO with RElevancy"],"prefix":"10.1007","volume":"14","author":[{"given":"Donald W.","family":"Loveland","sequence":"first","affiliation":[]},{"given":"David W.","family":"Reed","sequence":"additional","affiliation":[]},{"given":"Debra S.","family":"Wilson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00881861_CR1","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J.: Magic sets and other strange ways to implement logic programs, inProc. 5th ACM Sympos. Principles of Database Systems, 1986, pp. 1\u201315.","DOI":"10.1145\/6012.15399"},{"key":"BF00881861_CR2","doi-asserted-by":"crossref","unstructured":"Beeri, C. and Ramakrishnan, R.: On the power of magic, inProc. 6th ACM Sympos. Principles of Database Systems, 1987, pp. 269\u2013283.","DOI":"10.1145\/28659.28689"},{"key":"BF00881861_CR3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0169-023X(90)90017-8","volume":"5","author":"F. Bry","year":"1990","unstructured":"Bry, F.: Query evaluation in recursive databases: Bottom-up and top-down reconciled,Data and Knowledge Engineering\n5 (1990), 289\u2013312.","journal-title":"Data and Knowledge Engineering"},{"key":"BF00881861_CR4","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C. L. Chang","year":"1973","unstructured":"Chang, C. L. and Lee, K. C. T.:Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973."},{"key":"BF00881861_CR5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(51)90010-2","volume":"78","author":"R. Demolombe","year":"1991","unstructured":"Demolombe, R.: An efficient strategy for non-Horn deductive databases,Theoretical Computer Science\n78 (1991), 245\u2013259.","journal-title":"Theoretical Computer Science"},{"key":"BF00881861_CR6","unstructured":"Fujita, H. and Hasegawa, R.: A model generation theorem prover in KL1 using a ramified-stack algorithm, in K. Furukawa (ed.),Logic Programming: Proc. 8th Internat. Conf., MIT Press, 1991."},{"key":"BF00881861_CR7","unstructured":"Fujita, M., Slaney, J. K., and Hasegawa, R.: New results in mathematics by a parallel theorem prover on a parallel inference machine, Technical Report ICOT-TR-1221, ICOT, Tokyo, 1992."},{"key":"BF00881861_CR8","unstructured":"Hasegawa, R., Ohta, Y., and Inoue, K.: Non-Horn magic sets and their relation to relevancy testing. Technical Report ICOT-TR-834, ICOT, Tokyo, 1993."},{"key":"BF00881861_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"Lloyd, J. W.:Foundations of Logic Programming, 2nd edn, Springer-Verlag, Heidelberg, 1987.","edition":"2nd edn"},{"key":"BF00881861_CR10","doi-asserted-by":"crossref","unstructured":"Lobo, J., Minker, J. and Rajasekar, A.:Foundations of Disjunctive Logic Programming, MIT Press, 1992.","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"BF00881861_CR11","volume-title":"Automated Theorem Proving: A Logical Basis","author":"D. W. Loveland","year":"1978","unstructured":"Loveland, D. W.:Automated Theorem Proving: A Logical Basis, North-Holland, Amsterdam, 1978."},{"key":"BF00881861_CR12","unstructured":"Manthey, R. and Bry, F.: SATCHMO: A theorem prover implemented in Prolog, inProc. of the Ninth Int'l Conf. on Automated Deduction, 1988."},{"issue":"1","key":"BF00881861_CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","volume":"9","author":"J. Minker","year":"1990","unstructured":"Minker, J. and Rajasekar, A.: A fixpoint semantics for disjunctive logic programs,J. Logic Programming\n9(1) (1990), 45\u201374.","journal-title":"J. Logic Programming"},{"key":"BF00881861_CR14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF00249019","volume":"7","author":"A. Ramsay","year":"1991","unstructured":"Ramsay, A.: Generating relevant models,J. Automated Reasoning\n7 (1991), 359\u2013368.","journal-title":"J. Automated Reasoning"},{"key":"BF00881861_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BFb0013613","volume-title":"Proc. 2nd Workshop on Extensions of Logic Programming (ELP'91)","author":"D. W. Reed","year":"1992","unstructured":"Reed, D. W., Loveland, D. W., and Smith, B. T.: A near-Horn approach to disjunctive logic programming, inProc. 2nd Workshop on Extensions of Logic Programming (ELP'91), Lecture Notes in Artificial Intelligence 596, Springer-Verlag, Berlin, 1992, pp. 345\u2013369."},{"key":"BF00881861_CR16","doi-asserted-by":"crossref","unstructured":"Seki, H.: On the power of Alexander templates, inProc. 8th ACM Symposium on Principles of Database Systems, 1989.","DOI":"10.1145\/73721.73737"},{"key":"BF00881861_CR17","unstructured":"Stickel, M. E.: Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction,J. Automated Reasoning (in press)."},{"key":"BF00881861_CR18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00246025","volume":"2","author":"M. E. Stickel","year":"1986","unstructured":"Stickel, M. E.: Schubert's steamroller problem: Formulations and solutions,J. Automated Reasoning\n2 (1986), 89\u2013101.","journal-title":"J. Automated Reasoning"},{"key":"BF00881861_CR19","unstructured":"Wilson, D. S. and Loveland, D. W.: Incorporating relevancy testing in SATCHMO. Technical Report CS-1989-24, Duke University, 1989."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881861.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF00881861\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881861.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T22:06:52Z","timestamp":1659046012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF00881861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF00881861"],"URL":"https:\/\/doi.org\/10.1007\/bf00881861","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]},"assertion":[{"value":"23 June 1993","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}