{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:42:10Z","timestamp":1747546930085,"version":"3.40.4"},"reference-count":35,"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.50007-5","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T16:05:11Z","timestamp":1404230711000},"page":"149-176","source":"Crossref","is-referenced-by-count":62,"title":["Negation as Failure Using Tight Derivations for General Logic Programs"],"prefix":"10.1016","author":[{"given":"Allen","family":"Van Gelder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib1","doi-asserted-by":"crossref","unstructured":"Aho, A. V. and Ullman, J. D. [1979] Universality of Data Retrieval Languages, 6th ACM Symp. on Principles of Programming Languages, 110\u2013120","DOI":"10.1145\/567752.567763"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib2","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50007-5_bib3","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.50007-5_bib4","unstructured":"Brough, D. R, and Walker, A. [1984] Some Practical Properties of Logic Programming Interpreters, International Conference on Fifth Generation Computer Systems, 149\u2013156, Institute for New Generation Computing, Tokyo, Japan"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib5","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1987"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50007-5_bib6","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"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50007-5_bib7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0743-1066(84)90001-3","article-title":"A Logical Reconstruction of Prolog II","volume":"1","author":"Emden","year":"1984","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50007-5_bib8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2422.2423","article-title":"On Compiling Queries in First-Order Databases","volume":"31","author":"Henschen","year":"1984","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib9","unstructured":"Jaffar, J., Lassez, J.-L., and Lloyd, J. [1983] Completeness of the Negation-as-Failure Rule, Int'l Joint Conf. on Artificial Intelligence, 500\u2013506"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50007-5_bib10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0743-1066(86)90018-X","article-title":"Comments on \u201cGeneral Failure of Logic Programs,\u201d","volume":"3","author":"Jaffar","year":"1986","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50007-5_bib11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0743-1066(85)90016-0","article-title":"General Failure of Logic Programs","volume":"2","author":"Le","year":"1985","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50007-5_bib12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0743-1066(85)80004-2","article-title":"Negation-as-Failure Rule for General Logic Programs with Equality","volume":"2","author":"Le","year":"1985","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib13","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"},{"year":"1984","series-title":"Foundations of Logic Programming","author":"Lloyd","key":"10.1016\/B978-0-934613-40-8.50007-5_bib14"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib15","unstructured":"Lassez, J. L. and Marriot, K. [1986] Explicit Representation of Terms Defined by Counter Examples, Proc. Workshop on Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), 659\u2013677"},{"year":"1978","series-title":"Automated Theorem Proving: A Logical Basis","author":"Loveland","key":"10.1016\/B978-0-934613-40-8.50007-5_bib16"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib17","unstructured":"Lozinskii, E. L. [1985] Evaluating Queries in Deductive Databases by Generating, Proc. 9th Int. Joint Conf. on Artificial Intelligence, 173\u2013177"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib18","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"627","article-title":"Equivalences of Logic Programs","author":"Maher","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib19","unstructured":"McKay D. and Shapiro, S. [1981] Using Active Connection Graphs for Reasoning with Recursive Rules, Proc. 7th Int. Joint Conf. on Artificial Intelligence, 368\u2013374"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib20","doi-asserted-by":"crossref","unstructured":"Morris, K., Ullman, J. D., and Van Gelder, A. [1986] Design Overview of the Nail! System, Third Int'l Conf. on Logic Programming, 554\u2013568","DOI":"10.1007\/3-540-16492-8_104"},{"year":"1983","series-title":"Automatic Generation of Control for Logic Programs","author":"Naish","key":"10.1016\/B978-0-934613-40-8.50007-5_bib21"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib22","unstructured":"Naish, L. [1985] Negation and Control in Prolog. PhD thesis, University of Melbourne"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib23","unstructured":"Naqvi, S. A., [1986] A Logic for Negation in Database Systems, in Proc. Workshop on Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), 378\u2013387"},{"year":"1985","series-title":"Earley Deduction","author":"Porter III","key":"10.1016\/B978-0-934613-40-8.50007-5_bib24"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib25","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the Semantics of Stratified Deductive Databases","author":"Przymusinski","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib26","series-title":"Logic and Databases","first-page":"55","article-title":"On Closed World Databases","author":"Reiter","year":"1978"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50007-5_bib27","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(85)90018-4","article-title":"Negation as Failure, II","volume":"2","author":"Shepherdson","year":"1985","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib28","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"19","article-title":"Negation in Logic Programming","author":"Shepherdson","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib29","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"217","article-title":"On Domain Independent Databases","author":"Topor","year":"1988"},{"year":"1980","series-title":"Principles of Database Systems","author":"Ullman","key":"10.1016\/B978-0-934613-40-8.50007-5_bib30"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50007-5_bib31","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. on Database Systems"},{"year":"1985","series-title":"Testing Applicability of Top-Down Capture Rules","author":"Ullman","key":"10.1016\/B978-0-934613-40-8.50007-5_bib32"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib33","doi-asserted-by":"crossref","unstructured":"Van Gelder, A. [1986] A Message Passing Framework for Logical Query Evaluation, 1986 ACM-SIGMOD Conf. on Management of Data, 155\u2013165","DOI":"10.1145\/16856.16870"},{"key":"10.1016\/B978-0-934613-40-8.50007-5_bib34","unstructured":"Vieille, L. [1986] Recursive Axioms in Deductive Databases: The Query Subquery Approach, Proceedings First International Conference on Expert Databases, Charleston, SC, 179\u2013194"},{"year":"1981","series-title":"Syllog: A Knowledge Based Data Management System","author":"Walker","key":"10.1016\/B978-0-934613-40-8.50007-5_bib35"}],"container-title":["Foundations of Deductive Databases and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780934613408500075?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780934613408500075?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:21:31Z","timestamp":1746289291000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780934613408500075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780934613408"],"references-count":35,"URL":"https:\/\/doi.org\/10.1016\/b978-0-934613-40-8.50007-5","relation":{},"subject":[],"published":{"date-parts":[[1988]]}}}