{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:21Z","timestamp":1749124041284},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1016\/0004-3702(85)90015-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"255-288","source":"Crossref","is-referenced-by-count":12,"title":["Completeness results for inequality provers"],"prefix":"10.1016","volume":"27","author":[{"given":"W.W.","family":"Bledsoe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Kunen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Shostak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(85)90015-3_BIB1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1145\/321592.321603","article-title":"A linear format resolution and a new technique for establishing completeness","volume":"17","author":"Anderson","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(85)90015-3_BIB2","series-title":"Proceedings Fifth Conference on Automated Deduction","article-title":"Variable elimination and chaining in a resolution-based prover for inequalities","author":"Bledsoe","year":"1980"},{"key":"10.1016\/0004-3702(85)90015-3_BIB3","unstructured":"Bledsoe, W.W., Kunen, K., and Shostak, R., Completeness results for inequality provers, Tech. Rept. ATP-65, University of Texas, Austin."},{"key":"10.1016\/0004-3702(85)90015-3_BIB4","article-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/0004-3702(85)90015-3_BIB5","article-title":"A Mathematical Introduction to Logic","author":"Enderton","year":"1972"},{"key":"10.1016\/0004-3702(85)90015-3_BIB6","article-title":"Automated Theorem Proving","author":"Loveland","year":"1978"},{"key":"10.1016\/0004-3702(85)90015-3_BIB7","article-title":"Logic: Form and Function","author":"Robinson","year":"1978"},{"key":"10.1016\/0004-3702(85)90015-3_BIB8","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/S1385-7258(54)50058-2","article-title":"Applications of the L\u00f6wenheim-Skolem-Tarski theorem to problems of completeness and decidability","volume":"16","author":"Vaught","year":"1954","journal-title":"Indag-Math"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370285900153?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370285900153?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T23:54:16Z","timestamp":1553644456000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370285900153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["0004370285900153"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(85)90015-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}