{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T12:06:23Z","timestamp":1749125183643},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545637"},{"type":"electronic","value":"9783540384663"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54563-8_109","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:03:15Z","timestamp":1330192995000},"page":"459-468","source":"Crossref","is-referenced-by-count":15,"title":["WF 3: A semantics for negation in normal disjunctive logic programs"],"prefix":"10.1007","author":[{"given":"Chitta","family":"Baral","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Lobo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Minker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"46_CR1","volume-title":"Technical Report UMIACS TR 90-39, CS TR 2436","author":"C. Baral","year":"1989","unstructured":"C. Baral, J. Lobo, and J. Minker. Generalized disjunctive well-founded semantics for logic programs. Technical Report UMIACS TR 90-39, CS TR 2436, Dept of Computer Science, University of Maryland, College Park Md 20742, March 1989. Shorter versions appear in ISMIS 90."},{"key":"46_CR2","volume-title":"Technical Report CS-TR-2330","author":"C. Baral","year":"1989","unstructured":"C. Baral, J. Lobo, and J. Minker. Generalized well-founded semantics for logic programs. Technical Report CS-TR-2330, Dept of Computer Science, University of Maryland, College Park Md 20742, 1989. Presented in the 10th International Conference on Automated Deduction, West Germany, July 90 (CADE 90)."},{"unstructured":"C. Baral and V. S. Subrahmanian. Stable and Extension Class Theory for Logic Programs and Default Logics. Technical Report CS-TR-2402, Dept of Computer Science, University of Maryland, February 1990. Presented in the Third International Workshop in Non-monotonic reasoning, South Lake Tahoe, May 90 and extended version to appear in Journal of Automated Reasoning.","key":"46_CR3"},{"unstructured":"M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In R.A. Kowalski and K.A. Bowen, editors, Proc. 5th International Conference and Symposium on Logic Programming, pages 1070\u20131080, Seattle, Washington, August 15\u201319, 1988.","key":"46_CR4"},{"doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.","key":"46_CR5","DOI":"10.1007\/978-3-642-83189-8"},{"doi-asserted-by":"crossref","unstructured":"J. Minker. On Indefinite Databases and the Closed World Assumption. In Lecture Notes in Computer Science 138, pages 292\u2013308. Springer-Verlag, 1982.","key":"46_CR6","DOI":"10.1007\/BFb0000066"},{"doi-asserted-by":"crossref","unstructured":"J. Minker and A. Rajasekar. A Fixpoint Semantics for Non-Horn Logic Programs. Journal of Logic Programming, 1990.","key":"46_CR7","DOI":"10.1016\/0743-1066(90)90033-2"},{"unstructured":"T. Przymusinski. Extended Stable Semantics for Normal and Disjunctive Logic Programs. In Proc. 7th International Conference on Logic Programming, Jerusalem, Israel, 1990.","key":"46_CR8"},{"key":"46_CR9","volume-title":"Research report","author":"T. Przymusinski","year":"1990","unstructured":"T. Przymusinski. Stationary semantics for disjunctive logic programs and deductive databases, 1990. Research report, University of texas at El Paso."},{"doi-asserted-by":"crossref","unstructured":"T.C. Przymusinski. Every Logic Program has a Natural Stratification and an Iterated Fixed Point Model. In \u201cProceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems\u201d, pages 11\u201321, 1989.","key":"46_CR10","DOI":"10.1145\/73721.73723"},{"doi-asserted-by":"crossref","unstructured":"D. Sacca and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In Proc. of Principle of Database Systems, pages 205\u2013217, 1990.","key":"46_CR11","DOI":"10.1145\/298514.298572"},{"doi-asserted-by":"crossref","unstructured":"A. Van Gelder, K. Ross, and J.S. schlipf. Unfounded Sets and Well-founded Semantics for General Logic Programs. In Proc. 7th Symposium on Principles of Database Systems, pages 221\u2013230, 1988. to appear in JACM.","key":"46_CR12","DOI":"10.1145\/308386.308444"}],"container-title":["Lecture Notes in Computer Science","Methodologies for Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54563-8_109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:55:39Z","timestamp":1605628539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54563-8_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545637","9783540384663"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-54563-8_109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}