{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:06Z","timestamp":1760202666447},"reference-count":58,"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.50005-1","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T16:07:02Z","timestamp":1404230822000},"page":"19-88","source":"Crossref","is-referenced-by-count":94,"title":["Negation in Logic Programming"],"prefix":"10.1016","author":[{"given":"John C.","family":"Shepherdson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib1","series-title":"Foundations of Deductive Database and Logic Programming","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_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.ACM"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib3","unstructured":"Barbuti, R. and Martelli, M. [1986] Completeness of SLDNF-resolution for Structured Programs, submitted to Theoretical Computer Science 21"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0019-9958(82)91234-7","article-title":"The 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.50005-1_bib5","unstructured":"Blair, H. A. [1986] Decidability in the Herbrand Base, in Proceedings Workshop on Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Washington, DC"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib6","unstructured":"Borger, E. [1987] Unsolvable Decision Problems for PROLOG Programs, to appear in Computer Theory and Logic (E. Borger, Ed.), Lecture Notes in Computer Science, Springer-Verlag"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib7","unstructured":"Carvalho, R. L. de, Maibaum, T. S. E., Pequeno, T. H. C., Pereda, A. A., and Veloso, P. A. S. [1980] A Model Theoretic Approach to the Theory of Abstract Data Types and Data Structures, Research Report CS-80\u201322, Waterloo, Ontario"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib8","series-title":"Logic and Data Base","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib9","series-title":"Automation of Reasoning","first-page":"1","article-title":"The Prehistory and Early History of Automated Deduction","author":"Davis","year":"1983"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01982047","article-title":"Uber eine Pradikaten Logik mit Partiell Definierten Pradikaten and Funktionen","volume":"12","author":"Ebbinghaus","year":"1969","journal-title":"Arch. math. Logik"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene Semantics for General Logic Programs","volume":"2","author":"Fitting","year":"1985","journal-title":"Logic Programming"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50005-1_bib12","first-page":"251","article-title":"N-Prolog: An Extension of Prolog with Hypothetical Implication. II. Logical Foundations, and Negation as Failure","volume":"2","author":"Gabbay","year":"1985","journal-title":"Ibid"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib13","unstructured":"Gabbay, D. M. [1986] Modal Provability Foundations for Negation by Failure, preprint"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50005-1_bib14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(86)90002-6","article-title":"Negation as Inconsistency","volume":"3","author":"Gabbay","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib15","series-title":"HORNLOG: A Graph Based Interpreter for General Horn Clauses","author":"Gallier","year":"1986"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib16","unstructured":"Gallier, J. H. and Raatz, S. [1986b] SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification, to appear, J. Logic Programming. Short version to appear, 1986 IEEE Symposium on Logic Programming, Salt Lake City, UT"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib17","doi-asserted-by":"crossref","unstructured":"Gelfond, M., Przymusinska H., and Przymusinski, T. [1986] The Extended Closed World Assumption and Its Relationship to Parallel Circumscription, Proceedings ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Cambridge, MA, 133\u2013139","DOI":"10.1145\/6012.15410"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib18","series-title":"Institutions: Abstract Model Theory for Computer Science","first-page":"221","author":"Goguen","year":"1984"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib19","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The Intractability of Resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib20","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"395","article-title":"Compiling the GCWA in Indefinite Databases","author":"Henschen","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib21","unstructured":"Hodges, W. [1985] The Logical Basis of PROLOG, unpublished text of lecture, 1\u201310"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib22","unstructured":"Jaffar, J., Lassez, J.-L., and Lloyd, J. W. [1983] Completeness of the Negation as Failure Rule, IJCAI-83, Karlsruhe, 500\u2013506"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50005-1_bib23","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0743-1066(84)90010-4","article-title":"A Theory of Complete Logic Programs with Equality","volume":"1","author":"Jaffar","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib24","series-title":"Logic Programming Relations, Functions and Equations","article-title":"A Logic Programming Language Scheme","author":"Jaffar","year":"1984"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50005-1_bib25","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":"J. Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib26","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Lassez, J.-L., and Maher, M. J. [1986b] Some Issues and Trends in the Semantics of Logic Programs, Proceedings International Conference on Logic Programming, 223\u2013241","DOI":"10.1007\/3-540-16492-8_78"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib27","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0743-1066(86)90020-8","article-title":"Canonical Logic Programs","volume":"3","author":"Jaffar","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib28","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib29","series-title":"Logic for Problem Solving","author":"Kowalski","year":"1979"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib30","unstructured":"Kunen, K. [1986] Negation in Logic Programming, to appear in J. Logic Programming, 15 pp."},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib31","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","article-title":"Closures 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.50005-1_bib32","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0304-3975(85)90128-8","article-title":"Optimal Fixedpoints of Logic Programs","volume":"39","author":"Lassez","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib33","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/322047.322059","article-title":"Renaming a Set of Clauses as a Horn Set","volume":"25","author":"Lewis","year":"1978","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib34","unstructured":"Lifschitz, V. [1985] Computing Circumscription, Proceedings IJCAI-85, 121\u2013127"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib35","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.50005-1_bib36","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"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib37","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib38","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0743-1066(85)90013-5","article-title":"A Basis for Deductive Data Base Systems","volume":"2","author":"Lloyd","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib39","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0743-1066(86)90004-X","article-title":"A Basis for Deductive Data Base Systems, II","volume":"3","author":"Lloyd","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib40","unstructured":"McCarthy, J. [1984] Applications of Circumscription to Formalizing Common Sense Knowledge, AAAI Workshop on Non-Monotonic Reasoning, 295\u2013323"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib41","doi-asserted-by":"crossref","unstructured":"Mahr, B. and Makowsky, J. A. [1983] Characterizing Specification Languages which Admit Initial Semantics, Proc. 8th CAAP, Lecture Notes in Computer Science 159, Springer-Verlag, 300\u2013316","DOI":"10.1007\/3-540-12727-5_18"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib42","doi-asserted-by":"crossref","unstructured":"Makowsky, J. A. [1986] Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples, Techn. Report No. 329, Technion Haifa, 1984 (extended abstract); in Mathematical Foundations of Software Development, Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT) (H. Ehrig et al., Eds.), Lecture Notes in Computer Science 185, Springer (1985), 374\u2013387, and (revised version) May 15, 1986, 1\u201328, preprint. The references in the text are to this most recent version","DOI":"10.1007\/3-540-15198-2_24"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib43","series-title":"Automation of Reasoning 1","first-page":"493","article-title":"Theorem-Proving for Computers: Some Results on Resolution and Renaming","author":"Meltzer","year":"1983"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib44","doi-asserted-by":"crossref","unstructured":"Minker, J. [1982] On Indefinite Data Bases and the Closed World Assumption, Proc. 6th Conf. Automated Deduction, Lecture Notes in Computer Science 138, Springer-Verlag, 292\u2013308","DOI":"10.1007\/BFb0000066"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib45","doi-asserted-by":"crossref","first-page":"1","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\/B978-0-934613-40-8.50005-1_bib46","unstructured":"Mycroft, A. [1983] Logic Programs and Many-Valued Logic, Proc. 1st STACS Conf."},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib47","unstructured":"Naqvi, S. A. [1986] A Logic for Negation in Database Systems, in Proceedings of Workshop on Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Washington, DC"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib48","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0022-0000(84)90010-2","article-title":"Complete Problems in the First-Order Predicate Calculus","volume":"29","author":"Plaisted","year":"1984","journal-title":"J. Comp. System Sciences"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib49","series-title":"Foundations of Deductive Database 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.50005-1_bib50","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.50005-1_bib51","unstructured":"Sakai, K. and Miyachi, T. [1983] Incorporating Naive Negation into Prolog, ICOT Technical Report: TR-028"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib52","unstructured":"Sato, T. [1982] Negation and Semantics of Prolog Programs, Proc. 1st International Conference on Logic Programming, 169\u2013174"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib53","doi-asserted-by":"crossref","unstructured":"Schmitt, P. H. [1986] Computational Aspects of Three Valued Logic, Proc. 8th Conf. Automated Deduction, Lecture Notes in Computer Science 230, Springer-Verlag, 190\u2013198","DOI":"10.1007\/3-540-16780-3_90"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib54","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":"J. Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib55","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(85)90018-4","article-title":"Negation as Failure II","volume":"3","author":"Shepherdson","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50005-1_bib56","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.50005-1_bib57","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.50005-1_bib58","doi-asserted-by":"crossref","unstructured":"Voda, P. J. [1986] Choices in, and Limitations of, Logic Programming, Proc. 3rd Int. Conf. Logic Programming, Springer, 615\u2013623","DOI":"10.1007\/3-540-16492-8_110"}],"container-title":["Foundations of Deductive Databases and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780934613408500051?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780934613408500051?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T08:28:29Z","timestamp":1565598509000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780934613408500051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780934613408"],"references-count":58,"URL":"https:\/\/doi.org\/10.1016\/b978-0-934613-40-8.50005-1","relation":{},"subject":[],"published":{"date-parts":[[1988]]}}}