{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:14:39Z","timestamp":1725488079952},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651413"},{"type":"electronic","value":"9783540495451"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49545-2_3","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T14:41:28Z","timestamp":1186411288000},"page":"33-46","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Disjunctive Logic Program = Horn Program + Control Program"],"prefix":"10.1007","author":[{"given":"Wenjin","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Furbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,2,26]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Chandrabose Aravindan. An abductive framework for negation in disjunctive logic programming. In J. J. Alferes, L. M. Pereira, and E. Orlowska, editors, Proceedings of Joint European workshop on Logics in AI, number 1126 in Lecture Notes in Artificial Intelligence, pages 252\u2013267. Springer-Verlag, 1996. A related report is available on the web from <\n                    http:\/\/www.unikoblenz.de\/~arvind\/papers\/\n                    \n                  >.","DOI":"10.1007\/3-540-61630-6_18"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Peter Baumgartner and Ulrich Furbach. PROTEIN: A PROver with a Theory Extension I nterface. In A. Bundy, editor, Automated Deduction-CADE-12, volume 814 of Lecture Notes in Artificial Intelligence, pages 769\u2013773. Springer, 1994. Available in the WWW, URL: \n                    http:\/\/www.uni-koblenz.de\/ag-ki\/Systems\/PROTEIN\/\n                    \n                  .","DOI":"10.1007\/3-540-58156-1_57"},{"key":"3_CR3","volume-title":"Logic Programming-Proceedings of the 1997 International Symposium","author":"P. Baumgartner","year":"1997","unstructured":"Peter Baumgartner and Ulrich Furbach. Calculi for Disjunctive Logic Programming. In Jan Maluszynski, editor, Logic Programming-Proceedings of the 1997 International Symposium, Port Jefferson, New York, 1997. The MIT Press."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Peter Baumgartner, Ulrich Furbach, and Ilkka Niemel\u00e4. Hyper Tableaux. In Proc. JELIA 96, number 1126 in Lecture Notes in Artificial Intelligence. European Workshop on Logic in AI, Springer, 1996.","DOI":"10.1007\/3-540-61630-6_1"},{"issue":"1\u20132","key":"3_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0004-3702(96)00042-2","volume":"90","author":"P. Baumgartner","year":"1997","unstructured":"Peter Baumgartner, Ulrich Furbach, and Frieder Stolzenburg. Computing Answers with Model Elimination. Artificial Intelligence, 90(1\u20132):135\u2013176, 1997.","journal-title":"Artificial Intelligence"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0004-3702(89)90026-X","volume":"39","author":"M. L. Ginsberg","year":"1989","unstructured":"Matthew L. Ginsberg. A circumscriptive theorem prover. Artificial Intelligence, 39:209\u2013230, 1989.","journal-title":"Artificial Intelligence"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","volume":"38","author":"M. Gelfond","year":"1989","unstructured":"M. Gelfond, H. Przymusinska, and T. Przymusinski. On the relationship between circumscription and negation as failure. Artificial Intelligence, 38:75\u201394, 1989.","journal-title":"Artificial Intelligence"},{"key":"3_CR8","first-page":"400","volume-title":"The 11th International Conference on Automated Deduction","author":"K. Inoue","year":"1992","unstructured":"K. Inoue, M. Koshimura, and R. Hasegawa. Embedding negation as failure into a model generation theorem prover. In The 11th International Conference on Automated Deduction, pages 400\u2013415, Saratoga Springs, NY, USA, June 1992. Springer-Verlag."},{"key":"3_CR9","unstructured":"V. Lifschitz. Computing circumscription. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 121\u2013127, Los Angeles, California, USA, August 1985. Morgan Kaufmann Publishers."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second extended edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"3_CR11","unstructured":"Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of disjunctive logic programming. MIT Press, 1992."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00249353","volume":"7","author":"D. Loveland","year":"1991","unstructured":"D. Loveland. Near-Horn Prolog and Beyond. Journal of Automated Reasoning, 7:1\u201326, 1991.","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00881861","volume":"14","author":"D. Loveland","year":"1995","unstructured":"D. Loveland, D. Reed, and D. Wilson. SATCHMORE: SATCHMO with RElevance. Journal of Automated Reasoning, 14:325\u2013351, 1995.","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Wenjin Lu. Minimal model generation based on e-hyper tableau. In Cristopher Habel Gerhard Brewka and Bernhard Nebel, editors, Proceedings of KI\u201997, number 1303 in Lecture Notes in Artificial Intelligence, pages 99\u2013110. Springer-Verlag, 1997.","DOI":"10.1007\/3540634932_7"},{"key":"3_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BFb0012847","volume-title":"Proceedings of the 9 th Conference on Automated Deduction, Argonne, Illinois, May 1988","author":"R. Manthey","year":"1988","unstructured":"Rainer Manthey and Fran\u00e7ois Bry. SATCHMO: a theorem prover implemented in Prolog. In Ewing Lusk and Ross Overbeek, editors, Proceedings of the 9\n                           th\n                           Conference on Automated Deduction, Argonne, Illinois, May 1988, volume 310 of Lecture Notes in Computer Science, pages 415\u2013434. Springer, 1988."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"J. McCarthy. Circumscription\u2014a form of non-monotonic reasoning. Artificial Intelligence, 13:27\u201339, 1980.","journal-title":"Artificial Intelligence"},{"key":"3_CR17","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":"Jack Minker. On indefinite databases and the closed world assumption. In Lecture Notes in Computer Science 138, pages 292\u2013308. Springer-Verlag, 1982."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"I. Niemel\u00e4. A tableau calculus for minimal model reasoning. In Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 278\u2013294, Terrasini, Italy, May 1996. Springer-Verlag.","DOI":"10.1007\/3-540-61208-4_18"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1006\/inco.1995.1005","volume":"116","author":"A. Nerode","year":"1995","unstructured":"A. Nerode, R.T. Ng, and V.S. Subrahmanian. Computing circumscriptive databases: I. theory and algorithms. Information and Computation, 116:58\u201380, 1995.","journal-title":"Information and Computation"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00247828","volume":"9","author":"N. Olivetti","year":"1992","unstructured":"N. Olivetti. A tableaux and sequent calculus for minimal entailment. Journal of Automated Reasoning, 9:99\u2013139, 1992.","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","volume":"38","author":"T.C. Przymusinski","year":"1989","unstructured":"T.C. Przymusinski. An algorithm to compute circumscription. Artificial Intelligence, 38:49\u201373, 1989.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00244994","volume":"1","author":"A. Yahya","year":"1985","unstructured":"A. Yahya and L. J. Henschen. Deduction in non-horn databases. Journal of Automated Reasoning, 1(2):141\u2013160, 1985.","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49545-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:01:24Z","timestamp":1558260084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49545-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651413","9783540495451"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-49545-2_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 February 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}