{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:57Z","timestamp":1749124077525},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["NGCO"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1007\/bf03037320","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T02:00:42Z","timestamp":1240365642000},"page":"55-74","source":"Crossref","is-referenced-by-count":7,"title":["A-SATCHMORE: SATCHMORE with availability checking"],"prefix":"10.1007","volume":"16","author":[{"given":"Lifeng","family":"He","sequence":"first","affiliation":[]},{"given":"Yuyan","family":"Chao","sequence":"additional","affiliation":[]},{"given":"Yuka","family":"Shimajiri","sequence":"additional","affiliation":[]},{"given":"Hirohisa","family":"Seki","sequence":"additional","affiliation":[]},{"given":"Hidenori","family":"Itoh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF03037320_CR1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00881955","volume":"13","author":"M. E. Stickel","year":"1994","unstructured":"Stickel, M. E., \u201cUpside-Down Meta-Interpretation of the Model Elimination Theorem-Proving Procedure for Deduction and Abduction,\u201dJournal of Automated Reasoning, 13, pp. 189\u2013210, 1994.","journal-title":"Journal of Automated Reasoning"},{"key":"BF03037320_CR2","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., \u201cAn Efficient Strategy for Non-Horn Deductive Databases,\u201dTheoretical Computer Science, 78, pp. 245\u2013249, 1991.","journal-title":"Theoretical Computer Science"},{"key":"BF03037320_CR3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00881861","volume":"14","author":"D. W. Loveland","year":"1995","unstructured":"Loveland, D. W., Reed, D. W., and Wilson, D. S., \u201cSATCHMORE: SATCHMO with RElevancy,\u201dJournal of Automated Reasoning, 14, pp. 325\u2013351, 1995.","journal-title":"Journal of Automated Reasoning"},{"key":"BF03037320_CR4","doi-asserted-by":"crossref","unstructured":"Manthey R. and Bry, F., \u201cSATCHMO: A Theorem Prover Implemented in Prolog,\u201dProceedings of 9th International Conference on Automated Deduction, 1988.","DOI":"10.1007\/BFb0012847"},{"key":"BF03037320_CR5","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 (second edition), Springer-Verlag, Heidelberg, 1987.","edition":"second edition"},{"key":"BF03037320_CR6","unstructured":"Tamaki, H. and Sato, T., \u201cUnfold\/Fold Transformation of Logic Programs,\u201dProceedings of the Second International Conference on Logic Programming, pp. 127\u2013138, 1984."},{"key":"BF03037320_CR7","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":"BF03037320_CR8","volume-title":"Automated Theorem Proving: A Logic Basis","author":"D. W. Loveland","year":"1978","unstructured":"Loveland, D. W.,Automated Theorem Proving: A Logic Basis, North-Holland, Amsterdam, 1978."},{"key":"BF03037320_CR9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00246025","volume":"2","author":"M. E. Stickel","year":"1986","unstructured":"Stickel, M. E., \u201cSchubert\u2019s Steamroller Problem: Formulations and Solutions,\u201dJournal of Automated Reasoning, 2, pp. 89\u2013101, 1986.","journal-title":"Journal of Automated Reasoning"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037320.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037320\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:34Z","timestamp":1558572754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["BF03037320"],"URL":"https:\/\/doi.org\/10.1007\/bf03037320","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}