{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T11:26:23Z","timestamp":1747913183057},"publisher-location":"Berlin\/Heidelberg","reference-count":33,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540564330"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0030392","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:32:44Z","timestamp":1138185164000},"page":"153-174","source":"Crossref","is-referenced-by-count":10,"title":["Deduction with supernormal defaults"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Brass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"C. E. Alchourr\u00f3n, D. Makinson: Ilierarchies of regulations and their logic. In R. Hilpinen (ed.), New Studies in Deontic Logic, 125\u2013148, D. Reidel Publishing Company, 1981.","DOI":"10.1007\/978-94-009-8484-4"},{"key":"7_CR2","unstructured":"A. B. Baker, M. L. Ginsberg: A theorem prover for prioritized circumscription. In Proc. 11th International Joint Conf. on Artificial Intelligence (IJCAI), 463\u2013467, 1989."},{"key":"7_CR3","first-page":"68","volume-title":"LNCS 364","author":"S. Brass","year":"1989","unstructured":"S. Brass, U. W. Lipeck: Specifying closed world assumptions for logic databases. In J. Demetrovics, B. Thalheim (eds.), 2nd Symposium on Mathematical Fundamentals of Database Systems (MFDBS'89), 68\u201384, LNCS 364, Springer-Verlag, Berlin, 1989."},{"key":"7_CR4","first-page":"411","volume-title":"LNCS 566","author":"S. Brass","year":"1991","unstructured":"S. Brass, U. W. Lipeck: Semantics of inheritance in logical object specifications. In C. Delobel, M. Kifer, Y. Masunaga (eds.), Deductive and Object-Oriented Databases, 2nd Int. Conf. (DOOD'91), 411\u2013430, LNCS 566, Springer-Verlag, Berlin, 1991."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"S. Brass, U. W. Lipeck: Generalized bottom-up query evaluation. In Advances in Database Technology \u2014 EDBT'92, 3rd Int. Conf., 88\u2013103, LNCS 580, Springer-Verlag, 1992.","DOI":"10.1007\/BFb0032425"},{"key":"7_CR6","first-page":"349","volume-title":"LNCS 470","author":"S. Brass","year":"1990","unstructured":"S. Brass: Beginnings of a theory of general database completions. In S. Abiteboul, P. C. Kanellakis (eds.), Third International Conference on Database Theory (ICDT'90), 349\u2013363, LNCS 470, Springer-Verlag, Berlin, 1990."},{"key":"7_CR7","volume-title":"Nonmonotonic Reasoning: Logical Foundations of Commonsense","author":"G. Brewka","year":"1991","unstructured":"G. Brewka: Nonmonotonic Reasoning: Logical Foundations of Commonsense. Cambridge University Press, Cambridge, 1991."},{"key":"7_CR8","unstructured":"S. Brass, M. Ryan, U. W. Lipeck: Hierarchical defaults in specifications. In G. Saake, A. Sernadas (eds.), Information Systems \u2014 Correctness and Reusability, Workshop IS-CORE '91, 179\u2013201, Informatik-Bericht 91-03, TU Braunschweig, 1991."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0169-023X(90)90017-8","volume":"5","author":"F. Bry","year":"1990","unstructured":"F. Bry: Query evaluation in recursive databases: bottom-up and top-down reconciled. Data & Knowledge Engineering 5 (1990), 289\u2013312.","journal-title":"Data & Knowledge Engineering"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(85)90040-2","volume":"25","author":"G. Bossu","year":"1985","unstructured":"G. Bossu, P. Siegel: Saturation, non-monotonic reasoning and the closed-world assumption. Artificial Intelligence 25 (1985), 13\u201363.","journal-title":"Artificial Intelligence"},{"key":"7_CR11","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C.-L. Chang","year":"1973","unstructured":"C.-L. Chang, R. C.-T. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. L. Clark","year":"1978","unstructured":"K. L. Clark: Negation as failure. In H. Gallaire, J. Minker (eds.), Logic and Data Bases, 293\u2013322, Plenum, New York, 1978."},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-642-82453-1_15","volume-title":"Logics and Models of Concurrent Systems","author":"D. M. Gabbay","year":"1985","unstructured":"D. M. Gabbay: Theoretical foundations for non-monotonic reasoning in expert systems. In K. R. Apt (ed.), Logics and Models of Concurrent Systems, 439\u2013457, Springer, Berlin, 1985."},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0004-3702(89)90026-X","volume":"39","author":"M. L. Ginsberg","year":"1989","unstructured":"M. L. Ginsberg: A circumscriptive theorem prover. Artificial Intelligence 39 (1989), 209\u2013230.","journal-title":"Artificial Intelligence"},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(86)90001-9","volume":"30","author":"M. Gelfond","year":"1986","unstructured":"M. Gelfond, H. Przymusinska: Negation as failure: Careful closure procedure. Artificial Intelligence 30 (1986), 273\u2013287.","journal-title":"Artificial Intelligence"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"M. Gelfond, H. Przymusinska, T. Przymusinski: The extended closed world assumption and its relationship to parallel circumscription. In Proc. of the Fifth ACM SIGACT-SIGMOD Symp. on Principles of Database Syst. (PODS'86), 133\u2013139, 1986.","DOI":"10.1145\/6012.15410"},{"key":"7_CR17","unstructured":"C. C. Green: Theorem-proving by resolution as a basis for question-answering systems. In B. Meltzer, D. Michie (eds.), Machine Intelligence, volume 4, 183\u2013205. Edinburgh University Press, 1969."},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S. Kraus","year":"1990","unstructured":"S. Kraus, D. Lehmann, M. Magidor: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44 (1990), 167\u2013207.","journal-title":"Artificial Intelligence"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0004-3702(85)90055-4","volume":"27","author":"V. Lifschitz","year":"1985","unstructured":"V. Lifschitz: Closed-world databases and circumscription. Artificial Intelligence 27 (1985), 229\u2013235.","journal-title":"Artificial Intelligence"},{"key":"7_CR20","unstructured":"V. Lifschitz: Computing circumscription. In Proc. 9th International Joint Conference on Artificial Intelligence (IJCAI), 121\u2013127, Los Angeles, 1985."},{"key":"7_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"J.W. Lloyd: Foundations of Logic Programming, 2nd edition. Springer-Verlag, Berlin, 1987.","edition":"2nd edition"},{"key":"7_CR22","first-page":"1","volume-title":"LNAI 346","author":"D. Makinson","year":"1989","unstructured":"D. Makinson: General theory of cumulative inference. In Non-Monotonic Reasoning (2nd International Workshop), 1\u201318, LNAI 346, Springer-Verlag, Berlin, 1989."},{"key":"7_CR23","unstructured":"D. Makinson: General patterns in nonmonotonic reasoning. In D. Gabbay (ed.), Handbook of Logic in Artificial Intelligence and Logic Programming, volume 2. Oxford University Press, 1992. 79 pages."},{"key":"7_CR24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"J. McCarthy: Circumscription \u2014 a form of non-monotonic reasoning. Artificial Intelligence 13 (1980), 27\u201339.","journal-title":"Artificial Intelligence"},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"J. McCarthy: Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence 28 (1986), 86\u2013116.","journal-title":"Artificial Intelligence"},{"key":"7_CR26","first-page":"292","volume-title":"LNCS 138","author":"J. Minker","year":"1982","unstructured":"J. Minker: On indefinite databases and the closed world assumption. In D. W. Loveland (ed.), 6th Conference on Automated Deduction, 292\u2013308, LNCS 138, Springer-Verlag, Berlin, 1982."},{"key":"7_CR27","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0743-1066(85)80002-9","volume":"2","author":"J. Minker","year":"1985","unstructured":"J. Minker, D. Perlis: Computing protected circumscription. The Journal of Logic Programming 2 (1985), 235\u2013249.","journal-title":"The Journal of Logic Programming"},{"key":"7_CR28","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(88)90077-X","volume":"36","author":"D. Poole","year":"1988","unstructured":"D. Poole: A logical framework for default reasoning. Artificial Intelligence 36 (1988), 27\u201347.","journal-title":"Artificial Intelligence"},{"key":"7_CR29","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/B978-0-934613-40-8.50009-9","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T. C. Przymusinski","year":"1988","unstructured":"T. C. Przymusinski: On the declarative semantics of deductive databases and logic programs. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, 193\u2013216, Morgan Kaufmann Publishers, Los-Altos (Calif.), 1988."},{"key":"7_CR30","doi-asserted-by":"crossref","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 (1989), 49\u201373.","journal-title":"Artificial Intelligence"},{"key":"7_CR31","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4684-3384-5_3","volume-title":"Logic and Data Bases","author":"R. Reiter","year":"1978","unstructured":"R. Reiter: On closed world data bases. In I.I. Gallaire, J. Minker (eds.), Logic and Data Bases, 55\u201376, Plenum, New York, 1978."},{"key":"7_CR32","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter: A logic for default reasoning. Artificial Intelligence 13 (1980), 81\u2013132.","journal-title":"Artificial Intelligence"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"M. Ryan: Defaults and revision in structured theories. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'91), 362\u2013373, 1991.","DOI":"10.1109\/LICS.1991.151660"}],"container-title":["Lecture Notes in Computer Science","Nonmonotonic and Inductive Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030392.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:01:43Z","timestamp":1607533303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540564330"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/bfb0030392","relation":{},"subject":[]}}