{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:28:08Z","timestamp":1767637688394,"version":"3.48.0"},"reference-count":43,"publisher":"Maximum Academic Press","issue":"4","license":[{"start":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T00:00:00Z","timestamp":1246924800000},"content-version":"unspecified","delay-in-days":7158,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[1989,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This paper surveys a variety of deductive database theories. Such theories differ from one another in the set of axioms and metarules that they allow and use. The following theories are discussed: relational, Horn, and stratified in the text; protected, disjunctive, typed, extended Horn, and normal in the appendix. Connections with programming in terms of the declarative, fixpoint, and procedural semantics are explained. Negation is treated in several different ways: closed world, completed database, and negation as failure. For each theory examples are given and implementation issues are considered.<\/jats:p>","DOI":"10.1017\/s0269888900005129","type":"journal-article","created":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T09:36:02Z","timestamp":1246959362000},"page":"267-304","source":"Crossref","is-referenced-by-count":5,"title":["Deductive database theories"],"prefix":"10.48130","volume":"4","author":[{"given":"John","family":"Grant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Minker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"27968","published-online":{"date-parts":[[2009,7,7]]},"reference":[{"key":"S0269888900005129_ref018","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"volume-title":"A Mathematical Introduction to Logic","year":"1972","author":"Enderton","key":"S0269888900005129_ref008"},{"key":"S0269888900005129_ref020","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(85)90002-0"},{"key":"S0269888900005129_ref028","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90040-2"},{"volume-title":"Logic and Databases","year":"1978","author":"Gallaire","key":"S0269888900005129_ref001"},{"key":"S0269888900005129_ref022","first-page":"378","volume-title":"Proceedings of the Workshop on Foundations of Deductive Databases and Logic Programming","author":"Naqvi","year":"1986"},{"key":"S0269888900005129_ref019","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"S0269888900005129_ref016","first-page":"293","volume-title":"Logic and Databases","author":"Clark","year":"1978"},{"key":"S0269888900005129_ref026","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-40-8.50007-5"},{"key":"S0269888900005129_ref035","doi-asserted-by":"publisher","DOI":"10.1007\/BF00248321"},{"key":"S0269888900005129_ref003","first-page":"148","volume-title":"Methodologies for Intelligent Systems","author":"Minker","year":"1987"},{"key":"S0269888900005129_ref002","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356929"},{"key":"S0269888900005129_ref009","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8"},{"key":"S0269888900005129_ref013","first-page":"33","volume-title":"Logic and Databases","author":"Nicolas","year":"1978"},{"key":"S0269888900005129_ref031","first-page":"828","volume-title":"Logic Programming Proceedings of the Fifth International Conference and Symposium","author":"Lobo","year":"1988"},{"key":"S0269888900005129_ref015","unstructured":"Chan C , 1988. \u201cConstructive negation based on the completed database\u201d, In Kowalski, RA and Bowen, KA, Eds, Logic Programming Proceedings of the Fifth International Conference and Symposium, Massachusetts:The MIT Press, pp. 111\u2013125."},{"volume-title":"Automated Theorem Proving: A Logical Basis","year":"1978","author":"Loveland","key":"S0269888900005129_ref010"},{"key":"S0269888900005129_ref021","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90068-4"},{"key":"S0269888900005129_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(88)90006-4"},{"key":"S0269888900005129_ref006","volume-title":"Principles of Database and Knowledge-Base Systems","volume":"II","author":"Ullman","year":"1988"},{"volume-title":"Introduction to Mathematical Logic","year":"1978","author":"Mendelson","key":"S0269888900005129_ref011"},{"key":"S0269888900005129_ref012","first-page":"1","volume-title":"Knowledge Engineering","volume":"II","author":"Grant","year":"1990"},{"key":"S0269888900005129_ref025","article-title":"On the declarative and procedural semantics of logic programs","volume":"4","author":"Przymusinski","year":"1988","journal-title":"Journal of Automated Reasoning"},{"key":"S0269888900005129_ref030","first-page":"295","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"Henschen","year":"1988"},{"key":"S0269888900005129_ref037","doi-asserted-by":"publisher","DOI":"10.1007\/BF00244994"},{"key":"S0269888900005129_ref038","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5196-5_8"},{"volume-title":"Foundations of Deductive Databases and Logic Programming","year":"1988","author":"Minker","key":"S0269888900005129_ref004"},{"key":"S0269888900005129_ref039","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(84)90011-6"},{"volume-title":"A Logical Language for Data and Knowledge Bases","year":"1989","author":"Naqvi","key":"S0269888900005129_ref023"},{"key":"S0269888900005129_ref024","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"S0269888900005129_ref027","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(85)80002-9"},{"key":"S0269888900005129_ref032","doi-asserted-by":"crossref","unstructured":"Minker J , 1982. \u201cOn indefinite databases and the closed world assumption\u201d, In Proc. of the 6th Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science No. 138, New York:Springer-Verlag, pp. 292\u2013308.","DOI":"10.1007\/BFb0000066"},{"key":"S0269888900005129_ref029","first-page":"247","volume-title":"Advances in Computing Theory, Vol. 3, The Theory of of Databases","author":"Grant","year":"1986"},{"key":"S0269888900005129_ref033","doi-asserted-by":"crossref","unstructured":"Minker J and Rajasekar A , 1989. \u201cA fixpoint semantics for non-Horn logic programs\u201d The Journal of Logic Programming.","DOI":"10.1016\/0743-1066(90)90033-2"},{"key":"S0269888900005129_ref034","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90035-7"},{"key":"S0269888900005129_ref014","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321991"},{"volume-title":"Symbolic Logic and Mechanical Theorem Proving","year":"1973","author":"Chang","key":"S0269888900005129_ref007"},{"key":"S0269888900005129_ref040","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(85)90013-5"},{"key":"S0269888900005129_ref036","doi-asserted-by":"publisher","DOI":"10.1007\/BF00297247"},{"key":"S0269888900005129_ref041","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(86)90004-X"},{"key":"S0269888900005129_ref042","doi-asserted-by":"crossref","unstructured":"Przymusinski TC , 1989. \u201cEvery logic program has a natural stratification and an iterated least fixed point model\u201d In Proc. of ACM PODS 11\u201321.","DOI":"10.1145\/73721.73723"},{"key":"S0269888900005129_ref043","doi-asserted-by":"crossref","unstructured":"Van Gelder A , Ross KA and Schlipf JS , 1988. \u201cUnfounded sets and well-founded semantics for general logic programs\u201d In Proc. of ACM PODS 221\u2013230.","DOI":"10.1145\/308386.308444"},{"key":"S0269888900005129_ref017","first-page":"149","volume-title":"Logic and Databases","author":"Reiter","year":"1978"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888900005129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:42:08Z","timestamp":1767624128000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888900005129\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["S0269888900005129"],"URL":"https:\/\/doi.org\/10.1017\/s0269888900005129","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"type":"print","value":"0269-8889"},{"type":"electronic","value":"1469-8005"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}