{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:21:29Z","timestamp":1775053289111,"version":"3.50.1"},"reference-count":204,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":9271,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1016\/0743-1066(88)90006-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"33-60","source":"Crossref","is-referenced-by-count":41,"title":["Perspectives in deductive databases"],"prefix":"10.1016","volume":"5","author":[{"given":"Jack","family":"Minker","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0743-1066(88)90006-4_BIB1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(86)90013-0","article-title":"LOGIN: A Logic Programming Language with Built-In Inheritance","volume":"3","author":"Ait-Kaci","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90006-4_BIB2","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":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB3","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and Logic Programming","first-page":"546","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB4","series-title":"Analysis","article-title":"A new Approach to the Logical Theory of Interrogatives: Part 1","author":"Aqvist","year":"1965"},{"key":"10.1016\/0743-1066(88)90006-4_BIB5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/800186.810576","article-title":"TRAMP: An Interpretive Associative Processor with Deductive Capabilities","author":"Ash","year":"1968","journal-title":"Proceedings of the 1968 ACM National Conference"},{"key":"10.1016\/0743-1066(88)90006-4_BIB6","doi-asserted-by":"crossref","DOI":"10.1145\/6012.15399","article-title":"Magic Sets and Other Strange Ways to Implement Logic Programs","author":"Bancilhon","year":"1986","journal-title":"Proceedings of the 5th ACM SIGMOD-SIGACT News Symposium on Principles of Database Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB7","first-page":"16","article-title":"An Amateur's Introduction to Recursive Query Processing Strategies","author":"Bancilhon","year":"1986","journal-title":"Proceedings of ACM SIGMOD \u201986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB8","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and Logic Programming","first-page":"284","article-title":"Performance Evaluation of Data Intensive Logic Programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB9","series-title":"Internal Technical Report","article-title":"Interpreteur du Language de Programmation PROLOG","author":"Battani","year":"1973"},{"key":"10.1016\/0743-1066(88)90006-4_BIB10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/28659.28689","article-title":"On the Power of Magic","author":"Beeri","year":"1987","journal-title":"Proceedings on Principles of Database Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB11","series-title":"An Analysis of Questions: Preliminary Report","author":"Belnap","year":"1963"},{"key":"10.1016\/0743-1066(88)90006-4_BIB12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/6012.15409","article-title":"Positivism vs. Minimalism in Deductive Databases","author":"Bidoit","year":"1986","journal-title":"Proceedings of the ACM SIGACT-SIGMOD News Symposium on the Principles of Database Systems"},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0004-3702(71)90004-X","article-title":"Splitting and Reduction Heuristics in Automatic Theorem Proving","volume":"2","author":"Bledsoe","year":"1971","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB14","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\/0743-1066(88)90006-4_BIB15","series-title":"Logic Programming","first-page":"153","article-title":"Amalgamating Language and Metalanguage","author":"Bowen","year":"1982"},{"key":"10.1016\/0743-1066(88)90006-4_BIB16","series-title":"Meaning and Necessity (Enlarge Edition)","author":"Carnap","year":"1956"},{"key":"10.1016\/0743-1066(88)90006-4_BIB17","article-title":"Interfacing Predicate Logic Languages and Relational Databases","author":"Chakravarthy","year":"1982","journal-title":"Proceedings of the 1st Logic Programming Conference"},{"key":"10.1016\/0743-1066(88)90006-4_BIB18","series-title":"Expert Database Systems","first-page":"659","article-title":"Semantic Query Optimization in Expert Systems and Database Systems","author":"Chakravarthy","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB19","series-title":"Ph.D. Thesis","article-title":"Semantic Query Optimization in Deductive Databases","author":"Chakravarthy","year":"1985"},{"key":"10.1016\/0743-1066(88)90006-4_BIB20","first-page":"259","article-title":"Semantic Query Optimization: Additional Constraints and Control Strategies","author":"Chakravarthy","year":"1986","journal-title":"Proceedings on Expert Database Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB21","first-page":"67","article-title":"Foundations of Semantic Query Optimization for Deductive Databases","author":"Chakravarthy","year":"1986","journal-title":"Proceedings of the Workshop on Foundations of Deductive Databases and Logic Programming"},{"key":"10.1016\/0743-1066(88)90006-4_BIB22","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":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB23","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":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90006-4_BIB24","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/0743-1066(88)90006-4_BIB25","series-title":"Logic and Databases","first-page":"201","article-title":"DEDUCE 2: Futher Investigations of Deduction in Relational Databases","author":"Chang","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB26","first-page":"235","article-title":"On Evaluation of Queries Containing Derived Relations","volume":"Vol. 1","author":"Chang","year":"1981"},{"key":"10.1016\/0743-1066(88)90006-4_BIB27","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB28","series-title":"Machine Intelligence 10","first-page":"455","article-title":"A Language for Implementing Expert Systems","author":"Clark","year":"1982"},{"issue":"6","key":"10.1016\/0743-1066(88)90006-4_BIB29","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A Relational Model of Data for Large Shared Data Banks","volume":"13","author":"Codd","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-1066(88)90006-4_BIB30","series-title":"Technical Report","article-title":"\u201cUn Syst\u00e8me de Communication Homme-Machine en Francais","author":"Colmerauer","year":"1973"},{"key":"10.1016\/0743-1066(88)90006-4_BIB31","article-title":"An Interesting Natural Language Subset","author":"Colmerauer","year":"1977","journal-title":"Proceedings of the Workshop on Logic and Databases"},{"key":"10.1016\/0743-1066(88)90006-4_BIB32","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1051\/ita\/1979130403091","article-title":"Un Sous-Ensemble Int\u00e9ressante du Francais","volume":"4","author":"Colmerauer","year":"1979","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0743-1066(88)90006-4_BIB33","article-title":"Relational Structures Research","volume":"X","author":"Computer Corp. of America","year":"1967","journal-title":"Contract DA18-119-AMC-03409"},{"key":"10.1016\/0743-1066(88)90006-4_BIB34","series-title":"ESD-Tech. Rep.-68-404","article-title":"Fundamentals of Relational Structures","author":"Computer Corp. of America","year":"1969"},{"key":"10.1016\/0743-1066(88)90006-4_BIB35","article-title":"Relational Structures Applications Research","author":"Computer Corp. of America","year":"1969","journal-title":"DAAB03"},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB36","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/319682.319700","article-title":"On Database Systems Development through Logic","volume":"7","author":"Dahl","year":"1982","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB37","first-page":"271","article-title":"Integrity Enforcement on Deductive Databases","author":"Decker","year":"1986","journal-title":"Proceedings of EDS 86"},{"issue":"3","key":"10.1016\/0743-1066(88)90006-4_BIB38","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/359080.359090","article-title":"Logic and Semantic Networks","volume":"22","author":"Deliyanni","year":"1979","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB39","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/321510.321524","article-title":"The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas","volume":"16","author":"DiPaola","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB40","series-title":"Proceedings of the Symposium on Information Storage and Retrieval","article-title":"The Relational Data File and the Decision Problem for Classes of Proper Formulas","author":"DiPaola","year":"1971"},{"key":"10.1016\/0743-1066(88)90006-4_BIB41","series-title":"Proceedings of the Logic Programming Conference","first-page":"71","article-title":"Logic Programming: A Parallel Approach","author":"Eisinger","year":"1982"},{"key":"10.1016\/0743-1066(88)90006-4_BIB42","first-page":"268","article-title":"A Model-Theoretic Analysis of Knowledge","author":"Fagin","year":"1984","journal-title":"Proceedings of the 25th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0743-1066(88)90006-4_BIB43","first-page":"491","article-title":"Belief, Awareness and Limited Reasoning","author":"Fagin","year":"1985","journal-title":"Proceedings of the 9th International Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB44","article-title":"Experiments with a Resolution-Based Deductive Question-Answering System and a Proposed Clause Representation for Parallel Search","author":"Fishman","year":"1973","journal-title":"Ph.D. Thesis"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB45","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0004-3702(75)90005-3","article-title":"PI-Representation: A Clause Representation for Parallel Search","volume":"6","author":"Fishman","year":"1975","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB46","series-title":"Logic and Data Bases","first-page":"347","article-title":"The Application of PROLOG to the Development of QA and DBM Systems","author":"Futo","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB47","first-page":"352","article-title":"A Natural Language Database Interface that Provides Cooperative Answers","author":"Gal","year":"1985","journal-title":"Proceedings of the Second Conference on Artificial Intelligence Applications"},{"key":"10.1016\/0743-1066(88)90006-4_BIB48","series-title":"Logic and Databases","author":"Gallaire","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB49","volume":"Vol. 1","author":"Gallaire","year":"1981"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB50","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 Comput. Surveys"},{"key":"10.1016\/0743-1066(88)90006-4_BIB51","volume":"Vol. 2","author":"Gallaire","year":"1984"},{"key":"10.1016\/0743-1066(88)90006-4_BIB52","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/6012.15410","article-title":"The Extended Closed World Assumption and its Relation to Parallel Circumscription","author":"Gelfond","year":"1986","journal-title":"Proceedings of the ACM SIGACT News-SIGMOD Symposium on Principles of Database Systems"},{"issue":"3","key":"10.1016\/0743-1066(88)90006-4_BIB53","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(86)90001-9","article-title":"Negation as Failure: Careful Closure Procedure","volume":"30","author":"Gelfond","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB54","first-page":"195","article-title":"Optimization in Deductive and Conventional Relational Data Base Systems","volume":"Vol. 1","author":"Grant","year":"1981"},{"key":"10.1016\/0743-1066(88)90006-4_BIB55","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF00999727","article-title":"On Optimizing the Evaluation of a Set of Expressions","volume":"11","author":"Grant","year":"1982","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0743-1066(88)90006-4_BIB56","first-page":"259","article-title":"A Set Optimizing Algorithm","author":"Grant","year":"1982","journal-title":"Proceedings of the Conference on Information Sciences and Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB57","series-title":"Proceedings of the 23rd National Conference ACM","article-title":"The Use of Theorem-Proving Techniques in Question-Answering Systems","author":"Green","year":"1968"},{"key":"10.1016\/0743-1066(88)90006-4_BIB58","series-title":"Ph.D. Thesis","article-title":"The Application of Theorem Proving to Question-Answering Systems, Tech. Rep. CS 138","author":"Green","year":"1969"},{"key":"10.1016\/0743-1066(88)90006-4_BIB59","series-title":"Proceedings of the International Conference on Artificial Intelligence","first-page":"219","article-title":"Application of Theorem Proving to Problem Solving","author":"Green","year":"1969"},{"key":"10.1016\/0743-1066(88)90006-4_BIB60","series-title":"Machine Intelligence 4","first-page":"183","article-title":"Theorem Proving by Resolution as a Basis for Question-Answering Systems","author":"Green","year":"1969"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB61","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/321062.321073","article-title":"The Design and Simulation of an Information Processing System","volume":"8","author":"Gurk","year":"1961","journal-title":"J.Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB62","first-page":"137","article-title":"Knowledge-Based Query Processing","author":"Hammer","year":"1980","journal-title":"Proceedings of the 6th International Conference on Very Large Data Bases"},{"key":"10.1016\/0743-1066(88)90006-4_BIB63","series-title":"Communication: A Logical Model","author":"Harrah","year":"1963"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB64","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A Formal Basis for the Heuristic Determination of Minimum Cost Paths","volume":"SSC-4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Systems Cybernet."},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB65","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2422.2423","article-title":"On Compiling Queries in Recursive First-Order Databases","volume":"31","author":"Henschen","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB66","series-title":"Workshop on Foundations of Deductive Databases and Logic Programming","first-page":"22","article-title":"Compiling the GCWA and Indefinite Databases","author":"Henschen","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB67","first-page":"295","article-title":"Planner: A Language for Proving Theorems in Robots","author":"Hewitt","year":"1969","journal-title":"First International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB68","series-title":"DCL Memo No. 78","article-title":"LUSH Resolution and its Completeness","author":"Hill","year":"1974"},{"key":"10.1016\/0743-1066(88)90006-4_BIB69","article-title":"Programming Languages","author":"Hodes","year":"1966","journal-title":"Logic and Cooperative Games, presented at Symposium for Symbolic and Algebraic Manipulation"},{"key":"10.1016\/0743-1066(88)90006-4_BIB70","series-title":"Proceedings on the Foundations of Deductive Databases and Logic Programming","first-page":"242","article-title":"Automated Deduction in Databases with Incomplete Information","author":"Imielinski","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB71","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Intelligent Query Answering in Rule Based Systems","author":"Imielinski","year":"1987"},{"key":"10.1016\/0743-1066(88)90006-4_BIB72","series-title":"Proceedings of the First International Conference on Expert Database Systems","first-page":"209","article-title":"An algebraic Approach to Recursive Inference","author":"Ioannidis","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB73","series-title":"Proccedings eight International Joint Conference on Artificial Intelligence","first-page":"500","article-title":"Completeness of the Negation as Failure Rule","author":"Jaffar","year":"1983"},{"key":"10.1016\/0743-1066(88)90006-4_BIB74","first-page":"397","article-title":"On the Feasibility of Informative Answers","volume":"Vol. 1","author":"Janas","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB75","author":"Jaspersen","year":"1965","journal-title":"The Philosophy of Grammar"},{"key":"10.1016\/0743-1066(88)90006-4_BIB76","series-title":"Proceeding of the Workshop on Foundations of Deductive Databases and Logic Programming","article-title":"Logic Programming and Parallel Complexity","author":"Kanellakis","year":"1986"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB77","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(82)90035-2","article-title":"Cooperative Responses from a Portable Natural Language Query System","volume":"19","author":"Kaplan","year":"1982","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB78","series-title":"The Growth of Knowledge","first-page":"292","article-title":"Data-Retrieval by Computer: A Critical Survey","author":"Kasher","year":"1967"},{"key":"10.1016\/0743-1066(88)90006-4_BIB79","first-page":"544","article-title":"Prism: A Parallel Inference System for Problem Solving","author":"Kasif","year":"1983","journal-title":"Proceedings of the eighth International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB80","series-title":"Logic and Data Bases","first-page":"179","article-title":"Deductive Planning and Pathfinding for Relational Data Bases","author":"Kellogg","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB81","series-title":"Technical Report","article-title":"Query Optimization in Logic Databases","author":"Kifer","year":"1985"},{"key":"10.1016\/0743-1066(88)90006-4_BIB82","first-page":"510","article-title":"Quist: A System for Semantic Query Optimization in Relational Databases","author":"King","year":"1981","journal-title":"Proceedings of the 7th International Conference on Very Large Data Bases"},{"key":"10.1016\/0743-1066(88)90006-4_BIB83","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/321495.321499","article-title":"Automatic QA of English-Like Questions about Simple Diagrams","volume":"16","author":"Kochen","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB84","series-title":"Machine Intelligence 4","first-page":"87","article-title":"Semantic Trees in Automatic Theorem-Proving","author":"Kowalski","year":"1968"},{"key":"10.1016\/0743-1066(88)90006-4_BIB85","series-title":"Machine Intelligence 5","first-page":"179","article-title":"Search Strategies for Theorem Proving","author":"Kowalski","year":"1969"},{"key":"10.1016\/0743-1066(88)90006-4_BIB86","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","article-title":"Linear Resolution with Selection Function","volume":"Vol. 2","author":"Kowalski","year":"1971","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB87","series-title":"Machine Intelligence 7","first-page":"167","article-title":"AND-OR Graphs Theorem Proving Graphs and Bidirectional Search","author":"Kowalski","year":"1972"},{"key":"10.1016\/0743-1066(88)90006-4_BIB88","series-title":"Proceedings of IFIP 4","first-page":"569","article-title":"Predicate Logic as a Programming Language","author":"Kowalski","year":"1974"},{"key":"10.1016\/0743-1066(88)90006-4_BIB89","series-title":"Logic and Data Bases","article-title":"Logic for Data Description","author":"Kowalski","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB90","series-title":"Proceedings of the Workshop on Foundation of Deductive Databases and Logic Programming","first-page":"477","article-title":"An Application of General Purpose Theorem Proving to Database Integrity","author":"Kowalski","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB91","series-title":"RM-5428-PR","article-title":"Answering Questions by Computer: A Logical Study","author":"Kuhns","year":"1967"},{"key":"10.1016\/0743-1066(88)90006-4_BIB92","article-title":"Logical Aspects of Questions Answering by Computer","author":"Kuhns","year":"1969","journal-title":"resented at Third International Symposium on Computer and Information Sciences"},{"key":"10.1016\/0743-1066(88)90006-4_BIB93","series-title":"Proceedings of the Symposium Storage and Retrieval","first-page":"81","article-title":"Quantification in Query Systems","author":"Kuhns","year":"1971"},{"key":"10.1016\/0743-1066(88)90006-4_BIB94","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","article-title":"Closure and Fairness in the Semantics of Programing Logic","volume":"29","author":"Lassez","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(88)90006-4_BIB95","first-page":"198","article-title":"A Logic of Implicit & Explicit Belief","author":"Levesque","year":"1984","journal-title":"Proceedings of the National Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB96","series-title":"Relational Data File: A Tool for Mechanized Inference Execution and Data Retrieval","author":"Levien","year":"1965"},{"key":"10.1016\/0743-1066(88)90006-4_BIB97","first-page":"225","article-title":"Relational Data File II: Implementation","author":"Levien","year":"1967","journal-title":"Proceedings of the Annual National Colloquium on Information Retrieval"},{"key":"10.1016\/0743-1066(88)90006-4_BIB98","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/363790.363817","article-title":"A computer System for Inference Execution and Data Retrieval","volume":"10","author":"Levien","year":"1966","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-1066(88)90006-4_BIB99","series-title":"RM-5947-PR","article-title":"Relational Data File: Experience with a System for Propositional Data Storage and Inference Execution","author":"Levien","year":"1969"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB100","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0004-3702(85)90055-4","article-title":"Closed World Databases and Circumscription","volume":"27","author":"Lifschitz","year":"1985","journal-title":"Artification Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB101","first-page":"121","article-title":"Computing Circumscription","author":"Lifschitz","year":"1985","journal-title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence"},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB102","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(86)90028-7","article-title":"On the Satisfiability of Circumscription","volume":"28","author":"Lifschitz","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB103","first-page":"420","article-title":"On the Declaretive Semantics of Logic Programs with Negation","author":"Lifschitz","year":"1986","journal-title":"Proceedings on the Foundations of Deductive Databases and Logic Programming"},{"key":"10.1016\/0743-1066(88)90006-4_BIB104","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"issue":"3","key":"10.1016\/0743-1066(88)90006-4_BIB105","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","article-title":"Making PROLOG More Expressive","volume":"1","author":"Lloyd","year":"1984","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB106","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":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90006-4_BIB107","article-title":"Integrity Constraint Checking In Stratified Databases","author":"Lloyd","year":"1986","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB108","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0743-1066(86)90004-X","article-title":"Basis for Deductive Database Systems II","volume":"3","author":"Lloyd","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90006-4_BIB109","series-title":"Computer Science Center Tech. Rep. 1861","article-title":"A Metainterpreter to Semantically Optimize Queries in Deductive Databases","author":"Lobo","year":"1987"},{"key":"10.1016\/0743-1066(88)90006-4_BIB110","series-title":"ASP User's Manual Association Storing Processor Interpreter Program, Revised","author":"Love","year":"1970"},{"key":"10.1016\/0743-1066(88)90006-4_BIB111","first-page":"173","article-title":"Evaluating Queries in Deductive Databases by Generating","author":"Lozinskii","year":"1985","journal-title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB112","article-title":"Computer Comprehension of Natural Language","author":"Marill","year":"1969","journal-title":"a Progress Report on the Relational Structure System"},{"key":"10.1016\/0743-1066(88)90006-4_BIB113","series-title":"Information Retrieval","first-page":"211","article-title":"Relational Data File Design I: Design Philosophy","author":"Maron","year":"1967"},{"issue":"1 and 2","key":"10.1016\/0743-1066(88)90006-4_BIB114","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription\u2014A Form of Nonmonotonic Reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB115","first-page":"295","article-title":"Application of Circumscription to Formalizing Common Sense Knowledge","author":"McCarthy","year":"1984","journal-title":"Proceeding of the AAAI Workshop on Non-monotonic Reasoning"},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB116","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","article-title":"Applications of Circumscription to Formalizing Common Sense Knowledge","volume":"28","author":"McCarhty","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB117","series-title":"Ph.D. Dissertation","article-title":"Techniques for Employing Semantic Information in Question-Answering Systems","author":"McSkimin","year":"1976"},{"key":"10.1016\/0743-1066(88)90006-4_BIB118","first-page":"50","article-title":"The Use of Semantic Network i Deductive Question-Answering Systems","author":"McSkimin","year":"1977","journal-title":"Proccedings of IJCAI 5"},{"key":"10.1016\/0743-1066(88)90006-4_BIB119","first-page":"53","article-title":"A Multi-level File Structure for Information Processing","author":"Minker","year":"1960","journal-title":"Proceedings of the Western Joint Computer Conference NJCC No. 17"},{"key":"10.1016\/0743-1066(88)90006-4_BIB120","article-title":"File Organization and Data Management","volume":"Vol. 2","author":"Minker","year":"1967","journal-title":"Annual Review of Information Sceince and Technology"},{"key":"10.1016\/0743-1066(88)90006-4_BIB121","series-title":"AUER-1776-Tech. Rep.-1","article-title":"Relational Data System Study, Final Report","author":"Minker","year":"1970"},{"key":"10.1016\/0743-1066(88)90006-4_BIB122","series-title":"RADC-Tech. Rep.-70-180","article-title":"Relational Data System Study, Final Report","author":"Minker","year":"1970"},{"key":"10.1016\/0743-1066(88)90006-4_BIB123","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0004-3702(73)90013-1","article-title":"The Q* algorithm\u2014a Search Strategy for a Deductive Question-Answering System","volume":"4","author":"Minker","year":"1973","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB124","first-page":"79","article-title":"Performing Inferences over Relational Databases","author":"Minker","year":"1975","journal-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data"},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB125","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/320241.320242","article-title":"Search Strategy and Selection Function for an Inferential Relational System","volume":"3","author":"Minker","year":"1978","journal-title":"Trans. Data Base Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB126","series-title":"Logic and Data Bases","first-page":"107","article-title":"An Experimental Relational Data Base System Based on Logic","author":"Minker","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB127","series-title":"Tech. Rep. 736","article-title":"LUST Resolution: Resolution with Arbitrary Selection Functionk","author":"Minker","year":"1979"},{"key":"10.1016\/0743-1066(88)90006-4_BIB128","series-title":"Tech. Rep. 1119","article-title":"On Recursive Axioms in Relational Databases","author":"Minker","year":"1981"},{"key":"10.1016\/0743-1066(88)90006-4_BIB129","first-page":"292","article-title":"On Indefinite Databases and the Closed World Assumption","volume":"138","author":"Minker","year":"1982"},{"issue":"3","key":"10.1016\/0743-1066(88)90006-4_BIB130","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(82)90035-7","article-title":"An Extension to Linear Resolution with Selection Function","volume":"14","author":"Minker","year":"1982","journal-title":"Inform. Process. Lett"},{"issue":"4","key":"10.1016\/0743-1066(88)90006-4_BIB131","first-page":"1","article-title":"On Recursive Axioms in Deductive Databases","volume":"7","author":"Minker","year":"1982","journal-title":"Inform. Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB132","article-title":"Applications of Protected Circumscription","author":"Minker","year":"1984","journal-title":"Proceedings of the Conference on Automated Deduction"},{"key":"10.1016\/0743-1066(88)90006-4_BIB133","first-page":"337","article-title":"Protected Circumscription","author":"Minker","year":"1984","journal-title":"Proceedings of the Workshop on Non-monotonic Reasoning"},{"issue":"4","key":"10.1016\/0743-1066(88)90006-4_BIB134","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":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90006-4_BIB135","series-title":"Advances in Computing Research","first-page":"247","article-title":"Answering Queries in Indefinite Databases and the Null Value Problem","author":"Minker","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB136","author":"Minker","year":"1986","journal-title":"Proceedings of Workshop on Foundations of Deductive Databases and Logic Programming"},{"key":"10.1016\/0743-1066(88)90006-4_BIB137","first-page":"145","article-title":"Automated Language Proceesing","volume":"Vol. 4","author":"Montgomery","year":"1969"},{"key":"10.1016\/0743-1066(88)90006-4_BIB138","first-page":"1","article-title":"Challenge for Knowledge Information Processing Systems (Preliminay Report on Fifth Generation Computer Systems","author":"Moto-Oka","year":"1981","journal-title":"Proceedings of the International Conference on Fifth Generation Computer Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB139","series-title":"Tech. Rep. 83\/10","article-title":"The MU-PROLOG Deductive Database","author":"Naish","year":"1983"},{"key":"10.1016\/0743-1066(88)90006-4_BIB140","series-title":"Proceedings of the 1st Annual National Conference on Artificial Intelligence","first-page":"263","article-title":"Performing Inferences over Recursive Data Bases","author":"Naqvi","year":"1980"},{"key":"10.1016\/0743-1066(88)90006-4_BIB141","series-title":"Proceedings of Workshop on Foundations of Deductive Databases and Logic Programming","first-page":"378","article-title":"Logic for Negation in Database Systems","author":"Naqvi","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB142","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/28659.28684","article-title":"A Decidable of Bounded Recursions","author":"Naughton","year":"1987","journal-title":"Proceedings of the Sixth ACM SIGACT News-SIGMOD-SIGART Symposium on Principles of Database Systams"},{"key":"10.1016\/0743-1066(88)90006-4_BIB143","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1145\/28659.28695","article-title":"One-Sided Recursions","author":"Naughton","year":"1987","journal-title":"Proceedings of the Sixth ACM SIGACT News-SIGMOD-SIGART Symposium on Principles of Database Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB144","first-page":"595","article-title":"Natural Question-Answering and Automatic Deduction in System SYNTEX","author":"Nicolas","year":"1974","journal-title":"Proceedings of IFIP Congress 1974"},{"key":"10.1016\/0743-1066(88)90006-4_BIB145","series-title":"Logic and Databases","first-page":"325","article-title":"Integrity Checking in Deductive Database","author":"Nicola","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB146","series-title":"Logic and Data Bases","first-page":"33","article-title":"Data Base: Theory vs. Interpretation","author":"Nicolas","year":"1978"},{"issue":"3","key":"10.1016\/0743-1066(88)90006-4_BIB147","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00263192","article-title":"Logic for Improving Integrity Checking in Relational Data Bases","volume":"18","author":"Nicolas","year":"1982","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB148","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(86)90029-9","article-title":"Completeness Results for Circumscription","volume":"28","author":"Perlis","year":"1986","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB149","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0004-3702(87)90020-8","article-title":"Circumscribing with Sets","volume":"31","author":"Perlis","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB150","series-title":"Logic and Data Bases","first-page":"409","article-title":"High Level Data Base Query Languages","author":"Pirotte","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB151","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and LogicProgramming","first-page":"102","article-title":"Semantic Unification for Knowledge Base Deduction","author":"Porto","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB152","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and LogicProgramming","first-page":"433","article-title":"On the Semantics of Stratified Deductive Databases","author":"Przymusinski","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB153","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/12808.12818","article-title":"A Query Answering Algorithm for Circumscriptive Theories","author":"Przymusinski","year":"1986","journal-title":"Proceedings of the ACM SIGART International Symposium on Methodologies for Intelligent Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB154","first-page":"186","article-title":"Query Answering in Circumscriptive and Closed World Theories","author":"Przymusinski","year":"1986","journal-title":"Proceedings of the American Association for Artificial Intelligence '86"},{"key":"10.1016\/0743-1066(88)90006-4_BIB155","series-title":"Ph.D. Thesis","article-title":"SIR: A Computer Program for Semantic Information Retrieval","author":"Raphael","year":"1964"},{"key":"10.1016\/0743-1066(88)90006-4_BIB156","first-page":"577","article-title":"SIR: A Computer Program for Semantic Information Retrieval","volume":"Vol. 26","author":"Raphael","year":"1964"},{"key":"10.1016\/0743-1066(88)90006-4_BIB157","series-title":"Semantic Information Processing","first-page":"33","article-title":"A Computer Program for Semantic Information Retrieval","author":"Raphael","year":"1968"},{"key":"10.1016\/0743-1066(88)90006-4_BIB158","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1145\/321662.321678","article-title":"Two Results on Ordering for Resolution with Merging Linear Format","volume":"18","author":"Reiter","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB159","series-title":"Tech. Report 3649","article-title":"An Approach to Deductive Question-Answering","author":"Reiter","year":"1977"},{"key":"10.1016\/0743-1066(88)90006-4_BIB160","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\/0743-1066(88)90006-4_BIB161","series-title":"Logic and Data Bases","first-page":"55","article-title":"On Closed World Data Bases","author":"Reiter","year":"1978"},{"key":"10.1016\/0743-1066(88)90006-4_BIB162","article-title":"On Structuring a First-Order Database","author":"Reiter","year":"1978","journal-title":"Proceedings of the Second Canadian Society for Computer Science National Conference"},{"issue":"1 and 2","key":"10.1016\/0743-1066(88)90006-4_BIB163","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A Logic for Default Reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90006-4_BIB165","series-title":"On Conceptual Modelling","first-page":"163","article-title":"Towards a Logical Reconstruction of Relational Database Theory","author":"Reiter","year":"1984"},{"key":"10.1016\/0743-1066(88)90006-4_BIB166","series-title":"Technical Report 187\/86","article-title":"A Theory of Diagnosis from First Priciples","author":"Reiter","year":"1986"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB167","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/5383.5388","article-title":"Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values","volume":"33","author":"Reiter","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB168","doi-asserted-by":"crossref","unstructured":"Reiter, R., Nonmonotonic Reasoning, Ann. Rev. Comput. Sci., to appear.","DOI":"10.1016\/B978-0-934613-67-5.50016-2"},{"key":"10.1016\/0743-1066(88)90006-4_BIB169","series-title":"Tech. Rep. 911","article-title":"ZMOB: A Highly Parallel Multiprocessor","author":"Rieger","year":"1980"},{"issue":"No. 1","key":"10.1016\/0743-1066(88)90006-4_BIB170","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. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB171","series-title":"PROLOG: Manuel de R\u00e9f\u00e9rence et d'Utilisation","author":"Roussel","year":"1975"},{"key":"10.1016\/0743-1066(88)90006-4_BIB172","first-page":"136","article-title":"Optimizing Datalog Programs","author":"Sagiv","year":"1986","journal-title":"Proceedings of the Workshop on Foundations of Deductive Databases and LogicProgramming"},{"key":"10.1016\/0743-1066(88)90006-4_BIB173","series-title":"Annual Review of Information Science and Technology","first-page":"169","article-title":"Automated Language Processing","author":"Salton","year":"1968"},{"key":"10.1016\/0743-1066(88)90006-4_BIB174","article-title":"Association Storing Processor","volume":"Vol. II","author":"Savitt","year":"1967"},{"key":"10.1016\/0743-1066(88)90006-4_BIB175","first-page":"87","article-title":"ASP: A New Concept In Language and Machine Organization","author":"Savitt","year":"1967","journal-title":"1967 Spring Joint Computer Conference"},{"key":"10.1016\/0743-1066(88)90006-4_BIB176","first-page":"23","article-title":"Access Path Election in a Relational Database Management System","volume":"30","author":"Selinger","year":"1979","journal-title":"Proceedings of the ACM-SIGMOD International conference on Management of Data"},{"key":"10.1016\/0743-1066(88)90006-4_BIB177","series-title":"Ph.D. Thesis","article-title":"Optimization of Extended Relational Database Systems","author":"Sellis","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB178","doi-asserted-by":"crossref","DOI":"10.1145\/16894.16874","article-title":"Global Query Optimization","author":"Sellis","year":"1986","journal-title":"Proceedings of the 1986 ACM-SIGMOD International Conference on Management of Data"},{"issue":"15","key":"10.1016\/0743-1066(88)90006-4_BIB179","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","article-title":"Negation as Finite Failure: A Comparison of Clark's Completed Data Base andReiter's Closed World Assumption","volume":"1","author":"Shepherdson","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(88)90006-4_BIB180","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Negation in Logic Programming","author":"Shepherdson","year":"1987"},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB181","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/363707.363732","article-title":"Answering English Questions by Computer: A Survey","volume":"8","author":"Simmons","year":"1965","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-1066(88)90006-4_BIB182","series-title":"Annual Review Series","first-page":"137","article-title":"Automated Language Processing","author":"Simmons","year":"1966"},{"issue":"1","key":"10.1016\/0743-1066(88)90006-4_BIB183","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/361953.361963","article-title":"Natural Language Question-Answering Systems: 1969","volume":"13","author":"Simmons","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-1066(88)90006-4_BIB184","series-title":"CS84-17","author":"Sterling","year":"1984"},{"key":"10.1016\/0743-1066(88)90006-4_BIB185","series-title":"Technical Report 125-85","first-page":"163","article-title":"An Explanation Shell for Expert Systems","author":"Sterling","year":"1985"},{"key":"10.1016\/0743-1066(88)90006-4_BIB186","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and LogicProgramming","article-title":"Meta-interpreters: The Flavors of Logic Programming","author":"Sterling","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB187","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and LogicProgramming","first-page":"118","article-title":"A Superjoin Algorithm for Deductive Databases","author":"Thom","year":"1986"},{"key":"10.1016\/0743-1066(88)90006-4_BIB188","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and LogicProgramming","first-page":"403","article-title":"On Domain Independent Databases","author":"Topor","year":"1986"},{"issue":"3","key":"10.1016\/0743-1066(88)90006-4_BIB189","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/3979.3980","article-title":"Implementation of Logical Query Languages for Databases","volume":"10","author":"Ullman","year":"1985","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0743-1066(88)90006-4_BIB190","article-title":"Database Theory\u2014Past and Future","author":"Ullman","year":"1987","journal-title":"Proceedings on the Principles of Database Theory"},{"key":"10.1016\/0743-1066(88)90006-4_BIB191","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":"van Emden","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB192","series-title":"Proceedings of the Workshop on Foundations of Deductive Databases and LogicProgramming","first-page":"712","article-title":"Negation as Failure Using Tight Derivations for General Logic Programs","author":"Van Gelder","year":"1986"},{"issue":"2","key":"10.1016\/0743-1066(88)90006-4_BIB193","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/360666.360672","article-title":"Problem-Reduction and Theorem Proving\u2014Some Relationships","volume":"18","author":"VanderBrug","year":"1975","journal-title":"Comm. ACM"},{"issue":"5","key":"10.1016\/0743-1066(88)90006-4_BIB194","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0020-0190(81)90025-9","article-title":"The Decision Problem for Database Dependencies","volume":"12","author":"Vardi","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-1066(88)90006-4_BIB195","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/B978-0-934613-04-0.50024-7","article-title":"On Epistemic Logic and Logical Omniscience","author":"Vardi","year":"1986","journal-title":"Proceedings on the Theoretical Aspects of Reasoning about Knowledge"},{"key":"10.1016\/0743-1066(88)90006-4_BIB196","article-title":"Implementing PROLOG","volume":"40","author":"Warren","year":"1977"},{"key":"10.1016\/0743-1066(88)90006-4_BIB197","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/872736.806939","article-title":"PROLOG\u2014The Language and its Implementation Compared with LIST","author":"Warren","year":"1977","journal-title":"SIGART Newsletter"},{"key":"10.1016\/0743-1066(88)90006-4_BIB198","first-page":"272","author":"Warren","year":"1981","journal-title":"Efficient Processing of Interactive Relational Conference on Very Large Data Bases"},{"key":"10.1016\/0743-1066(88)90006-4_BIB199","series-title":"Tech. Rep. 470","article-title":"Resolution, Refinements and Search Strategies\u2014A Comparative Study","author":"Wilson","year":"1976"},{"key":"10.1016\/0743-1066(88)90006-4_BIB200","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1976.1674697","article-title":"Resolution Refinements and Search Strategies\u2014A Comparative Study","volume":"C-25(8)","author":"Wilson","year":"1976","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0743-1066(88)90006-4_BIB201","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01002330","article-title":"A Note on Answer Extraction in Resoulution Based Systems","volume":"6","author":"Wilson","year":"1977","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0743-1066(88)90006-4_BIB202","first-page":"698","article-title":"The Concept of Demodulation in theorem Proving","volume":"11","author":"Wos","year":"1964","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB203","author":"Wos","year":"1965","journal-title":"Unpublished notes"},{"key":"10.1016\/0743-1066(88)90006-4_BIB204","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/321296.321302","article-title":"Efficiency and Completeness of the Set of Support Strategy in Theorem Proving","volume":"12","author":"Wos","year":"1965","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90006-4_BIB205","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":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106688900064?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106688900064?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:13:18Z","timestamp":1704208398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106688900064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":204,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0743106688900064"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(88)90006-4","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}