{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:46Z","timestamp":1725663346609},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540528852"},{"type":"electronic","value":"9783540471714"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52885-7_82","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:47:29Z","timestamp":1330206449000},"page":"102-116","source":"Crossref","is-referenced-by-count":8,"title":["Generalized well-founded semantics for 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,6,9]]},"reference":[{"key":"8_CR1","unstructured":"C. Baral, J. Lobo, and J. Minker. Generalized disjunctive well-founded semantics for logic programs: Declarative semantics. Submitted to ICLP 90."},{"key":"8_CR2","unstructured":"J. Chomicki and V. S. Subrahmanian. Generalized closed world assumption is \u03c00 2 complete. Technical Report TR 89-036, Department of Computer Science, University of North Carolina at Chapel Hill, October 1989."},{"key":"8_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":"8_CR4","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0000066","volume":"138","author":"J. Minker","year":"1982","unstructured":"J. Minker. On Indefinite Databases and the Closed World Assumption. In Lecture Notes in Computer Science 138, pages 292\u2013308. Springer-Verlag, 1982.","journal-title":"Lecture Notes in Computer Science"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"J. Minker and A. Rajasekar. A Fixpoint Semantics for Disjunctive Logic Programs, 1990. To appear in Journal of Logic Programming.","DOI":"10.1016\/0743-1066(90)90033-2"},{"key":"8_CR7","unstructured":"H. Przymusinska and G. Przymusinski. Weakly Perfect Model semantics For Logic Programs, December 1986. Extended Abstract."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"T.C. Przymusinski. Every Logic Program has a Natural Stratification and an Iterated Fixed Point Model. In \u201dProceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems\u201d, pages 11\u201321, 1989.","DOI":"10.1145\/73721.73723"},{"key":"8_CR9","unstructured":"A. Rajasekar. Semantics for Disjunctive Logic Programs. PhD thesis, University of Maryland, Department of Computer Science, 1989."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"J.C. Shepherdson. Negation in Logic Programming. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 19\u201388. Morgan Kaufman Pub., 1988.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"issue":"4","key":"8_CR11","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden van","year":"1976","unstructured":"M.H. van Emden and R.A. Kowalski. The Semantics of Predicate Logic as a Programming Language. J.ACM, 23(4):733\u2013742, 1976.","journal-title":"J.ACM"},{"key":"8_CR12","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.","DOI":"10.1145\/308386.308444"}],"container-title":["Lecture Notes in Computer Science","10th International Conference on Automated Deduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52885-7_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:36Z","timestamp":1605648336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52885-7_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528852","9783540471714"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-52885-7_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}