{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:52:57Z","timestamp":1768452777613,"version":"3.49.0"},"reference-count":42,"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.50006-3","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T16:05:33Z","timestamp":1404230733000},"page":"89-148","source":"Crossref","is-referenced-by-count":478,"title":["Towards a Theory of Declarative Knowledge"],"prefix":"10.1016","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[]},{"given":"Howard A.","family":"Blair","sequence":"additional","affiliation":[]},{"given":"Adrian","family":"Walker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02432149","article-title":"Negation as Failure: Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions","volume":"2","author":"Aquilano","year":"1986","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib2","unstructured":"Artificial Intelligence [1980] 13(1)"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50006-3_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.50006-3_bib4","doi-asserted-by":"crossref","unstructured":"Apt, K. R. and Pugin, J. M. [1987] Maintenance of Stratified Databases Viewed as a Belief Revision System, in Proc. of the 6th ACM Symposium on Principles of Database Systems, San Diego, CA, 136\u2013145","DOI":"10.1145\/28659.28674"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0019-9958(82)91234-7","article-title":"Recursion Theoretic Complexity of the Semantics of Predicate Logic as a Programming Language","volume":"54","author":"Blair","year":"1982","journal-title":"Information and Control"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib6","doi-asserted-by":"crossref","unstructured":"Bidoit, N. and Hull, R. [1986] Positivism Versus Minimalism in Deductive Databases, Proc. of the 5th 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.50006-3_bib7","doi-asserted-by":"crossref","unstructured":"Barbuti, R. and Martelli, M. [1986] Completeness of the SLDNF-Resolution for a Class of Logic Programs, Proc. of the 3rd International Conference on Logic Programming, Lecture Notes in Computer Science, No. 227, Springer-Verlag, Berlin, 600\u2013613","DOI":"10.1007\/3-540-16492-8_109"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib8","unstructured":"Brough, D. and Walker, A. [1984] Some Practical Properties of Logic Programming Interpreters, Proc. of the Japan FGCS84 Conference, 149\u2013156"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib9","series-title":"Completeness Results for SLDNF-Resolution","author":"Cavedon","year":"1987"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib10","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50006-3_bib11","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":"The Journal of Logic Programming"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50006-3_bib12","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0743-1066(86)90003-8","article-title":"Quantitative Deduction and Its Fixpoint Theory","volume":"3","author":"Emden","year":"1986","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50006-3_bib13","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.50006-3_bib14","series-title":"Logic Programming Based on Logic","author":"Fitting","year":"1985"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib15","series-title":"Logics and Models of Concurrent Systems","first-page":"439","article-title":"Theoretical Foundations for Non-monotonic Reasoning in Expert Systems","author":"Gabbay","year":"1985"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib16","article-title":"A Graph-based Interpreter for General Horn Clauses","author":"Gallier","year":"1988","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib17","series-title":"LUSH-Resolution and Its Completeness","author":"Hill","year":"1974"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib18","unstructured":"Jaffar, J., Lassez, J.-L., and Lloyd, J. W. [1983] Completeness of the Negation as a Failure Rule, IJCAI-83, 500\u2013506"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib19","first-page":"569","article-title":"Predicate Logic as a Programming Language","volume":"74","author":"Kowalski","year":"1974","journal-title":"IFIP"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib20","series-title":"Signed Data Dependencies in Logic Programs","author":"Kunen","year":"1987"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib21","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.50006-3_bib22","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib23","series-title":"Integrity Constraint Checking in Stratified Databases","author":"Lloyd","year":"1986"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50006-3_bib24","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":"1985","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50006-3_bib25","first-page":"295","article-title":"Circumscription\u2014A Form of Nonmonotonic Reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib26","doi-asserted-by":"crossref","unstructured":"Minker, J. [1982] On Indefinite Databases and the Closed World Assumption, Proc. of the 6th Conference on Automated Deduction (D. W. Loveland, Ed.), Lecture Notes in Computer Science 138, Springer-Verlag, Berlin, 292\u2013308","DOI":"10.1007\/BFb0000066"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib27","unstructured":"Naqvi, S. A. [1986] A Logic for Negation in Database Systems, in Proc. of the Workshop on Foundations of Deductive Databases and Logic Programming, Washington, DC, 378\u2013387"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib28","unstructured":"Proc. of the AAAI Workshop on Non-monotonic Reasoning [1984]"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib29","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.50006-3_bib30","series-title":"Logic and Databases","first-page":"55","article-title":"On Closed World Data Bases","author":"Reiter","year":"1978"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib31","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib32","unstructured":"Sandewall, E. [1985] A Functional Approach to Non-monotonic Logic, IJCAI-85, 100\u2013106"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib33","series-title":"Logic Programming","first-page":"325","article-title":"Horn Clause Programs for Recursive Functions","author":"Sebelik","year":"1982"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50006-3_bib34","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","article-title":"Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption","volume":"1","author":"Shepherdson","year":"1984","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50006-3_bib35","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.50006-3_bib36","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.50006-3_bib37","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01932293","article-title":"Horn Clause Compatibility","volume":"17","author":"T\u00e4rnlund","year":"1977","journal-title":"BIT"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib38","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A Lattice-theoretical Fixpoint Theorem and Its Applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib39","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"217","article-title":"On Domain Independent Databases","author":"Topor","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib40","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"149","article-title":"Negation as Failure Using Tight Derivations for General Logic Programs","author":"Van Gelder","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50006-3_bib41","series-title":"Logic Programming and Its Applications","first-page":"32","article-title":"Syllog: An Approach to Prolog for Non-programmers","author":"Walker","year":"1986"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50006-3_bib42","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1147\/rd.301.0002","article-title":"A Knowledge Systems: Principles and Practice","volume":"30","author":"Walker","year":"1986","journal-title":"IBM Journal Res. Develop"}],"container-title":["Foundations of Deductive Databases and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780934613408500063?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780934613408500063?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\/B9780934613408500063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780934613408"],"references-count":42,"URL":"https:\/\/doi.org\/10.1016\/b978-0-934613-40-8.50006-3","relation":{},"subject":[],"published":{"date-parts":[[1988]]}}}