{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:47:39Z","timestamp":1749221259498},"reference-count":41,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":4766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0743-1066(99)00074-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:08:53Z","timestamp":1027634933000},"page":"101-127","source":"Crossref","is-referenced-by-count":9,"title":["An abductive approach to disjunctive logic programming"],"prefix":"10.1016","volume":"44","author":[{"given":"Jia-Huai","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li Yan","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Randy","family":"Goebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(99)00074-6_BIB1","doi-asserted-by":"crossref","unstructured":"C. Aravindan, An abductive framework for negation in disjunctive logic programming, Technical Report, University of Koblenz-Landau, 1996","DOI":"10.1007\/3-540-61630-6_18"},{"issue":"1\u20133","key":"10.1016\/S0743-1066(99)00074-6_BIB2","first-page":"85","article-title":"Logic programming and knowledge representation","volume":"31","author":"Baral","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB3","doi-asserted-by":"crossref","unstructured":"C. Baral, V. Subrahmanian, Stable and extension class theory for logic programs and default logic, Journal of Automated Reasoning (1992) 345\u2013366","DOI":"10.1007\/BF02341854"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00881948","article-title":"Model elimination without contrapositives and its application to PTTP","volume":"13","author":"Baumgartner","year":"1994","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB5","doi-asserted-by":"crossref","unstructured":"P. Baumgartner, U. Furbach, Calculi for disjunctive logic programming, in: Proceedings of ILPS'97, MIT Press, Cambridge, MA, 1997, pp. 229\u2013244","DOI":"10.7551\/mitpress\/4299.003.0035"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB6","doi-asserted-by":"crossref","unstructured":"P. Bonatti, Resolution with skeptical stable semantics, in: Proceedings of LPNMR, 1997","DOI":"10.1007\/3-540-63255-7_13"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB7","doi-asserted-by":"crossref","unstructured":"A. Bondarenko, F. Toni, R. Kowalski, An assumption-based framework for nonmonotonic reasoning, in: Proceedings of LPNMR, MIT Press, Cambridge, MA, 1993, pp. 171\u2013189","DOI":"10.7551\/mitpress\/4307.003.0016"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB8","doi-asserted-by":"crossref","unstructured":"J. Dix, L. Pereira, T. Przymusinski, Prolegomena to logic programming for nonmonotonic reasoning, in: Nonmonotonic Extensions of Logic Programming, LNAI 1216, 1996, pp. 1\u201336","DOI":"10.1007\/BFb0023799"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB9","unstructured":"P. Dung, Acyclic disjunctive logic programs with abductive procedures as proof procedure, in: Proceedings of the 1992 Fifth Generation Computer Systems, 1992, pp. 555\u2013561"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB10","unstructured":"P. Dung, An abductive procedure for disjunctive logic programs, unpublished manuscript, 1993"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB11","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":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB12","doi-asserted-by":"crossref","unstructured":"P. Dung, On the acceptability of argument and its fundamental role in non-monotonic reasoning and logic programming and n-person game, Artificial Intelligence 76 (1995)","DOI":"10.1016\/0004-3702(94)00041-X"},{"issue":"12","key":"10.1016\/S0743-1066(99)00074-6_BIB13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1018947420290","article-title":"On the partial models for disjunctive deductive databases","volume":"17","author":"Eiter","year":"1997","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1\u20132","key":"10.1016\/S0743-1066(99)00074-6_BIB14","first-page":"181","article-title":"Expressive power and complexity of partial models for disjunctive deductive databases","volume":"260","author":"Eiter","year":"1988","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB15","unstructured":"K. Eshghi, R.A. Kowalski, Abduction compared with negation by failure, in: Proceedings of the Sixth ICLP, MIT Press, Cambridge, MA, 1989, pp. 234\u2013254"},{"issue":"3\/4","key":"10.1016\/S0743-1066(99)00074-6_BIB16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB17","unstructured":"M. Gelfond, V. Lifschitz, H. Przymusinska, M. Truszczynski, Disjunctive defaults, in: Proceedings of KR'91, 1991, pp. 230\u2013237"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB18","unstructured":"L. Giordano, A. Martelli, M. Sapino, A semantics for Eshghi and Kowalski's abductive procedure, in: Proceedings of the 10th ICLP, MIT Press, Cambridge, MA, 1993"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB19","unstructured":"K. Inoue, C. Sakama, Transforming abductive logic programs to disjunctive programs, in: Proceedings of the 10th ICLP, MIT Press, Cambridge, MA, 1993"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB20","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","article-title":"Abductive logic programming","volume":"2","author":"Kakas","year":"1992","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB21","unstructured":"A. Kakas, R. Kowalski, F. Toni, The role of abduction in logic programming, in: Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University, 1995"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB22","unstructured":"A. Kakas, P. Mancarella, Generalized stable models: a semantics for abduction, in: Proceedings of Ninth ECAI, 1990"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB23","unstructured":"A. Kakas, P. Mancarella, P. Dung, The acceptability semantics for logic programs, in: Proceedings of the 11th ICLP, 1994, pp. 504\u2013519"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB24","doi-asserted-by":"crossref","unstructured":"J. Lobo, J. Minker, A. Rajasekar, Foundations of Disjunctive Logic Programming, MIT Press, Cambridge, MA, 1992","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB25","doi-asserted-by":"crossref","unstructured":"J. Minker, Logic and databases: a 20 year retrospective, in: Keynote Address at Workshop on Logic in Databases, 1996","DOI":"10.1007\/BFb0031734"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB26","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(94)90201-1","article-title":"Adding closed world assumptions to well founded semantics","volume":"122","author":"Pereira","year":"1994","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB27","unstructured":"D. Poole, What the lottery paradox tells us about default reasoning, in: Proceedings of KR'89, 1989, pp. 333\u2013340"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB28","doi-asserted-by":"crossref","first-page":"67","DOI":"10.3233\/FI-1994-21124","article-title":"Stationary default extensions","volume":"21","author":"Przymusinska","year":"1994","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB29","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0004-3702(89)90067-2","article-title":"An algorithm to compute circumscription","volume":"38","author":"Przymusinski","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB30","doi-asserted-by":"crossref","unstructured":"T.C. Przymusinski, Static semantics for normal and disjunctive logic programs, Annals of Mathematics and Artificial Intelligence, 1995","DOI":"10.1007\/BF01530826"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB31","unstructured":"T.C. Przymusinski, Extended stable semantics for normal and disjunctive logic programs, in: Proceedings of the Seventh ICLP, MIT Press, Cambridge, MA, 1990, pp. 459\u2013477"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB32","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1145\/321662.321678","article-title":"Two results on ordering for resolution with merging and linear format","volume":"18","author":"Reiter","year":"1971","journal-title":"JACM"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB33","doi-asserted-by":"crossref","unstructured":"C. Sakama, K. Inoue, Relating disjunctive logic programs to default theories, in: Proceedings of LPNMR, MIT Press, Cambridge, MA, 1993, pp. 266\u2013282","DOI":"10.7551\/mitpress\/4307.003.0023"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB34","unstructured":"C. Sakama, K. Inoue, Representing priorities in logic programs, in: Proceedings of the 13th ICLP, MIT Press, Cambridge, MA, 1996"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB35","doi-asserted-by":"crossref","unstructured":"V.S. Subrahmanian, C. Zaniolo, Relating stable models and AI planning domains, in Proceedings of the 12th ICLP, 1995, pp. 233\u2013248","DOI":"10.7551\/mitpress\/4298.003.0030"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB36","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, The alternating fixpoint of logic programs with negation, Journal of Computer and System Sciences, 1993, pp. 185\u2013221","DOI":"10.1016\/0022-0000(93)90024-Q"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB37","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":"Journal of Computer and System Sciences"},{"issue":"3","key":"10.1016\/S0743-1066(99)00074-6_BIB38","doi-asserted-by":"crossref","first-page":"211","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":"Journal of Logic Programming"},{"issue":"1\u20132","key":"10.1016\/S0743-1066(99)00074-6_BIB39","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0304-3975(96)80712-2","article-title":"Iterative belief revision in extended logic programming","volume":"170","author":"You","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB40","doi-asserted-by":"crossref","unstructured":"J. You, X. Wang, L. Yuan, Disjunctive logic programming as constrained inferences, in: Proceedings of the 14th ICLP, MIT Press, Cambridge, MA, 1997","DOI":"10.7551\/mitpress\/4299.003.0031"},{"key":"10.1016\/S0743-1066(99)00074-6_BIB41","unstructured":"J. You, L. Yuan, R. Goebel, Regular extension semantics and disjunctive Eshghi\u2013Kowalski procedure, in: Proceedings of JICSLP'98, MIT Press, Cambridge, MA, 1998, pp. 175\u2013189"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106699000746?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106699000746?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T14:43:00Z","timestamp":1704120180000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106699000746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":41,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0743106699000746"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(99)00074-6","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}