{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:55Z","timestamp":1725664675860},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_17","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:18:42Z","timestamp":1330276722000},"page":"231-244","source":"Crossref","is-referenced-by-count":3,"title":["On the extension of logic programming with negation through uniform proofs"],"prefix":"10.1007","author":[{"given":"Li Yan","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Jia Huai","family":"You","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02341854","volume":"8","author":"C. R. Baral","year":"1992","unstructured":"C. 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":"17_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0004-3702(91)90099-6","volume":"50","author":"G. Brewka","year":"1994","unstructured":"G. Brewka. Cumulative default logic: in defense of nonmonotonic inference rules. Artificial Intelligence, 50:183\u2013205, 1994.","journal-title":"Artificial Intelligence"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"J. Dix. A classification theory of semantics of normal logic programs: II. weak properties. to appear, 1994.","DOI":"10.3233\/FI-1995-2234"},{"key":"17_CR4","unstructured":"P. M. Dung. Negations as hypotheses: an abductive foundation for logic programming. In Proceedings of the 8th ICLP, pages 3\u201317, 1991."},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365\u2013386, 1991.","journal-title":"New Generation Computing"},{"key":"17_CR6","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th ICLP, pages 1070\u20131080, The MIT Press, 1988."},{"key":"17_CR7","unstructured":"A. Kakas, P. Mancarella, and P.M. Dung. The acceptability semantics for logic programs. In Proc. 11th ICLP, pages 504\u2013519, 1994."},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125\u2013157, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(94)90201-1","volume":"122","author":"L.M. Pereira","year":"1993","unstructured":"L.M. Pereira, J.J. Alferes, C.V. Damasio, and J.N. Aparicio. Adding closed world assumptions to well-founded semantics. Theoretical Computer Science, 122:49\u201368, 1993.","journal-title":"Theoretical Computer Science"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"T. C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193\u2013216, Morgan Kaufmann Publishers, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"17_CR11","unstructured":"T. C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial intelligence, 1994. (To appear)."},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T. C. Przymusinski","year":"1990","unstructured":"T. C. Przymusinski. Well-founded semantics coincides with three-valued stable semantics. Foundamenta Informaticae, 13:445\u2013463, 1990.","journal-title":"Foundamenta Informaticae"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00881915","volume":"13","author":"C. Sakama","year":"1994","unstructured":"C. Sakama and K. Inoue. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning, 13:145\u2013172, 1994.","journal-title":"Journal of Automated Reasoning"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01543479","volume":"5","author":"J.S. Schlipf","year":"1992","unstructured":"J.S. Schlipf. Formalizing a logic for logic programming. Annals of Mathematics and Artificial Intelligence, 5:279\u2013302, 1992.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"17_CR15","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. Ross, and J. Schlipf. The well-founded semantics for general logic programs. JACM, 38:620\u2013650, 1991.","journal-title":"JACM"},{"issue":"3","key":"17_CR16","first-page":"209","volume":"22","author":"J.-H. You","year":"1995","unstructured":"J.-H. You and L. Y. Yuan. On the equivalence of semantics for normal logic programs. Journal of Logic Programming, 22(3):209\u2013219, 1995.","journal-title":"Journal of Logic Programming"},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/S0022-0000(05)80053-4","volume":"49","author":"J.-H. You","year":"1994","unstructured":"J.-H. You and L. Y. Yuan. A three-valued semantics of deductive databases and logic programs. Journal of Computer and System Science, 49:334\u2013361, 1994. The preliminary version appears in the Proc. of the 9th ACM PODS, page 171\u2013182, 1990.","journal-title":"Journal of Computer and System Science"},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF00881912","volume":"13","author":"L. Y. Yuan","year":"1994","unstructured":"L. Y. Yuan. Autoepistemic logic of first order and its expressive power. Journal of Automated Reasoning, 13:69\u201382, 1994.","journal-title":"Journal of Automated Reasoning"},{"key":"17_CR19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00881833","volume":"10","author":"L. Y. Yuan","year":"1993","unstructured":"L. Y. Yuan and J.-H. You. Autoepistemic circumscription and logic programming. Journal of Automated Reasoning, 10:143\u2013160, 1993.","journal-title":"Journal of Automated Reasoning"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"L.Y. Yuan and J.-H. You. On coherence approach to logic program revision. In Proc. of the 12th ICLP, 1995.","DOI":"10.7551\/mitpress\/4298.003.0025"}],"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_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T16:33:25Z","timestamp":1713630805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59487-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594871","9783540492825"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-59487-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}