{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:40Z","timestamp":1725664780336},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616306"},{"type":"electronic","value":"9783540706434"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61630-6_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:08:56Z","timestamp":1330294136000},"page":"252-267","source":"Crossref","is-referenced-by-count":8,"title":["An abductive framework for negation in disjunctive logic programming"],"prefix":"10.1007","author":[{"given":"Chandrabose","family":"Aravindan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF00881948","volume":"13","author":"P. Baumgartner","year":"1994","unstructured":"P. Baumgartner and U. Furbach. Model Elimination without Contrapositives and its Application to PTTP. Journal of Automated Reasoning, 13:339\u2013359, 1994. Short version in: Proceedings of CADE-12, Springer LNAI 814, 1994, pp 87\u2013101.","journal-title":"Journal of Automated Reasoning"},{"key":"18_CR2","unstructured":"P. Baumgartner, U. Furbach, and F. Stolzenburg. Model Elimination, Logic Programming and Computing Answers. In 14th International Joint Conference on Artificial Intelligence (IJCAI 95), volume 1, 1995. (Long version in: Research Report 1\/95, University of Koblenz, Germany. To appear in Artificial Intelligence)."},{"key":"18_CR3","volume-title":"Technical report","author":"M. Denecker","year":"1995","unstructured":"Marc Denecker and Danny De Schreye. Sldnfa: an abductive procedure for normal abductive programs. Technical report, Department of Computer Science, K. U. Leuven, Belgium, 1995."},{"key":"18_CR4","unstructured":"Phan Minn Dung. Negation as hypotheses: an abductive foundation for logic programming. In K. Furukawa, editor, Proceedings of International Conference on Logic Programming, pages 3\u201317. The MIT Press, 1991."},{"key":"18_CR5","unstructured":"Phan Minh Dung. Acyclic disjunctive logic programs with abductive procedure as proof procedure. In Proceedings of the International conference on Fifth Generation Computer Systems, pages 555\u2013561. ICOT, 1992."},{"key":"18_CR6","volume-title":"Technical report","author":"P. M. Dung","year":"1995","unstructured":"Phan Minh Dung. An abductive procedure for disjunctive logic programming. Technical report, Computer Science Program, Asian Institute of Technology, Bangkok, Thailand, 1995."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Thomas Eiter and Georg Gottlob. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15:289\u2013323, 1995.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"18_CR8","unstructured":"K. Eshghi and R. A. Kowalski. Abduction compared with negation by failure. In G. Levi and M. Martelli, editors, Proceedings of International Conference on Logic Programming, pages 234\u2013254. The MIT Press, 1989."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Melvin Fitting. First-order logic and automated theorem proving. Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4684-0357-2"},{"key":"18_CR10","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":"18_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","volume":"38","author":"M. Gelfond","year":"1989","unstructured":"Michael Gelfond, Halina Przymusinska, and Teodor Przymusinski. On the relationship between circumscription and negation as failure. Artificial Intelligence, 38:75\u201394, 1989.","journal-title":"Artificial Intelligence"},{"key":"18_CR12","unstructured":"Katsumi Inoue and Nicolas Helft. On theorem provers for circumscription. In P.F. Schneider, editor, Proceedings of the eighth biennial conference of the Canadian society for computational studies of intelligence, pages 212\u2013219. Morgan-Kaufmann Publishers, 1990. Revised version."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0004-3702(92)90030-2","volume":"56","author":"K. Inoue","year":"1992","unstructured":"Katsumi Inoue. Linear resolution for consequence finding. Artificial Intelligence, 56:301\u2013353, 1992.","journal-title":"Artificial Intelligence"},{"issue":"6","key":"18_CR14","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","volume":"2","author":"A. C. Kakas","year":"1993","unstructured":"A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. Journal of logic and computation, 2(6):719\u2013770, 1993.","journal-title":"Journal of logic and computation"},{"key":"18_CR15","volume-title":"Technical report","author":"A. C. Kakas","year":"1995","unstructured":"A. C. Kakas, R. A. Kowalski, and F. Toni. The role of abduction in logic programming. Technical report, Department of Computing, Imperial College, London, U.K., 1995."},{"key":"18_CR16","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":"18_CR17","unstructured":"Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of disjunctive logic programming. MIT Press, 1992."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Jack Minker. On indefinite databases and the closed world assumption. In Lecture notes in computer science 138, pages 292\u2013308. Springer-Verlag, 1982.","DOI":"10.1007\/BFb0000066"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Ilkka Niemel\u00e4. A tableau calculus for minimal model reasoning. In P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, Proceedings of the fifth workshop on theorem proving with analytic tableaux and related methods, pages 278\u2013294. LNAI 1071, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61208-4"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","volume":"38","author":"T. C. Przymusinski","year":"1989","unstructured":"Teodor C. Przymusinski. An algorithm to compute circumscription. Artificial Intelligence, 38:49\u201373, 1989.","journal-title":"Artificial Intelligence"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF00248321","volume":"5","author":"A. Rajasekar","year":"1989","unstructured":"Arcot Rajasekar, Jorge Lobo, and Jack Minker. Weak generalized closed world assumption. Journal of Automated Reasoning, 5:293\u2013307, 1989.","journal-title":"Journal of Automated Reasoning"},{"issue":"2","key":"18_CR22","doi-asserted-by":"publisher","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(2):397\u2013424, 1988.","journal-title":"Journal of Automated Reasoning"},{"key":"18_CR23","unstructured":"Chiaki Sakama and Katsumi Inoue. On the equivalence between disjunctive and abductive logic programs. In Pascal Van Hentenryck, editor, Proceedings of International Conference on Logic Programming, pages 489\u2013503. The MIT Press, 1994."},{"issue":"2","key":"18_CR24","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61630-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:53Z","timestamp":1605647333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61630-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616306","9783540706434"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-61630-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}