{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T09:01:40Z","timestamp":1754557300005,"version":"3.40.4"},"reference-count":32,"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.50020-8","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T16:04:28Z","timestamp":1404230668000},"page":"627-658","source":"Crossref","is-referenced-by-count":53,"title":["Equivalences of Logic Programs"],"prefix":"10.1016","author":[{"given":"M.J.","family":"Maher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50020-8_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.50020-8_bib2","unstructured":"Blair, H. [1986] Personal communication"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib3","unstructured":"Buntine, W. [1986] Generalised Subsumption and Its Applications to Induction and Redundancy, Artificial Intelligence, to appear. Preliminary version appeared in Proc. European Conference on Artificial Intelligence, 23\u201331"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib4","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib5","doi-asserted-by":"crossref","unstructured":"Cosmadakis, S. S. and Kanellakis, P. C. [1986] Parallel Evaluation of Recursive Rule Queries, Proc. Conference on Principles of Database Systems, 280\u2013293","DOI":"10.1145\/6012.15421"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50020-8_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":"ACM"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50020-8_bib7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene Semantics for Logic Programs","volume":"2","author":"Fitting","year":"1985","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50020-8_bib8","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/3149.214118","article-title":"On the Efficiency of Subsumption Algorithms","volume":"32","author":"Gottlob","year":"1985","journal-title":"ACM"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib9","unstructured":"Hansson, A. and T\u00e4rnlund, S-A. [1980] Program Transformation by a Function that Maps Simple Lists into D-Lists, Proc. Workshop on Logic Programming (S-A. T\u00e4rnlund, Ed.), Debrecen, Hungary, 225\u2013229"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50020-8_bib10","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/322248.322258","article-title":"Derivation of Logic Programs","volume":"28","author":"Hogger","year":"1981","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib11","doi-asserted-by":"crossref","unstructured":"Jaffar, J. and Lassez, J-L. [1988] Constraint Logic Programming, Proc. Conference on Principles of Programming Languages, 111\u2013119","DOI":"10.1145\/41625.41635"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib12","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":"Journal of Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib13","series-title":"Logic Programming: Relations, Functions and Equations","first-page":"267","article-title":"A Logic Programming Language Scheme","author":"Jaffar","year":"1986"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib14","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Lassez, J-L., and Maher, M. J. [1986b] Some Issues and Trends in the Semantics of Logic Programming, Proc. 3rd International Conference on Logic Programming, London, U.K., Lecture Notes in Computer Science 225 (E. Shapiro, Ed.), 223\u2013241","DOI":"10.1007\/3-540-16492-8_78"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50020-8_bib15","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":"Journal of Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib16","unstructured":"Lassez, J-L. and Maher, M. J. [1983] The Denotational Semantics of Horn Clauses as a Production System, Proc. AAAI-83, Washington DC, 229\u2013231"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib17","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.50020-8_bib18","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"587","article-title":"Unification Revisited","author":"Lassez","year":"1987"},{"year":"1984","series-title":"Foundations of Logic Programming","author":"Lloyd","key":"10.1016\/B978-0-934613-40-8.50020-8_bib19"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib20","unstructured":"Maher, M. J. [1985] Semantics of Logic Programs, Ph.D. dissertation, University of Melbourne"},{"year":"1987","series-title":"Correctness of a Logic Program Transformation System","author":"Maher","key":"10.1016\/B978-0-934613-40-8.50020-8_bib21"},{"year":"1974","series-title":"Mathematical Theory of Computation","author":"Manna","key":"10.1016\/B978-0-934613-40-8.50020-8_bib22"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50020-8_bib23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","article-title":"A Polymorphic Type System for Prolog","volume":"23","author":"Mycroft","year":"1984","journal-title":"Artificial Intelligence"},{"year":"1980","series-title":"Principles of Artificial Intelligence","author":"Nilsson","key":"10.1016\/B978-0-934613-40-8.50020-8_bib24"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib25","series-title":"Machine Intelligence 5","first-page":"153","article-title":"A Note on Inductive Generalization","author":"Plotkin","year":"1970"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib26","series-title":"Machine Intelligence 5","first-page":"135","article-title":"Transformational Systems and the Algebraic Structure of Atomic Formulas","author":"Reynolds","year":"1970"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib27","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"659","article-title":"Optimizing Datalog Programs","author":"Sagiv","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib28","unstructured":"Sebelik, J. and Stepanek, P. [1980] Horn Clause Programs Suggested by Recursive Function, Proc. Workshop on Logic Programming (S. A. T\u00e4rnlund, Ed.), Debrecen, Hungary"},{"year":"1967","series-title":"Mathematical Logic","author":"Shoenfield","key":"10.1016\/B978-0-934613-40-8.50020-8_bib29"},{"key":"10.1016\/B978-0-934613-40-8.50020-8_bib30","unstructured":"Tamaki, H. and Sato, T. [1984] Unfold\/Fold Transformation of Logic Programs, Proc. 2nd. Logic Programming Conference, Uppsala, Sweden, 127\u2013138"},{"year":"1986","series-title":"A Generalized Correctness Proof of the Unfold\/Fold Logic Program Transformation","author":"Tamaki","key":"10.1016\/B978-0-934613-40-8.50020-8_bib31"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50020-8_bib32","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01932293","article-title":"Horn Clause Computability","volume":"17","author":"T\u00e4rnlund","year":"1977","journal-title":"BIT"}],"container-title":["Foundations of Deductive Databases and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780934613408500208?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780934613408500208?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:27Z","timestamp":1746289287000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780934613408500208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780934613408"],"references-count":32,"URL":"https:\/\/doi.org\/10.1016\/b978-0-934613-40-8.50020-8","relation":{},"subject":[],"published":{"date-parts":[[1988]]}}}