{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:44Z","timestamp":1725455684079},"publisher-location":"Berlin\/Heidelberg","reference-count":27,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540545646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023315","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:53:34Z","timestamp":1132379614000},"page":"13-37","source":"Crossref","is-referenced-by-count":1,"title":["Cumulativity and rationality in semantics of normal logic programs"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Dix","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"K. Apt, H. Blair, and A. Walker. \u201cTowards a theory of declarative knowledge\u201d. In Jack Minker, editor, Foundations of Deductive Databases, chapter 2, pages 89\u2013148. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"2_CR2","volume-title":"Rapport de Recherche 437","author":"N. Bidoit","year":"1988","unstructured":"Nicole Bidoit and Christine Froidevaux. \u201cNegation by Default and non stratifiable logic Programs\u201d. Rapport de Recherche 437, Universite de Paris Sud, Centre d'Orsay, L.R.I. Batiment 490 91405 Orsay-France, September 1988."},{"key":"2_CR3","unstructured":"Nicole Bidoit and Christine Froidevaux. \u201cGeneral logical Databases and Programs: Default Logic Semantics and Stratification\u201d. Information and Computation, to appear, 1989."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chitta Baral, Jorge Lobe, and Jack Minker. \u201cGeneralized Well-founded Semantics for Logic Programs\u201d. In M. E. Stickel, editor, 10th International Conference on Automated Deduction, LNAI 449, subseries LNCS, pages 102\u2013116. Springer, J. Siekmann, July 1990.","DOI":"10.21236\/ADA232064"},{"key":"2_CR5","unstructured":"Gerhard Brewka, David Makinson, and Karl Schlechta. \u201cA Cumulative Inference Relation for JTMS and Logic Programming\u201d. this Volume."},{"key":"2_CR6","volume-title":"PhD thesis","author":"G. Brewka","year":"1989","unstructured":"Gerhard Brewka. \u201cNonmonotonic Reasoning: From Theoretical Foundation to Efficient Computation\u201d. PhD thesis, GMD Bonn, 1989."},{"key":"2_CR7","unstructured":"Gerhard Brewka. \u201cCumulative Default Logic: In Defense of Nonmonotonic Inference Rules\u201d. In H. Freitag G. Brewka, editor, Arbeitspapiere der GMD, pages 153\u2013178, May 1990."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"K. L. Clark. \u201cNegation as Failure\u201d. In H. Gallaire and J. Minker, editors, Logic and Data-Bases. Plenum, New York, 78.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"2_CR9","volume-title":"Technical report","author":"H. Decker","year":"1990","unstructured":"Hendrik Decker and Lawrence Cavedon. \u201cGeneralizing syntactic properties which ensure that SLDNF-Resolution is complete and flounder-free\u201d. Technical report, ECRC Munich, January 1990."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0004-3702(90)90086-F","volume":"43","author":"C. Elcan","year":"1990","unstructured":"Charles Elcan. \u201cA Rational Reconstruction of Nonmonotonic Truth Maintenance Systems\u201d. Artificial Intelligence, 43:219\u2013234, 1990.","journal-title":"Artificial Intelligence"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"4","author":"M. Fitting","year":"1985","unstructured":"Melvin Fitting. \u201cA Kripke-Kleene Semantics of logic Programs\u201d. Journal of Logic Programming, 4:295\u2013312, 1985.","journal-title":"Journal of Logic Programming"},{"key":"2_CR12","unstructured":"Michael Gelfond and Vladimir Lifschitz. \u201cThe Stable Model Semantics for Logic Programming\u201d. In R. Kowalski and K. Bowen, editors, 5th Conference on Logic Programming. MIT Press, 1988."},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"Kenneth Kunen. \u201cNegation in Logic Programming\u201d. Journal of Logic Programming, 4:289\u2013308, 1987.","journal-title":"Journal of Logic Programming"},{"key":"2_CR14","unstructured":"Kenneth Kunen. \u201cSome Remarks on the completed Database\u201d. Technical Report TR 775, Computer Science Department, June 1988."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"John Lloyd. \u201cFoundations of Logic Programming\u201d. Springer-Verlag, 2nd edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"2_CR16","unstructured":"Wiktor Marek and Mirek Truszczynski. \u201cStable semantics for logic programs and default theories\u201d. Technical report, Dep. CS. Kentucky, October 1989."},{"key":"2_CR17","volume-title":"Technical Report TR","author":"T. Przymusinski","year":"1987","unstructured":"Teodor Przymusinski. \u201cNon-Monotonic Reasoning versus Logic Programming: A new Perspective\u201d. Technical Report TR, Department of Mathematics, Univer. of Texas at El Paso El Paso, TX 79968 USA, 1987."},{"key":"2_CR18","volume-title":"Technical Report TR","author":"T. Przymusinski","year":"1988","unstructured":"Teodor Przymusinski. \u201cEvery Logic Program has a natural Stratification and an iterated fixed point Model\u201d. Technical Report TR, Department of Mathematics, Univer. of Texas at El Paso El Paso, TX 79968 USA, 1988."},{"key":"2_CR19","unstructured":"Teodor Przymusinski. \u201cNon-monotonic Reasoning vs. Logic Programming: Anew Perspective\u201d. In Partridge\/Wilks, editor, Formal Foundations of Artificial Intelligence. Cambridge University Press, 1988."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Teodor Przymusinski. \u201cOn the declarative semantics of deductive databases and logic programs\u201d. In Jack Minker, editor, Foundations of Deductive Databases, chapter 5, pages 193\u2013216. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"2_CR21","volume-title":"Technical Report TR","author":"T. Przymusinski","year":"1988","unstructured":"Teodor Przymusinski. \u201cThree valued Formalizations of non-monotonic Reasoning and Logic Programming\u201d. Technical Report TR, Department of Mathematics, Univer. of Texas at El Paso El Paso, TX 79968 USA, 1988."},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00243002","volume":"5","author":"T. Przymusinski","year":"1989","unstructured":"Teodor Przymusinski. \u201cOn the declarative and procedural Semantics of logic Programs\u201d. Journal of Automated Reasoning, 5:167\u2013205, 1989.","journal-title":"Journal of Automated Reasoning"},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"XIII","author":"T. Przymusinski","year":"1990","unstructured":"Teodor Przymusinski. \u201cWell-founded Semantics Coincides With Three-Valued Stable Semantics\u201d. Fundamenta Informaticae, XIII:445\u2013463, 1990.","journal-title":"Fundamenta Informaticae"},{"key":"2_CR24","volume-title":"Well-founded semantics: Theory and implementation","author":"T. Przymusinski","year":"1990","unstructured":"Teodor Przymusinski and David S. Warren. \u201cWell-founded semantics: Theory and implementation\u201d. in preparation, University El Paso and SUNY at Stony Brook, 1990."},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"John C. Shepherdson. \u201cNegation in Logic Programming\u201d. In Jack Minker, editor, Foundations of Deductive Databases, chapter 1, pages 19\u201388. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"2_CR26","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(89)90106-0","volume":"65","author":"J. C. Shepherdson","year":"1989","unstructured":"John C. Shepherdson. \u201cA sound and complete Semantics for a Version of Negation as Failure\u201d. Theoretical Computer Science, 65:343\u2013371, 1989.","journal-title":"Theoretical Computer Science"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Allen van Gelder, Kenneth Ross, and J.S. Schlipf. \u201cUnfounded Sets and well-founded Semantics for general logic Programs\u201d. In Proceedings 7th Symposion on Principles of Database Systems, pages 221\u2013230, 1988.","DOI":"10.1145\/308386.308444"}],"container-title":["Lecture Notes in Computer Science","Nonmonotonic and Inductive Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0023315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T01:47:11Z","timestamp":1626745631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540545646"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0023315","relation":{},"subject":[]}}