{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:02:29Z","timestamp":1775818949864,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier","isbn-type":[{"value":"9780934613408","type":"print"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1016\/b978-0-934613-40-8.50009-9","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T12:07:02Z","timestamp":1404216422000},"page":"193-216","source":"Crossref","is-referenced-by-count":279,"title":["On the Declarative Semantics of Deductive Databases and Logic Programs"],"prefix":"10.1016","author":[{"given":"Teodor C.","family":"Przymusinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib1","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib2","doi-asserted-by":"crossref","unstructured":"Bidoit, N. and Hull, R. [1986] Positivism vs. Minimalism in Deductive Databases, Proceedings ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Cambridge, MA, 123\u2013132","DOI":"10.1145\/6012.15409"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(85)90040-2","article-title":"Saturation, Nonmonotonic Reasoning and the Closed World Assumption","volume":"25","author":"Bossu","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","article-title":"Proving Termination with Multiset Orderings","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Communications ACM"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50009-9_bib5","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"3","author":"Emden","year":"1976","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356924.356929","article-title":"Logic and Databases: A Deductive Approach","volume":"16","author":"Gallaire","year":"1984","journal-title":"Computing Surveys"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib7","doi-asserted-by":"crossref","unstructured":"Gelfond, M., Przymusinska, H., and Przymusinski, T. [1986a] The Extended Closed World Assumption and Its Relationship to Parallel Circumscription, Proceedings ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Cambridge, MA, 133\u2013139","DOI":"10.1145\/6012.15410"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib8","unstructured":"Gelfond, M., Przymusinska, H., and Przymusinski, T. [1986b] On the Relationship Between the Closed-world Assumption and Predicate Circumscription, submitted"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib9","unstructured":"Lifschitz, V. [1985] Computing Circumscription, Proceedings IJCAI\u201385, 121\u2013127"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib10","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"177","article-title":"On the Declarative Semantics of Logic Programs with Negation","author":"Lifschitz","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0004-3702(85)90055-4","article-title":"Closed World Data Bases and Circumscription","volume":"27","author":"Lifschitz","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib12","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib13","unstructured":"McCarthy, J. [1984] Applications of Circumscription to Formalizing Common Sense Knowledge, AAAI Workshop on Non-Monotonic Reasoning, 295\u2013323"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib14","doi-asserted-by":"crossref","unstructured":"Minker, J. [1982] On Indefinite Data Bases and the Closed World Assumption, Proc. 6th Conference on Automated Deduction, 292\u2013308","DOI":"10.1007\/BFb0000066"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib15","unstructured":"Naqvi, S. A. [1986] A Logic for Negation in Database Systems, Proceedings of the Workshop on Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Washington, DC, 378\u2013387"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib16","article-title":"On the Declarative and Procedural Semantics of Stratified Deductive Databases and Logic Programs","author":"Przymusinski","year":"1987","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib17","unstructured":"Przymusinski, T. [1986a] Query Answering in Circumscriptive and Closed-World Theories, Proceedings AAAI\u201386, Philadelphia, PA, 186\u2013190"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib18","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. [1986b] A Query Answering Algorithm for Circumscriptive Theories, Proceedings of the ACM SIGART International Symposium on Methodologies for Intelligent Systems, Knoxville, TN, 85\u201393","DOI":"10.1145\/12808.12818"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib19","series-title":"Logic and Data Bases","first-page":"55","article-title":"On Closed-World Data Bases","author":"Reiter","year":"1978"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib20","series-title":"On Conceptual Modeling","first-page":"191","article-title":"Towards a Logical Reconstruction of Relational Database Theory","author":"Reiter","year":"1984"},{"key":"10.1016\/B978-0-934613-40-8.50009-9_bib21","series-title":"Foundations of Deductive and Logic Programming","first-page":"149","article-title":"Negation as Failure Using Tight Derivations for General Logic Programs","author":"Van Gelder","year":"1988"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50009-9_bib22","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00244994","article-title":"Deduction in Non-Horn Databases","volume":"1","author":"Yahya","year":"1985","journal-title":"Journal of Automated Reasoning"}],"container-title":["Foundations of Deductive Databases and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780934613408500099?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780934613408500099?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T22:22:44Z","timestamp":1538432564000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780934613408500099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780934613408"],"references-count":22,"URL":"https:\/\/doi.org\/10.1016\/b978-0-934613-40-8.50009-9","relation":{},"subject":[],"published":{"date-parts":[[1988]]}}}