{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T20:59:26Z","timestamp":1780952366840,"version":"3.54.1"},"reference-count":37,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4008,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0004-3702(02)00227-8","type":"journal-article","created":{"date-parts":[[2002,9,9]],"date-time":"2002-09-09T20:43:49Z","timestamp":1031604229000},"page":"175-205","source":"Crossref","is-referenced-by-count":18,"title":["Abduction in logic programming: A new definition and an abductive procedure based on rewriting"],"prefix":"10.1016","volume":"140","author":[{"given":"Fangzhen","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0004-3702(02)00227-8_BIB001","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(91)90004-L","article-title":"An analysis of loop checking mechanisms for logic programs","volume":"86","author":"Bol","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(02)00227-8_BIB002","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"issue":"5","key":"10.1016\/S0004-3702(02)00227-8_BIB003","first-page":"661","article-title":"On the relationship between abduction and deduction","volume":"2","author":"Console","year":"1991","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/S0004-3702(02)00227-8_BIB004","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0743-1066(97)00074-5","article-title":"SLDNFA: An abductive procedure for normal abductive programs","volume":"34","author":"Denecker","year":"1998","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB005","series-title":"Handbook of Theoretical Computer Science, Vol B: Formal Methods and Semantics","first-page":"243","article-title":"Rewrite systems","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB006","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0743-1066(95)94697-X","article-title":"An argumentation theoretic foundation for logic programming","volume":"22","author":"Dung","year":"1995","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB007","series-title":"Proc. 6th Internat. Conference on Logic Programming","first-page":"234","article-title":"Abduction compared with negation by failure","author":"Eshghi","year":"1989"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB008","first-page":"51","article-title":"Consistency of Clark's completion and existence of stable models","volume":"1","author":"Fages","year":"1994","journal-title":"J. Methods Logic Comput. Sci."},{"issue":"2","key":"10.1016\/S0004-3702(02)00227-8_BIB009","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0743-1066(97)00026-5","article-title":"The iff proof procedure for abductive logic programming","volume":"33","author":"Fung","year":"1997","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB010","series-title":"Proc. 5th Internat. Conference on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB011","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classic negation in logic programs and disjunctive database","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"issue":"1","key":"10.1016\/S0004-3702(02)00227-8_BIB012","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0743-1066(95)00065-8","article-title":"Extending negation as failure by abduction: A three-valued stable model semantics","volume":"26","author":"Giordano","year":"1996","journal-title":"J. Logic Programming"},{"issue":"4","key":"10.1016\/S0004-3702(02)00227-8_BIB013","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: Abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB014","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","article-title":"The role of abduction in logic programming","author":"Kakas","year":"1995"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB015","series-title":"Proc. 9th European Conference on Artificial Intelligence","first-page":"285","article-title":"Generalized stable models: A semantics for abduction","author":"Kakas","year":"1990"},{"issue":"1\u20133","key":"10.1016\/S0004-3702(02)00227-8_BIB016","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0743-1066(99)00075-8","article-title":"ACLP: Abductive constraint logic programming","volume":"44","author":"Kakas","year":"2000","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB017","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1971"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB018","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"},{"issue":"3","key":"10.1016\/S0004-3702(02)00227-8_BIB019","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","article-title":"Signed data dependencies in logic programs","volume":"7","author":"Kunen","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB020","series-title":"DLV: A disjunctive datalog system, release 2000-10-15","author":"Leone","year":"2000"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB021","series-title":"The Logic Programming Paradigm: A 25-Year Perspective","first-page":"357","article-title":"Answer set programming","author":"Lifschitz","year":"1999"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB022","series-title":"Proc. IJCAI-95, Montreal, Quebec","first-page":"1985","article-title":"Embracing causality in specifying the indirect effects of actions","author":"Lin","year":"1995"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB023","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"781","article-title":"From causal theories to successor state axioms: Bridging the gap between nonmonotonic action theories and STRIPS-like formalisms","author":"Lin","year":"2000"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB024","series-title":"Proc. 5th LPNMR, El Paso, TX","article-title":"From causal theories to logic programs (sometimes)","author":"Lin","year":"1999"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB025","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB026","series-title":"The Logic Programming Paradigm: A 25-Year Perspective","first-page":"375","article-title":"Stable models and an alternative logic programming paradigm","author":"Marek","year":"1999"},{"issue":"3\u20134","key":"10.1016\/S0004-3702(02)00227-8_BIB027","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1018930122475","article-title":"Logic programs with stable model semantics as a constraint programming paradigm","volume":"25","author":"Niemel\u00e4","year":"1999","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB028","series-title":"Proc. Fifth Generation Computer Systems Conference","first-page":"1282","article-title":"Representing knowledge for logic-based diagnosis","author":"Poole","year":"1988"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB029","series-title":"Proc. 7th Internat. Conference on Logic Programming","first-page":"459","article-title":"Extended stable semantics for normal and disjunctive logic programs","author":"Przymusinski","year":"1990"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB030","series-title":"Proc. AAAI-87, Seattle, WA","first-page":"183","article-title":"Foundations of assumption-based truth maintenance systems: Preliminary report","author":"Reiter","year":"1987"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB031","series-title":"Proc. 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"205","article-title":"Stable models and non-determinism in logic programs with negation","author":"Sacc\u00e0","year":"1990"},{"issue":"1","key":"10.1016\/S0004-3702(02)00227-8_BIB032","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0743-1066(90)90032-Z","article-title":"Completed logic programs and their consistency","volume":"9","author":"Sato","year":"1990","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB033","series-title":"Proc. 8th Internat. Conference on Logic Programming","first-page":"505","article-title":"Computing abduction using the TMS","author":"Satoh","year":"1991"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB034","series-title":"Proc. Joint Internat. Conference and Symposium on Logic Programming","first-page":"671","article-title":"A query evaluation method for abductive logic programming","author":"Satoh","year":"1992"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB035","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","article-title":"Extending and implementing the stable model semantics","volume":"138","author":"Simons","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00227-8_BIB036","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/S0022-0000(05)80053-4","article-title":"A three-valued semantics for deductive databases and logic programs","volume":"49","author":"You","year":"1994","journal-title":"J. Computer System Sci."},{"key":"10.1016\/S0004-3702(02)00227-8_BIB037","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0743-1066(94)00023-Y","article-title":"On the equivalence of semantics for normal logic programs","volume":"22","author":"You","year":"1995","journal-title":"J. Logic Programming"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002278?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002278?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T15:53:17Z","timestamp":1555170797000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202002278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0004370202002278"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00227-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}