{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:11Z","timestamp":1725663251888},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540527534"},{"type":"electronic","value":"9783540471370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52753-2_55","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:42:40Z","timestamp":1330206160000},"page":"409-421","source":"Crossref","is-referenced-by-count":3,"title":["The semantics of disjunctive deductive databases"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Volger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases, pages 89\u2013148. Morgan Kaufmann, 1988.","key":"27_CR1","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(89)90004-4","volume":"38","author":"N. Bidoit","year":"1989","unstructured":"N. Bidoit and R. Hull. Minimalism, justification and non-monotonicity in deductive databases. J. of Computer and System Sciences, 38:290\u2013325, 1989.","journal-title":"J. of Computer and System Sciences"},{"key":"27_CR3","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 and P. Siegel. Saturation, nonmonotonic reasoning and the closed world assumption. Artificial Inteligence, 25:13\u201363, 1985.","journal-title":"Artificial Inteligence"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BFb0099384","volume":"1103","author":"G.L Cherlin","year":"1984","unstructured":"G.L Cherlin and H. Volger. Convexity properties and algebraic closure operators. In Models and Sets, Proc.Logic Colloq. '83, Aachen, part 1, Lecture Notes in Math. 1103, pages 113\u2013146. Springer Verlag, 1984.","journal-title":"Lecture Notes in Math."},{"doi-asserted-by":"crossref","unstructured":"K.L. Clark. Negation as failure. In H. Gallaire, J. Minker, and J.-M. Nicolas, editors, Logic and Databases, pages 293\u2013324. Plenum Press, 1978.","key":"27_CR5","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/BF01224971","volume":"34","author":"Y. Diers","year":"1980","unstructured":"Y. Diers. Cat\u00e9gories localement multipr\u00e9sentables. Arch.math., 34:344\u2013356, 1980.","journal-title":"Arch.math."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/356924.356929","volume":"16","author":"H. Gallaire","year":"1984","unstructured":"H. Gallaire, J. Minker, and J.-M. Nicolas. Logic and databases: a deductive approach. Computing Surveys, 16:153\u2013185, 1984.","journal-title":"Computing Surveys"},{"unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R.A. Kowalski and R.A. Bowen, editors, Logic programming, Proc. 5th Intern. Conf. and Symp., Seattle 1988, pages 1070\u20131080. MIT Press, 1988.","key":"27_CR8"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","volume":"38","author":"M. Gelfond","year":"1989","unstructured":"M. Gelfond, H. Przymusinska, and T. Przymusinski. On the relationship between circumscription and negation as failure. Artificial Intelligence, 38:75\u201394, 1989.","journal-title":"Artificial Intelligence"},{"key":"27_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/malq.19890350206","volume":"35","author":"M. Hebert","year":"1989","unstructured":"M. Hebert. Preservation and interpolation theorems through binary relations between theories. Zeitschr. f. Logik und Grundlagen d. Math., 35:169\u2013182, 1989.","journal-title":"Zeitschr. f. Logik und Grundlagen d. Math."},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"155","DOI":"10.4064\/fm-89-2-155-171","volume":"89","author":"D.W. Kueker","year":"1975","unstructured":"D.W. Kueker. Core structures for theories. Fund.Math., 89:155\u2013171, 1975.","journal-title":"Fund.Math."},{"unstructured":"V. Lifschitz. Computing circumscription. In Proc. AAAI-86, pages 406\u2013410, 1986.","key":"27_CR12"},{"key":"27_CR13","first-page":"266","volume":"34","author":"J.A. Makowsky","year":"1987","unstructured":"J.A. Makowsky. Why horn formulas matter in computer science: initial structures and generic examples. J.C.S.S., 34:266\u2013292, 1987.","journal-title":"J.C.S.S."},{"key":"27_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-65374-2","volume-title":"Algebraic Systems","author":"A.I. Malcev","year":"1973","unstructured":"A.I. Malcev. Algebraic Systems. Akademie Verlag, Berlin, 1973."},{"key":"27_CR15","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 nonmomotonic reasoning. Artificial Intelligence, 13:27\u201339, 1980.","journal-title":"Artificial Intelligence"},{"key":"27_CR16","first-page":"292","volume":"138","author":"J. Minker","year":"1982","unstructured":"J. Minker. On indefinite databases and the closed world assumption. In Proc. 6th Conf. on Automated Deduction, LNCS 138, pages 292\u2013308. Springer Verlag, 1982.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"J. Minker and A. Rajasekar. Procedural interpretation on non-horn logic programs. In E. Lusk and R. Overbeek, editors, Proc. 9th Intern. Conf. on Automated Deduction, pages 278\u2013293. ?, 1988.","key":"27_CR17","DOI":"10.1007\/BFb0012837"},{"key":"27_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1305\/ndjfl\/1093888212","volume":"19","author":"C. Pinter","year":"1978","unstructured":"C. Pinter. A note on the decomposition of theories with respect to amalgamation, convexity and related properties. Notre Dame J.Formal Logic, 19:115\u2013118, 1978.","journal-title":"Notre Dame J.Formal Logic"},{"unstructured":"T.C. Przymusinski. Perfect model semantics. In R.A. Kowalski and R.A. Bowen, editors, Logic programming, proc. 5th Intern. Conf. and Symp., Seattle 1988, pages 1081\u20131096. MIT Press, 1988.","key":"27_CR19"},{"key":"27_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00243002","volume":"5","author":"T.C. Przymusinski","year":"1989","unstructured":"T.C. Przymusinski. On the declarative and procedural semantics of logic programs. J. of Automated Reasoning, 5:167\u2013205, 1989.","journal-title":"J. of Automated Reasoning"},{"unstructured":"H. Przymusinsky and T.C. Przymusinski. Weakly perfect model semantics for logic programs. In R.A. Kowalski and R.A. Bowen, editors, Logic programming, proc. 5th Intern. Conf. and Symp., Seattle 1988, pages 1106\u20131120. MIT Press, 1988.","key":"27_CR21"},{"key":"27_CR22","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00248321","volume":"5","author":"J. Rajasekar","year":"1989","unstructured":"J. Rajasekar, J. Lobo, and J. Minker. Weak gweneralized closed world assumption. J. of Automated reasoning, 5:293\u2013307, 1989.","journal-title":"J. of Automated reasoning"},{"doi-asserted-by":"crossref","unstructured":"R. Reiter. On closed world databases. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 55\u201376. Plenum, 1978.","key":"27_CR23","DOI":"10.1007\/978-1-4684-3384-5_3"},{"key":"27_CR24","doi-asserted-by":"crossref","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. J. of Automated reasoning, 4:397\u2013424, 1988.","journal-title":"J. of Automated reasoning"},{"key":"27_CR25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01173845","volume":"166","author":"H. Volger","year":"1979","unstructured":"H. Volger. Preservation theorems for limits of structures and global sections of sheaves of structures. Math.Z., 166:27\u201353, 1979.","journal-title":"Math.Z."},{"key":"27_CR26","first-page":"322","volume":"329","author":"H. Volger","year":"1988","unstructured":"H. Volger. Model theory of deductive databases. In CSL '87 1st Workshop on Comp.Sci.Logic, LNCS 329, pages 322\u2013334. Springer Verlag, 1988.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"H. Volger. The semantics of disjunctive deductive databases. Technical report, MIP-8931 Univ. Passau, 1989.","key":"27_CR27","DOI":"10.1007\/3-540-52753-2_55"},{"key":"27_CR28","doi-asserted-by":"crossref","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. J. of Automated Reasoning, 1:141\u2013160, 1985.","journal-title":"J. of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","CSL '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52753-2_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:14Z","timestamp":1605648314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52753-2_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540527534","9783540471370"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-52753-2_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}