{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:53Z","timestamp":1725664673634},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594871"},{"type":"electronic","value":"9783540492825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59487-6_26","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:19:33Z","timestamp":1330276773000},"page":"358-371","source":"Crossref","is-referenced-by-count":1,"title":["Stable classes and operator pairs for disjunctive programs"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Kalinski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Chitta Baral and V. S. Subrahmanian. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. In LPNMR91 [8], pages 69\u201386.","DOI":"10.1007\/BF00881799"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02341854","volume":"8","author":"C. R. Baral","year":"1992","unstructured":"Chitta R. Baral and V. S. Subrahmanian. Stable and extension class theory for logic programs and default logics. Journal of Automated Reasoning, 8:345\u2013366, 1992.","journal-title":"Journal of Automated Reasoning"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0743-1066(93)90031-B","volume":"17","author":"M. Fitting","year":"1993","unstructured":"Melvin Fitting. The family of stable models. Journal of Logic Programming, 17:197\u2013225, 1993.","journal-title":"Journal of Logic Programming"},{"key":"26_CR4","unstructured":"Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th Int. Conf. and Symp. on Logic Programming, pages 1070\u20131080. MIT Press, 1988."},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365\u2013385, 1991.","journal-title":"New Generation Computing"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"J\u00fcrgen Kalinski. Weak Autoepistemic Reasoning \u2014 A Study in Autoepistemic Reasoning from a Logic Programming Perspective. PhD thesis, Universit\u00e4t Bonn, 1994.","DOI":"10.1007\/3-540-58107-3_11"},{"key":"26_CR7","unstructured":"Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992."},{"key":"26_CR8","unstructured":"Proc. of the 1st Int. Workshop on Logic Programming and Non-monotonic Reasoning. MIT Press, 1991."},{"issue":"3","key":"26_CR9","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"Wiktor Marek and Miroslaw Truszczy\u0144ski. Autoepistemic logic. Journal of the ACM, 38(3):588\u2013619, 1991.","journal-title":"Journal of the ACM"},{"key":"26_CR10","unstructured":"Wiktor Marek and Miroslaw Truszczy\u0144ski. Computing intersection of autoepistemic expansions. In LPNMR91 [8], pages 37\u201350."},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","volume":"9","author":"J. Minker","year":"1990","unstructured":"Jack Minker and Arcot Rajasekar. A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming, 9:45\u201374, 1990.","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"26_CR12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R. C. Moore","year":"1985","unstructured":"Robert C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25(4):75\u201394, 1985.","journal-title":"Artificial Intelligence"},{"key":"26_CR13","unstructured":"Teodor C. Przymusinski. Extended stable semantics for normal and disjunctive programs. In Proc. of the 7th Int. Conf. on Logic Programming, pages 459\u2013477. MIT Press, 1990."},{"key":"26_CR14","unstructured":"Teodor C. Przymusinski. Autoepistemic logics of closed beliefs and logic programming. In LPNMR91 [8], pages 3\u201320."},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. C. Przymusinski","year":"1991","unstructured":"Teodor C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401\u2013424, 1991.","journal-title":"New Generation Computing"},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00297247","volume":"4","author":"K. A. Ross","year":"1988","unstructured":"K. A. Ross and R. W. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4:397\u2013424, 1988.","journal-title":"Journal of Automated Reasoning"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Dietmar Seipel. Non-monotonic reasoning based on minimal models and its efficient implementation. In Bernd Wolfmger, editor, Innovationen bei Rechen-und Kommunikationssystemen, GI-Fachgespr\u00e4ch: Disjunctive logic programming and disjunctive databases, pages 53\u201360. Springer, 1994.","DOI":"10.1007\/978-3-642-51136-3_8"},{"key":"26_CR18","unstructured":"Bart Selman and Henry Kautz. Knowledge compilation using Horn approximations. In Proc. of the 9th National Conf. on Artificial Intelligence, pages 904\u2013909, 1991."},{"issue":"4","key":"26_CR19","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. Journal of the ACM, 23(4):733\u2013742, 1976.","journal-title":"Journal of the ACM"},{"issue":"3","key":"26_CR20","doi-asserted-by":"crossref","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. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620\u2013650, 1991.","journal-title":"Journal of the ACM"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Allen Van Gelder. The alternating fixpoint of logic programs with negation. In Proc. of the 8th Symp. on Principles of Database Systems, pages 1\u201310, 1989.","DOI":"10.1145\/73721.73722"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59487-6_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:27:24Z","timestamp":1605648444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59487-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594871","9783540492825"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-59487-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}