{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:48:29Z","timestamp":1749221309801},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649588"},{"type":"electronic","value":"9783540498728"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054794","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T01:52:33Z","timestamp":1153965153000},"page":"139-163","source":"Crossref","is-referenced-by-count":2,"title":["Abduction, argumentation and bi-disjunctive logic programs"],"prefix":"10.1007","author":[{"given":"Kewen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huowang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. Apt","year":"1988","unstructured":"Apt,K., Blair,H., and Walker,A., \u201c Towards a theory of declarative knowledge\u201d, in Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, San Mateo, CA, pp.89\u2013148, 1988."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alfereira,J. and Pereira,L., \u201cAn argumentation theoretic semantics based on nonrefutable falsity.\u201d, in Proceedings of International Workshop on Nonmonotonic Extensions of Logic Programming (LNCS), 1994.","DOI":"10.1007\/BFb0030657"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Aravindan,C., \u201cAn abductive framework for negation in disjunctive logic programming,\u201d Tech. report, University of Koblenz-Landau, 1996.","DOI":"10.1007\/3-540-61630-6_18"},{"key":"7_CR4","first-page":"89","volume":"5","author":"C. Baral","year":"1992","unstructured":"Baral,C., Lobo,J., and Minker,J., \u201cGeneralized disjunctive well-founded semantics for logic programs.\u201d Annals of Math and AI, 5, pp.89\u2013132, 1992","journal-title":"Annals of Math and AI"},{"key":"7_CR5","unstructured":"Bonatti,P., \u201cAutoepistemic logics as a unifying framework for the semantics of logic programs\u201d, in Proceedings of the Joint International Conference and Symposium on Logic Programming, MIT Press, pp.69\u201386, 1992"},{"key":"7_CR6","unstructured":"Bondarenko,A., Toni,F. and Kowalski,R., \u201cAn assumption-based framework for non-monotonic reasoning,\u201d in Proceedings of the 2nd International Workshop on LNMR, MIT Press, pp.171\u2013189, 1993."},{"key":"7_CR7","unstructured":"Brass, S. and Dix J. Semantics of disjunctive logic programs based on partial evaluation. Journal of Logic Programming (to appear), 1998. Extended abstract appeared in Disjunctive semantics based upon partial and bottom-up evaluation. In Proceedings of the 12th International Logic Programming Conference, MIT Press, pp.199\u2013213, 1995."},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0743-1066(96)00115-X","volume":"32","author":"S. Brass","year":"1997","unstructured":"Brass,S. and Dix J. Characterizations of the disjunctive stable semantics by partial evaluation. Journal of Logic Programming, 32(3), pp.207\u2013228, 1997. Extended abstract appeared in: Characterizations of the stable semantics by partial evaluation, in LPNMR, Proceedings of the Third International Conference (LNCS928), Springer, pp.85\u201398, 1995.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1005952908693","volume":"20","author":"S. Brass","year":"1998","unstructured":"Brass,S. and Dix J. Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA. Journal of Automated Reasoning, 20(1), pp.143\u2013165, 1998. Extended abstract appeared in: Characterizing DWFS: Confluence and Iterated GCWA, in Logics in Artificial Intelligence, JELIA '96 (LNCS 1126), Springer, pp. 268\u2013283, 1996.","journal-title":"Journal of Automated Reasoning"},{"key":"7_CR10","unstructured":"Brass, S., Dix, J. and Przymusinki,T., \u201cSuper logic programs,\u201d in Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR '96), (L. C. Aiello and J. Doyle and S. C. Shapiro, editors), Morgan Kaufmann, pp. 529\u2013541, 1996."},{"key":"7_CR11","unstructured":"Brewka,G., \u201cAn abductive framework for generalized logic programs,\u201d in Proceedings of the 2nd Workshop on Logic Programming and Nonmonotonic Reasoning (Marek, W. and Subrahmanian,V. eds.), MIT Press, pp. 266\u2013282, 1993."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Bry, F., \u201cNegation in logic programming: A formalization in constructive logic,\u201d in Information Systems and Artificial Intelligence: Integration Aspects (Karagiannis D. ed.), Springer, pp.30\u201346, 1990.","DOI":"10.1007\/3-540-53557-8_20"},{"key":"7_CR13","unstructured":"Dung, P., Kanchansut K., \u201cA fixpoint approach to declarative semantics of logic programs,\u201d in Proceedings of North American Conference (Lusk E. and Overbeek R. eds.), MIT Press, 1989."},{"key":"7_CR14","unstructured":"Dung,P., \u201cNegation as hypothesis: an abductive foundation to logic programming,\u201d in Proceedings of the 8th International Conference on Logic Programming, MIT Press, pp.3\u201317, 1991."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0743-1066(95)94697-X","volume":"24","author":"P. Dung","year":"1995","unstructured":"Dung,P., \u201cAn argumentation-theoretic foundation for logic programming,\u201d J. Logic Programming, 24, pp.151\u2013177, 1995.","journal-title":"J. Logic Programming"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"P. Dung","year":"1995","unstructured":"Dung,P., \u201cOn the acceptability of arguments and its fundamental roles in nonmonotonic reasoning and n-person games\u201d, Artificial Intelligence, 77, pp.321\u2013357, 1995.","journal-title":"Artificial Intelligence"},{"key":"7_CR17","unstructured":"Eshghi,K. and Kowalski,R., \u201cAbduction compared with negation by failure,\u201d in Proceedings of the 6th International Conference on Logic Programming, MIT Press, pp.234\u2013255, 1989."},{"key":"7_CR18","unstructured":"Gelfond,M. and Lifschitz,J., \u201cThe stable model semantics for logic programming,\u201d in Proceedings of the 5th Symposium on Logic Programming, MIT Press, pp.1070\u20131080, 1988."},{"key":"7_CR19","unstructured":"van Gelder,A., Ross,K. and Schlipf,J., \u201cUnfounded sets and well-founded semantics for general logic programs,\u201d in Proceedings of the 7th ACM Symposium on Principles Of Database Systems, pp.221\u2013230, 1988. Full version in J. ACM, 38, pp.620\u2013650, 1992."},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","volume":"2","author":"A. Kakas","year":"1992","unstructured":"Kakas,A., Kowalski,R. and Toni,F., \u201cAbductive logic programming,\u201d J. Logic and Computation, 2, pp.719\u2013770, 1992.","journal-title":"J. Logic and Computation"},{"key":"7_CR21","unstructured":"Kakas,A. and Mancarella,P., \u201cGeneralized stable models: a semantics for abduction,\u201d in Proceedings of the 9th European Conference Artificial Intelligence, pp.385\u2013391, 1990."},{"key":"7_CR22","unstructured":"Kakas,A. and Mancarella,P., \u201cNegation as stable hypotheses,\u201d in Proceedings of the 1st Workshop on Logic Programming and Nonmonotonic Reasoning (Marek, W. and Subrahmanian,V. eds.), MIT Press, pp.275\u2013288, 1991."},{"key":"7_CR23","unstructured":"Lifschitz,V. and Turner,H., \u201cFrom disjunctive programs to abduction,\u201d in Proceedings of the Workshop on Nonmonotonic Extensions of Logic Programming, (Dix, J., Pereira, L. and Przymunski, T. eds.), pp.111\u2013125, 1994."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Lobo,J., Minker,J. and Rajasekar,A., Foundations of Disjunctive Logic Programming, MIT Press, 1992.","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Minker,J., \u201cOn indefinite databases and the closed world assumption\u201d, in LNCS 138, Springer, pp.292\u2013308, 1982.","DOI":"10.1007\/BFb0000066"},{"key":"7_CR26","first-page":"1","volume":"12","author":"J. Minker","year":"1994","unstructured":"Minker,J., \u201cOverview of disjunctive logic programming,\u201d Ann. Math. AI., 12, pp.1\u201324, 1994.","journal-title":"Ann. Math. AI."},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","volume":"9","author":"J. Minker","year":"1990","unstructured":"Minker,J. and Rajasekar,A., A fixed point semantics for disjunctive logic programs,\u201d J. Logic Programming, 9, 45\u201374, 1990.","journal-title":"J. Logic Programming"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. Przymunski","year":"1991","unstructured":"Przymunski,T., \u201cStable semantics for disjunctive programs,\u201d New Generation Computing, 9, pp.401\u2013424, 1991.","journal-title":"New Generation Computing"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Przymunski,T., \u201cStationary semantics for disjunctive logic programs and deductive databases,\u201d in Proceedings of the North American Conference on Logic Programming (Debray, S. and Hemenegildo, M. eds.), MIT Press, pp.42\u201359, 1991.","DOI":"10.1007\/3-540-55015-1_5"},{"key":"7_CR30","first-page":"323","volume":"14","author":"T. Przymunski","year":"1995","unstructured":"Przymunski,T., \u201cStatic semantics of logic programs,\u201d Ann. Math. AI., 14, 323\u2013357, 1995.","journal-title":"Ann. Math. AI."},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF00248321","volume":"5","author":"A. Rajasekar","year":"1989","unstructured":"Rajasekar,A., Lobo,J., and Minker,J., \u201cWeak Generalized Closed World assumption\u201d, Journal of Automated Reasoning, 5, pp.293\u2013307, 1989.","journal-title":"Journal of Automated Reasoning"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Ross,K. \u201cWell-founded semantics for disjunctive logic programming.\u201d Proceedings of the first Conference on Deductive and Object-Oriented Databases, pp.337\u2013351, 1989.","DOI":"10.1016\/B978-0-444-88433-6.50029-0"},{"key":"7_CR33","unstructured":"Sakama,C., \u201cPossible model semantics for disjunctive databases\u201d, in Proc. the First Int'l Conf. on Deductive and Object Oriented Databases, pp.1055\u20131060, 1989."},{"key":"7_CR34","unstructured":"Sakama,C. and Inoue,K., \u201cOn the equivalence between disjunctive and abductive logic programming,\u201d in Proceedings of the 11th International Conference on Logic Programming (Van Hentenryck ed.), MIT Press, pp.489\u2013503, 1994."},{"key":"7_CR35","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski,A., \u201cA lattice-theoretic fixpoint theorem and its applications,\u201d Pacific J. Math., 5, pp.285\u2013309, 1955.","journal-title":"Pacific J. Math."},{"key":"7_CR36","unstructured":"Torres,A., \u201cNegation as failure to support,\u201d in Proceedings of the 2nd International Workshop on Logic Programming and Nonmonotonic Reasoning (Marek, W. and Subrahmanian, V. eds.), MIT Press, pp.223\u2013243, 1993."},{"key":"7_CR37","first-page":"37","volume":"14","author":"A. Torres","year":"1995","unstructured":"Torres,A., \u201cA nondeterministic semantics,\u201d J. Math. AI., 14, pp.37\u201373, 1995.","journal-title":"J. Math. AI"},{"key":"7_CR38","unstructured":"Wang,K., \u201cAbduction and Disjunctive Logic Programming,\u201d Ph. D. Thesis (in Chinese, Abstract in English), Nankai University, March 1996."},{"key":"7_CR39","unstructured":"Wang,K., \u201cAn argumentation-based semantic framework for bi-disjunctive logic programs,\u201d Tech. report NUDT97-14, Changsha Institute of Technology, 1997."},{"issue":"3","key":"7_CR40","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02943187","volume":"13","author":"Kewen Wang","year":"1998","unstructured":"Wang,K., Chen,H. and Wu,Q., \u201cThe least fixpoint transformation for disjunctive logic programs,\u201d Journal of Computer Science and Technology, 13(3), pp.193\u2013201.","journal-title":"Journal of Computer Science and Technology"},{"key":"7_CR41","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00244994","volume":"1","author":"A. Yahya","year":"1985","unstructured":"Yahya,A. and Henschen,L., \u201cDeduction in non-Horn databases,\u201d J. Automated Reasoning, 1, pp.141\u2013160, 1985.","journal-title":"J. Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Knowledge Representation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T02:54:22Z","timestamp":1683514462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649588","9783540498728"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/bfb0054794","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}