{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:29:18Z","timestamp":1760300958166},"reference-count":50,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780934613408"}],"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.50004-x","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T12:05:11Z","timestamp":1404216311000},"page":"1-16","source":"Crossref","is-referenced-by-count":0,"title":["Introduction"],"prefix":"10.1016","author":[{"given":"Jack","family":"Minker","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the Theory of Logic Programming","volume":"29","author":"Apt","year":"1982","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib2","doi-asserted-by":"crossref","unstructured":"Apt, K. and Pugin, J. M. [1987] Maintenance of Stratified Databases Viewed as a Belief Revision System, Proc. of the Sixth ACM SIGACT News-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA, 136\u2013145","DOI":"10.1145\/28659.28674"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib3","doi-asserted-by":"crossref","unstructured":"Beeri, C. and Ramakrishnan, R. [1987] On the Power of Magic, Proc. Principles of Database Systems, San Diego, CA","DOI":"10.1145\/28659.28689"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and Complexity of Relational Queries","volume":"25","author":"Chandra","year":"1982","journal-title":"Journal of Computer System Sciences"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50004-X_bib5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn Clause Queries and Generalizations","volume":"2","author":"Chandra","year":"1985","journal-title":"Journal of Logic Programming"},{"year":"1973","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","key":"10.1016\/B978-0-934613-40-8.50004-X_bib6"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib7","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"year":"1984","series-title":"Programming in Prolog","author":"Clocksin","key":"10.1016\/B978-0-934613-40-8.50004-X_bib8"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib9","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"23","author":"Emden","year":"1976","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib10","unstructured":"Gal, A. and Minker, J. [1987] Greater Cooperation Between Databases and User: Integrity Constraints Provide an Answer, Proc. 2nd International Workshop on Natural Understanding and Logic Programming, Vancouver, BC, Canada"},{"year":"1978","series-title":"Logic and Databases","author":"Gallaire","key":"10.1016\/B978-0-934613-40-8.50004-X_bib11"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50004-X_bib12","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":"ACM Computing Surveys"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib13","unstructured":"Grant, J. and Minker, J. [1986] Answering Queries in Indefinite Databases and the Null Value Problem, in Advances in Computing Research (P. Kanellakis, Ed.), 247\u2013267"},{"year":"1969","series-title":"The Application of Theorem Proving to Question-Answering Systems","author":"Green","key":"10.1016\/B978-0-934613-40-8.50004-X_bib14"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib15","doi-asserted-by":"crossref","unstructured":"Green, C. C. and Raphael, B. [1968] The Use of Theorem-Proving Techniques in Question-Answering Systems, Proc. 23rd National Conference ACM, Washington, DC","DOI":"10.1145\/800186.810578"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib16","unstructured":"Green, C. C. and Raphael, B. [1968] Research In Intelligent Question Answering Systems, Proc. ACM 23rd National Conference, NJ, 169\u2013181"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09237-4","article-title":"First-Order Dynamic Logic","author":"Harel","year":"1979"},{"year":"1974","series-title":"LUSH Resolution and Its Completeness","author":"Hill","key":"10.1016\/B978-0-934613-40-8.50004-X_bib18"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib19","unstructured":"Jaffar, J., Lassez, J., and Lloyd, J. W. [1983] Completeness of the Negation as Failure Rule, in Proceedings Eighth International Joint Conference on Artificial Intelligence, Karlsruhe, West Germany, 500\u2013506"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib20","unstructured":"Kowalski, R. A. [1974] Predicate Logic as a Programming Language, Proc. IFIP 4, Amsterdam, 569\u2013574"},{"year":"1979","series-title":"Logic for Problem Solving","author":"Kowalski","key":"10.1016\/B978-0-934613-40-8.50004-X_bib21"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib22","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","article-title":"Linear Resolution with Selection Function","volume":"2","author":"Kowalski","year":"1971","journal-title":"Artificial Intelligence"},{"year":"1986","series-title":"Stratification as a Tool for Interactive Knowledge Base Management, RC 12355(55416)","author":"Lassez","key":"10.1016\/B978-0-934613-40-8.50004-X_bib23"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib24","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","article-title":"Closure and Fairness in the Semantics of Programming Logic","volume":"29","author":"Lassez","year":"1984","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib25","unstructured":"Lifschitz, V. [1986] Pointwise Circumscription: Preliminary Report, Proc. AAAI, Philadelphia, PA, 406\u2013410"},{"year":"1984","series-title":"Foundations of Logic Programming","author":"Lloyd","key":"10.1016\/B978-0-934613-40-8.50004-X_bib26"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50004-X_bib27","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0743-1066(85)90013-5","article-title":"A Basis for Deductive Databases Systems","volume":"2","author":"Lloyd","year":"1985","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50004-X_bib28","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0743-1066(86)90004-X","article-title":"A Basis for Deductive Database Systems II","volume":"3","author":"Lloyd","year":"1986","journal-title":"Journal of Logic Programming"},{"year":"1978","series-title":"Automated Theorem Proving: A Logical Basis","author":"Loveland","key":"10.1016\/B978-0-934613-40-8.50004-X_bib29"},{"issue":"1 and 2","key":"10.1016\/B978-0-934613-40-8.50004-X_bib30","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription-A Form of Non-Monotonic Reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib31","series-title":"Lecture Notes in Computer Science 138","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0000066","article-title":"On Indefinite Databases and the Closed World Assumption","author":"Minker","year":"1982"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib32","unstructured":"Minker, J. [1986] Proc. of Workshop on Foundations of Deductive Databases and Logic Programming."},{"year":"1987","series-title":"Perspectives in Deductive Databases","author":"Minker","key":"10.1016\/B978-0-934613-40-8.50004-X_bib33"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib34","unstructured":"Minker, J. and Perlis, D. [1984a] Protected Circumscription, Proc. Workshop on Non-Monotonic Reasoning, New Paltz, NY, 337\u2013343"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib35","unstructured":"Minker, J. and Perlis, D. [1984b] Applications of Protected Circumscription, Proc. Conference on Automated Deduction, Napa, CA"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50004-X_bib36","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0743-1066(85)80002-9","article-title":"Computing Protected Circumscription","volume":"2","author":"Minker","year":"1985","journal-title":"Journal of Logic Programming"},{"year":"1987","series-title":"A Fixpoint Semantics for Non-Horn Logic Programs","author":"Minker","key":"10.1016\/B978-0-934613-40-8.50004-X_bib37"},{"year":"1985","series-title":"Negation and Quantifiers in NU-Prolog","author":"Naish","key":"10.1016\/B978-0-934613-40-8.50004-X_bib38"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib39","unstructured":"Naqvi, S. A. [1986] A Logic for Negation in Database Systems, in Proc. of Workshop on Foundations of Deductive Databases and Logic Programming, (J. Minker, Ed.), Washington, DC, 378\u2013387"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib40","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. [1986] A Query Answering Algorithm for Circumscriptive Theories, Proc. 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.50004-X_bib41","series-title":"Logic and Data Bases","first-page":"149","article-title":"Deductive Question-Answering on Relational Data Bases","author":"Reiter","year":"1978"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib42","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.50004-X_bib43","unstructured":"Reiter, R. [1982] Circumscription Implies Predicate Completion (Sometimes), Proc. Amer. Assoc. for Art. Intell. National Conference, Pittsburgh, PA, 418\u2013420"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib44","series-title":"On Conceptual Modelling","first-page":"163","article-title":"Towards a Logical Reconstruction of Relational Database Theory","author":"Reiter","year":"1984"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50004-X_bib45","doi-asserted-by":"crossref","DOI":"10.1145\/321250.321253","article-title":"A Machine-Oriented Logic Based on the Resolution Principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J.ACM"},{"year":"1987","series-title":"Inferring Negative Information from Disjunctive Databases","author":"Ross","key":"10.1016\/B978-0-934613-40-8.50004-X_bib46"},{"year":"1975","series-title":"PROLOG: Manuel de Reference et d'Utilisation","author":"Roussel","key":"10.1016\/B978-0-934613-40-8.50004-X_bib47"},{"year":"1986","series-title":"The Art of Prolog","author":"Sterling","key":"10.1016\/B978-0-934613-40-8.50004-X_bib48"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50004-X_bib49","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","article-title":"Making PROLOG More Expressive","volume":"1","author":"Topor","year":"1984","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50004-X_bib50","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":"J. Automated Reasoning"}],"container-title":["Foundations of Deductive Databases and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B978093461340850004X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B978093461340850004X?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:51Z","timestamp":1538432571000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B978093461340850004X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780934613408"],"references-count":50,"URL":"https:\/\/doi.org\/10.1016\/b978-0-934613-40-8.50004-x","relation":{},"subject":[],"published":{"date-parts":[[1988]]}}}