{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:22Z","timestamp":1725569962453},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425939"},{"type":"electronic","value":"9783540454021"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45402-0_10","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T17:10:11Z","timestamp":1290186611000},"page":"133-146","source":"Crossref","is-referenced-by-count":0,"title":["A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs"],"prefix":"10.1007","author":[{"given":"Kewen","family":"Wang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,17]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1005952908693","volume":"20","author":"S. Brass","year":"1998","unstructured":"S. Brass, J. Dix. Characterizations of the DisjunctiveWell-founded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning, 20(1):143\u2013165, 1998. 133","journal-title":"Journal of Automated Reasoning"},{"issue":"3","key":"10_CR2","first-page":"167","volume":"38","author":"S. Brass","year":"1999","unstructured":"S. Brass, J. Dix. Semantics of disjunctive logic programs based on partial evaluation. Journal of Logic programming, 38(3):167\u2013312, 1999. 133, 135, 138, 139, 140, 141, 143, 145","journal-title":"Journal of Logic programming"},{"issue":"1-2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0304-3975(00)00045-1","volume":"258","author":"S. Brass","year":"2001","unstructured":"S. Brass, J. Dix, I. Niemel\u00e4, T. Przymusinski. On the equivalence of the Static and Disjunctive Well-founded Semantics and its computation. Theoretical Computer Science, 258(1-2): 523\u2013553, 2001. 134, 140","journal-title":"Theoretical Computer Science"},{"key":"10_CR4","series-title":"Lect Notes Comput Sci","first-page":"30","volume-title":"Information Systems and Artificial Intelligence: Integration Aspects","author":"F. Bry","year":"1990","unstructured":"F. Bry. Negation in logic programming: A formalization in constructive logic. In: D. Karagiannis ed. Information Systems and Artificial Intelligence: Integration Aspects (LNCS 474), Springer, pages 30\u201346, 1990. 141"},{"issue":"1-2","key":"10_CR5","first-page":"59","volume":"19","author":"T. Eiter","year":"1997","unstructured":"T. Eiter, N. Leone and D. Sacca. On the partial semantics for disjunctive deductive databases. Annals of Math. and AI., 19(1-2): 59\u201396, 1997. 134, 143, 144, 145","journal-title":"Annals of Math. and AI."},{"key":"10_CR6","unstructured":"M. Gelfond, V. Lifschitz. The stable model semantics for logic programming. In: Proceedings of the 5th Symposium on Logic Programming, MIT Press, pages 1070\u20131080, 1988. 133, 136"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/inco.1997.2630","volume":"135","author":"N. Leone","year":"1997","unstructured":"N. Leone, P. Rullo and F. Scarcello. Disjunctive stable models: unfounded sets, fixpoint semantics, and computation. Information and Computation, 135(2): 69\u2013112, 1997. 134, 143, 144, 145","journal-title":"Information and Computation"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"J. Lobo, J. Minker and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992. 133, 134","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"10_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0000066","volume-title":"On indefinite databases and the closed world assumption","author":"J. Minker","year":"1982","unstructured":"J. Minker. On indefinite databases and the closed world assumption. LNCS 138, pages 292\u2013308, 1982. 134, 138, 145"},{"key":"10_CR10","first-page":"323","volume":"14","author":"T. Przymusinski","year":"1995","unstructured":"T. Przymusinski. Static semantics of logic programs. Annals of Math. and AI., 14: 323\u2013357, 1995. 133","journal-title":"Annals of Math. and AI."},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(92)90019-Y","volume":"13","author":"K. Ross","year":"1992","unstructured":"K. Ross. A procedural semantics for well-founded negation in logic programs. Journal of Logic programming, 13(1): 1\u201322, 1992. 134","journal-title":"Journal of Logic programming"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"A. Van Gelder, K. A. Ross and J. Schlipf. The well-founded semantics for general logic programs. J. ACM, 38(3): 620\u2013650, 1991. 133, 134, 143","journal-title":"J. ACM"},{"issue":"1-3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0743-1066(00)00004-2","volume":"45","author":"K. Wang","year":"2000","unstructured":"K. Wang. Argumentation-based abduction in disjunctive logic programming. Journal of Logic programming, 45(1-3): 105\u2013141, 2000. 133, 134, 136, 140, 145","journal-title":"Journal of Logic programming"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"K. Wang. A top-down procedure for disjunctive well-founded semantics. In: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR\u2019 01), Springer, 2001. 134, 145","DOI":"10.1007\/3-540-45744-5_22"},{"issue":"1-3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0743-1066(99)00074-6","volume":"44","author":"J. You","year":"2000","unstructured":"J. You, L. Yuan and R. Goebel. An abductive approach to disjunctive logic programming. Journal of Logic programming, 44(1-3): 101\u2013127, 2000. 136","journal-title":"Journal of Logic programming"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45402-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T16:18:07Z","timestamp":1636820287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45402-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425939","9783540454021"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45402-0_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}