{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T17:10:31Z","timestamp":1681837831873},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7198,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1016\/0304-3975(93)90243-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"1-44","source":"Crossref","is-referenced-by-count":8,"title":["Equality and abductive residua for Horn clauses"],"prefix":"10.1016","volume":"120","author":[{"given":"E.","family":"Knill","sequence":"first","affiliation":[]},{"given":"P.T.","family":"Cox","sequence":"additional","affiliation":[]},{"given":"T.","family":"Pietrzykowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90243-M_BIB1","series-title":"Ph.D. Thesis","article-title":"The complexity of unification","author":"Baxter","year":"1976"},{"key":"10.1016\/0304-3975(93)90243-M_BIB2","year":"1989"},{"key":"10.1016\/0304-3975(93)90243-M_BIB3","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1137\/0204036","article-title":"Proving theorems with the modification method","volume":"4","author":"Brand","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90243-M_BIB4","series-title":"Tech. Report 86","article-title":"Equivalent logic programs and symmetric homogeneous forms of logic programs with equality","author":"Chan","year":"1986"},{"key":"10.1016\/0304-3975(93)90243-M_BIB5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0004-3702(88)90063-X","article-title":"Motivation analysis, abductive unification, and nonmonotonic equality","volume":"34","author":"Charniak","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(93)90243-M_BIB6","series-title":"Groupe d'Intelligence Artificielle","article-title":"Prolog II: reference manual and theoretical model","author":"Colmerauer","year":"1982"},{"key":"10.1016\/0304-3975(93)90243-M_BIB7","first-page":"539","article-title":"Abduction in logic programming with equality","author":"Cox","year":"1992","journal-title":"Proc. Internat. Conf. on 5th Generation Computer System"},{"key":"10.1016\/0304-3975(93)90243-M_BIB8","series-title":"Proc. Symp. On Logic Programming","first-page":"220","article-title":"Surface deduction: a uniform mechanism for logic programming","author":"Cox","year":"1985"},{"key":"10.1016\/0304-3975(93)90243-M_BIB9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0168-0072(86)90069-2","article-title":"Incorporating equality into logic programming via surface deduction","volume":"31","author":"Cox","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(93)90243-M_BIB10","series-title":"Proc. Symp. on Logic Programming","first-page":"183","article-title":"General diagnosis by abductive inference","author":"Cox","year":"1987"},{"key":"10.1016\/0304-3975(93)90243-M_BIB11","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/BF01069968","article-title":"Equality control methods in machine theorem proving","volume":"22","author":"Degtyarev","year":"1986","journal-title":"Cybernetics"},{"key":"10.1016\/0304-3975(93)90243-M_BIB12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/5383.5389","article-title":"Equality-based binary resolution","volume":"33","author":"Digricoli","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90243-M_BIB13","first-page":"35","article-title":"A logical reconstruction of Prolog II","author":"van Emden","year":"1984","journal-title":"Proc. 2nd Internat. Conf. on Logic Prog."},{"key":"10.1016\/0304-3975(93)90243-M_BIB14","series-title":"Logic Programming, Proc. 5th Internat. Conf. and Symp.","first-page":"562","article-title":"Abductive planning with event calculus","author":"Eshgi","year":"1988"},{"key":"10.1016\/0304-3975(93)90243-M_BIB15","series-title":"AAAI Spring Symp. on Automated Abduction","first-page":"145","article-title":"A quick review of hypothetical reasoning based on abduction","author":"Goebel","year":"1990"},{"key":"10.1016\/0304-3975(93)90243-M_BIB16","series-title":"Proc. IEEE Symp. on Logic Programming","first-page":"115","article-title":"PROLOG: subsumption of equality axioms by the homogeneous form","author":"Hoddinott","year":"1986"},{"key":"10.1016\/0304-3975(93)90243-M_BIB17","article-title":"Foundations of Equational Logic Programming","volume":"353","author":"H\u00f6lldobler","year":"1989"},{"key":"10.1016\/0304-3975(93)90243-M_BIB18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0004-3702(92)90073-7","article-title":"Abduction versus closure in causal theories","volume":"53","author":"Konolige","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(93)90243-M_BIB19","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/0304-3975(93)90243-M_BIB20","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","article-title":"Linear unification","volume":"16","author":"Patterson","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90243-M_BIB21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(88)90077-X","article-title":"A logical framework for default reasoning","volume":"36","author":"Poole","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(93)90243-M_BIB22","first-page":"1304","article-title":"Normality and faults in logic-based diagnosis","author":"Poole","year":"1989","journal-title":"Proc. IJCAI"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390243M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390243M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T16:31:22Z","timestamp":1681835482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390243M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["030439759390243M"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90243-m","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}