{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:43Z","timestamp":1725663643481},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540535072"},{"type":"electronic","value":"9783540466826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53507-1_88","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:09:33Z","timestamp":1330207773000},"page":"349-363","source":"Crossref","is-referenced-by-count":1,"title":["Beginnings of a theory of general database completions"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Brass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"N. Bidoit, R. Hull: Positivism vs. minimalism in deductive databases. In Proc. of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS'86), 123\u2013132, 1986.","DOI":"10.1145\/6012.15409"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-51251-9_6","volume-title":"Second Symposium on Mathematical Fundamentals of Database Systems (MFDBS'89)","author":"S. Brass","year":"1989","unstructured":"S. Brass, U. W. Lipeck: Specifying closed world assumptions for logic databases. In Second Symposium on Mathematical Fundamentals of Database Systems (MFDBS'89), 68\u201384, Lecture Notes in Computer Science 364, Springer-Verlag, Berlin, 1989."},{"key":"22_CR3","unstructured":"S. Brass: Vervollst\u00e4ndigungen f\u00fcr Logikdatenbanken (completions of logic databases). Diploma thesis, Informatics, Techn. Univ. Braunschweig, 1988. In German. Revised Version available as technical report 315\/1989, Informatics, Univ. Dortmund."},{"key":"22_CR4","unstructured":"S. Brass: Remarks on first order circumscription. Submitted for publication, 1990."},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(80)90013-2","volume":"13","author":"M. Davis","year":"1980","unstructured":"M. Davis: The mathematics of non-monotonic reasoning. Artificial Intelligence 13 (1980), 73\u201380.","journal-title":"Artificial Intelligence"},{"key":"22_CR6","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":"22_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-50701-9_21","volume-title":"Non-Monotonic Reasoning (2nd International Workshop)","author":"M. Gelfond","year":"1989","unstructured":"M. Gelfond, V. Lifschitz: Compiling circumscriptive theories into logic programs. In Non-Monotonic Reasoning (2nd International Workshop), 74\u201399, Lecture Notes in Artificial Intelligence 346, Springer-Verlag, Berlin, 1989."},{"key":"22_CR8","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 Symposium on Principles of Database Systems (PODS'86), 153\u2013185, 1986.","DOI":"10.1145\/6012.15410"},{"key":"22_CR9","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":"22_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/B978-0-934613-40-8.50008-7","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"V. Lifschitz","year":"1988","unstructured":"V. Lifschitz: On the declarative semantics of logic programs with negation. In J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, 177\u2013192, Morgan Kaufmann Publishers, Los-Altos (Calif.), 1988."},{"key":"22_CR11","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, second edition. Springer-Verlag, Berlin, 1987.","edition":"second edition"},{"key":"22_CR12","unstructured":"W. Lukaszewics: Two results on default logic. In Proc. 9th International Joint Conference on Artificial Intelligence (IJCAI), 459\u2013461, Los Angeles, 1985."},{"key":"22_CR13","series-title":"Lecture Notes in Artificial Intelligence","first-page":"1","volume-title":"Non-Monotonic Reasoning (2nd International Workshop)","author":"D. Makinson","year":"1989","unstructured":"D. Makinson: General theory of cumulative inference. In Non-Monotonic Reasoning (2nd International Workshop), 1\u201318, Lecture Notes in Artificial Intelligence 346, Springer-Verlag, Berlin, 1989."},{"key":"22_CR14","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 \u2014 a form of non-monotonic reasoning. Artificial Intelligence 13 (1980), 27\u201339.","journal-title":"Artificial Intelligence"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0000066","volume-title":"6th Conference on Automated Deduction","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, Lecture Notes in Computer Science 138, Springer-Verlag, Berlin, 1982."},{"key":"22_CR16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF00437315","volume":"2","author":"H. Moulin","year":"1985","unstructured":"H. Moulin: Choice functions over a finite set: A summary. Social Choice and Welfare 2 (1985), 147\u2013160.","journal-title":"Social Choice and Welfare"},{"key":"22_CR17","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":"22_CR18","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":"22_CR19","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 H. Gallaire, J. Minker (eds.), Logic and Data Bases, 55\u201376, Plenum, New York, 1978."},{"key":"22_CR20","doi-asserted-by":"publisher","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":"22_CR21","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00297247","volume":"4","author":"K. A. Ross","year":"1988","unstructured":"K. A. Ross, R. W. Topor: Inferring negative information from disjunctive databases. Journal of Automated Reasoning 4 (1988), 397\u2013424.","journal-title":"Journal of Automated Reasoning"},{"key":"22_CR22","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/0022-0531(76)90050-8","volume":"13","author":"T. Schwartz","year":"1976","unstructured":"T. Schwartz: Choice functions, rationality conditions and variations on the weak axiom of revealed preferences. J. Econom. Theory 13 (1976), 414\u2013427.","journal-title":"J. Econom. Theory"},{"key":"22_CR23","unstructured":"Y. Shoham: Nonmonotonic logics: Meaning and utility. In Proc. 10th International Joint Conference on Artificial Intelligence (IJCAI), 388\u2013393, Milan, 1987."},{"key":"22_CR24","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00244994","volume":"1","author":"A. Yahya","year":"1985","unstructured":"A. Yahya, L. J. Henschen: Deduction in non-horn databases. Journal of Automated Reasoning 1 (1985), 141\u2013160.","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","ICDT '90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53507-1_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:14:07Z","timestamp":1619572447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53507-1_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540535072","9783540466826"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-53507-1_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}