{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:41:05Z","timestamp":1725468065507},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638766"},{"type":"electronic","value":"9783540696599"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0058028","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T10:48:04Z","timestamp":1154602084000},"page":"138-152","source":"Crossref","is-referenced-by-count":0,"title":["An abductive semantics for disjunctive logic programs and its proof procedure"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"C. Baral and V. Subrahmanian. Stable and extension class theory for logic programs and default logic. J. Automated Reasoning, pages 345\u2013366, 1992.","DOI":"10.1007\/BF02341854"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"A. Bondarenko, F. Toni, and R. Kowalski. An assumption-based framework for nonmonotonic reasoning. In Proc. 2nd Int'l Workshop on LPNMR, pages 171\u2013189. MIT Press, 1993.","DOI":"10.7551\/mitpress\/4307.003.0016"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"S. Brass and J. Dix. Disjunctive semantics based upon partinal and botton-up evaluation. In Proc. 12th ICLP, pages 199\u2013216, 1995.","DOI":"10.7551\/mitpress\/4298.003.0027"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0743-1066(95)00151-4","volume":"27","author":"W. Chen","year":"1996","unstructured":"W. Chen and D. Warren. Extending prolog with nonmonotonic reasoning. J. Logic Programming, 27(2):169\u2013183, 1996.","journal-title":"J. Logic Programming"},{"key":"11_CR5","unstructured":"P. Dung. Acyclic disjunctive logic programs with abductive procedures as proof procedure. In Proc. 1992 Fifth Generation Computer Systems, pages 555\u2013561, 1992."},{"key":"11_CR6","unstructured":"P. Dung. An abductive procedure for disjunctive logic programs. Unpublished manuscript, 1993."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0743-1066(95)94697-X","volume":"22","author":"P. Dung","year":"1995","unstructured":"P. Dung. An argumentation theoretic foundation for logic programming. J. Logic Programming, 22:151\u2013177, 1995. A short version appeared in Proc. ICLP '91.","journal-title":"J. Logic Programming"},{"key":"11_CR8","unstructured":"P. Dung. On the acceptability of argument and its fundamental rule in nonmonotonic reasoning and logic programming and n-person game. Artificial Intelligence, 76, 1995. A short version appeared in Proc. IJCAI'93."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T. Eiter","year":"1993","unstructured":"T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: prepositional case. Annals of Mathematics and Artificial Intelligence, 15:289\u2013324, 1993.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"11_CR10","unstructured":"K. Eshghi and R.A. Kowalski. Abduction compared with negation by failure. In Proc. 6th ICLP, pages 234\u2013254. MIT Press, 1989."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"A. Van Gelder. The alternating fixpoint of logic programs with negation. J. Computer and System Sciences, pages 185\u2013221, 1993. The preliminary version appeared in PODS '89.","DOI":"10.1016\/0022-0000(93)90024-Q"},{"key":"11_CR12","unstructured":"M. Gelfond, V. Lifschitz, H. Przymusinska, and M. Truszczynski. Disjunctive defaults. In Proc. 2nd Int'l Conf. on Principle of Knowledge Representation and Reasoning, pages 230\u2013237, 1991."},{"key":"11_CR13","unstructured":"L. Giordano, A. Marteli, and M. Sapino. A semantics for eshghi and kowalski's abductive procedure. In Proc. 10th ICLP. MIT Press, 1993."},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2:397\u2013425, 1992.","journal-title":"Journal of Logic and Computation"},{"key":"11_CR15","unstructured":"K. Inoue and C. Sakama. Transforming abductive logic programs to disjunctive programs. In Proc. 10th ICLP. MIT Press, 1993."},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","volume":"2","author":"A. Kakas","year":"1992","unstructured":"A. Kakas, R. Kowalski, and F. Toni. Abductive logic programming. J. Logic and Computation, 2:719\u2013770, 1992.","journal-title":"J. Logic and Computation"},{"key":"11_CR17","unstructured":"A. Kakas, R. Kowalski, and F. Toni. The role of abduction in logic programming. In Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University, 1995."},{"key":"11_CR18","unstructured":"A. Kakas and P. Mancarella. Generalized stable models: a semantics for abduction. In Proc. 9th ECAI, 1990."},{"key":"11_CR19","unstructured":"A. Kakas and P. Mancarella. Stable theories for logic programs. In Proc. ILPS. MIT Press, 1991."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"A. Kakas and P. Mancarella. Preferred extensions are partial stable models. J. Logic Programming, pages 341\u2013348, 1992.","DOI":"10.1016\/0743-1066(92)90015-U"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"11_CR22","first-page":"93","volume-title":"Complexity of computing with extended propositional logic programs","author":"W. Marek","year":"1992","unstructured":"W. Marek, A. Rajasekar, and M. Truszczy\u0144ski. Complexity of computing with extended propositional logic programs. In H. Blair, W. Marek, A. Nerode, and J. Remmel, editors, Proc. the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, pages 93\u2013102, Washington DC, 1992. Cornell University."},{"key":"11_CR23","unstructured":"D. Poole. What the lottery paradox tells us about default reasoning. In Proc. KR '89, pages 333\u2013340, 1989."},{"key":"11_CR24","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":"11_CR25","doi-asserted-by":"crossref","unstructured":"D. Sacc\u00e0 and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In Proc. 9th ACM PODS, pages 205\u2013217, 1990.","DOI":"10.1145\/298514.298572"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"C. Sakama and K. Inoue. Relating disjunctive logic programs to default theories. In Proc. 2nd Int'l Worshop on LPNMR, pages 266\u2013282. MIT Press, 1993.","DOI":"10.7551\/mitpress\/4307.003.0023"},{"key":"11_CR27","unstructured":"C. Sakama and K. Inoue. Representing priorities in logic programs. In Proc. Int'l Conference and Symposium on Logic Programming. MIT Press, 1996."},{"issue":"1\u20132","key":"11_CR28","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0304-3975(96)00090-4","volume":"170","author":"J. You","year":"1996","unstructured":"J. You, R. Cartwright, and M. Li. Iterative belief revision in extended logic programming. Theoretical Computer Science, 170(1\u20132):383\u2013406, 1996.","journal-title":"Theoretical Computer Science"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/S0022-0000(05)80053-4","volume":"49","author":"J. You","year":"1994","unstructured":"J. You and L. Yuan. A three-valued semantics for deductive databases and logic programs. J. Computer and System Sciences, 49:334\u2013361, 1994. A short version appeared in Proc. PODS '90.","journal-title":"J. Computer and System Sciences"},{"issue":"3","key":"11_CR30","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0743-1066(94)00023-Y","volume":"22","author":"J. You","year":"1995","unstructured":"J. You and L. Yuan. On the equivalence of semantics for normal logic programs. J. Logic Programming, 22(3):211\u2013222, 1995.","journal-title":"J. Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0058028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T21:11:32Z","timestamp":1707167492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0058028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638766","9783540696599"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0058028","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}