{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T00:43:29Z","timestamp":1726447409087},"reference-count":20,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1973,1,1]],"date-time":"1973-01-01T00:00:00Z","timestamp":94694400000},"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":[[1973]]},"DOI":"10.1016\/0004-3702(73)90013-1","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"225-243","source":"Crossref","is-referenced-by-count":23,"title":["The Q\u2217 algorithm\u2014a search strategy for a deductive question-answering system"],"prefix":"10.1016","volume":"4","author":[{"given":"Jack","family":"Minker","sequence":"first","affiliation":[]},{"given":"Daniel H.","family":"Fishman","sequence":"additional","affiliation":[]},{"given":"James R.","family":"McSkimin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"article-title":"An arraignment of theorem-proving or the logician's folly","year":"1972","author":"Anderson","key":"10.1016\/0004-3702(73)90013-1_BIB1"},{"year":"1973","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","key":"10.1016\/0004-3702(73)90013-1_BIB2"},{"article-title":"Experiments with a resolution-based deductive question-answering system and a proposed clause representation for parallel search","year":"1973","author":"Fishman","key":"10.1016\/0004-3702(73)90013-1_BIB3"},{"key":"10.1016\/0004-3702(73)90013-1_BIB4","first-page":"183","article-title":"Theorem proving by resolution as a basis for question-answering systems","volume":"4","author":"Green","year":"1969"},{"issue":"2","key":"10.1016\/0004-3702(73)90013-1_BIB5","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybernetics"},{"key":"10.1016\/0004-3702(73)90013-1_BIB6","series-title":"Proc. IJCAI","first-page":"167","article-title":"Procedural embedding of knowledge in PLANNER","author":"Hewitt","year":"1971"},{"article-title":"Studies in the completeness and efficiency of theorem-proving by resolution","year":"1970","author":"Kowalski","key":"10.1016\/0004-3702(73)90013-1_BIB7"},{"key":"10.1016\/0004-3702(73)90013-1_BIB8","first-page":"181","article-title":"Search strategies for theorem proving","volume":"5","author":"Kowalski","year":"1970"},{"key":"10.1016\/0004-3702(73)90013-1_BIB9","first-page":"87","article-title":"Semantic trees in automatic theorem-proving","volume":"4","author":"Kowalski","year":"1969"},{"issue":"3\/4","key":"10.1016\/0004-3702(73)90013-1_BIB10","first-page":"221","article-title":"Linear resolution with selection function","volume":"2","author":"Kowalski","year":"1971","journal-title":"Artificial Intelligence"},{"article-title":"The Maryland Refutation Proof Procedure System (MRPPS)","year":"1972","author":"Minker","key":"10.1016\/0004-3702(73)90013-1_BIB11"},{"article-title":"MRPPS\u2014An interactive refutation proof procedure system for question-answering","year":"1973","author":"Minker","key":"10.1016\/0004-3702(73)90013-1_BIB12"},{"year":"1971","series-title":"Problem Solving Methods in Artificial Intelligence","author":"Nilsson","key":"10.1016\/0004-3702(73)90013-1_BIB13"},{"article-title":"The use of models in automatic theorem proving","year":"1972","author":"Reiter","key":"10.1016\/0004-3702(73)90013-1_BIB14"},{"key":"10.1016\/0004-3702(73)90013-1_BIB15","series-title":"Proc. 3IJCAI","article-title":"A semantically guided deductive system for automatic theorem proving","author":"Reiter","year":"1973"},{"issue":"1","key":"10.1016\/0004-3702(73)90013-1_BIB16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0004-3702(73)90013-1_BIB17","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/321420.321428","article-title":"Automatic theorem proving with renamable and semantic resolution","volume":"14","author":"Slagle","year":"1967","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0004-3702(73)90013-1_BIB18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/362515.362560","article-title":"Experiments in automatic learning for a multipurpose heuristic program","volume":"14","author":"Slagle","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0004-3702(73)90013-1_BIB19","series-title":"Proc. FJCC","first-page":"1171","article-title":"From Planner to Conniver\u2014A genetic approach","author":"Sussman","year":"1972"},{"key":"10.1016\/0004-3702(73)90013-1_BIB20","series-title":"Proc. FJCC","first-page":"615","article-title":"The unit preference strategy in theorem proving","author":"Wos","year":"1964"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370273900131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370273900131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T19:23:55Z","timestamp":1553628235000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370273900131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973]]},"references-count":20,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1973]]}},"alternative-id":["0004370273900131"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(73)90013-1","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[1973]]}}}