{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:32Z","timestamp":1725455912024},"publisher-location":"Berlin\/Heidelberg","reference-count":28,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013838","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T02:24:11Z","timestamp":1132712651000},"page":"364-383","source":"Crossref","is-referenced-by-count":8,"title":["A CLP view of logic programming"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Maher","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"H. Blair & K. Bowen, private communication, 1988."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"H. Blair & A. Brown, Definite Clause Programs are Canonical (Over a Suitable Domain), Annals of Mathematics and Artificial Intelligence, to appear.","DOI":"10.1007\/BF01531067"},{"key":"24_CR3","unstructured":"C.C. Chang & H.J. Keisler, Model Theory, third edition, North-Holland, 1990."},{"key":"24_CR4","first-page":"293","volume-title":"Logic and Databases","author":"K.L. Clark","year":"1978","unstructured":"K.L. Clark, Negation as Failure, in Logic and Databases, H. Gallaire and J. Minker (Eds.), Plenum Press, New York, 293\u2013322, 1978."},{"key":"24_CR5","unstructured":"H. Comon, Disunification: A Survey, in: Computational Logic, J-L. Lassez & G. Plotkin (Eds.), MIT Press, 1991."},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","volume":"7","author":"H. Comon","year":"1989","unstructured":"H. Comon and P. Lescanne, Equational Problems and Disunification, J. Symb. Comp. 7, 371\u2013425, 1989.","journal-title":"J. Symb. Comp."},{"key":"24_CR7","unstructured":"K. Doets, Levationis Laus, Technical Report CT-91-08, Institute for Language, Logic and Information, University of Amsterdam, 1991."},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"J. Jaffar & J-L. Lassez, Constraint Logic Programming, Technical Report, Department of Computer Science, Monash University, 1986.","DOI":"10.1145\/41625.41635"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"J. Jaffar & J-L. Lassez, Constraint Logic Programming, Proc. Conf. on Principles of Programming Languages, 1987, 111\u2013119.","DOI":"10.1145\/41625.41635"},{"key":"24_CR10","unstructured":"J. Jaffar, J-L. Lassez & J. Lloyd, Completeness of the Negation-as-Failure Rule, Proc. 8th. International Joint Conference on Artificial Intelligence, 1983."},{"key":"24_CR11","first-page":"223","volume":"225","author":"J. Jaffar","year":"1986","unstructured":"J. Jaffar, J-L. Lassez & M. Maher, Some Issues and Trends in the Semantics of Logic Programming, Proc. 3rd. International Conference on Logic Programming, LNCS 225, 223\u2013241, 1986.","journal-title":"LNCS"},{"key":"24_CR12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0743-1066(86)90020-8","volume":"3","author":"J. Jaffar","year":"1986","unstructured":"J. Jaffar & P. Stuckey, Canonical Logic Programs, Journal of Logic Programming, 3, 143\u2013155, 1986.","journal-title":"Journal of Logic Programming"},{"key":"24_CR13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"K. Kunen, Negation in Logic Programming, Journal of Logic Programming, 4, 289\u2013308, 1987.","journal-title":"Journal of Logic Programming"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"K. Kunen, Answer Sets and Negation as Failure, Proc. 4th. International Conference on Logic Programming, Melbourne, 219\u2013228, 1987.","DOI":"10.1016\/0743-1066(87)90007-0"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"J-L. Lassez, M.J. Maher & K.G. Marriott, Unification Revisited, in: Foundations of Deductive Databases and Logic Programming, J. Minker (Ed.), Kauffman, 1987.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"24_CR16","unstructured":"G. Levi, M. Martelli & C. Palamidessi, Failure and Success made Symmetric, Proc. North American Conference on Logic Programming, 3\u201322, 1990."},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming, Springer-Verlag, second edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"24_CR18","unstructured":"M.J. Maher, Logic Semantics for a Class of Committed-Choice Programs, Proc. 4th International Conference on Logic Programming, Melbourne, Australia, May 1987, 858\u2013876."},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"M.J. Maher, Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees, Proc. 3rd. Symp. Logic in Computer Science, Edinburgh, 348\u2013357, 1988. Full version: IBM Research Report, T.J. Watson Research Center.","DOI":"10.1109\/LICS.1988.5132"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"M.J. Maher, Equivalences of Logic Programs, in: Foundations of Deductive Databases and Logic Programming, J. Minker (Ed), Morgan Kaufmann, 627\u2013658, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50020-8"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"A. Mal'cev, Axiomatizable Classes of Locally Free Algebras of Various Types, in: The Metamathematics of Algebraic Systems: Collected Papers, 1936\u20131967, Chapter 23, 262\u2013281, 1971.","DOI":"10.1016\/S0049-237X(08)70560-3"},{"key":"24_CR22","unstructured":"G. Marongiu & S. Tulipani, Quantifiers elimination for Complete Extensions of Clark Equational Theory, Research Report, Universita di Bologna, 1989."},{"key":"24_CR23","unstructured":"J. Plaza, Fully Declarative Programming with Logic: Mathematical Foundations, Ph.D. thesis, City University of New York, 1990."},{"key":"24_CR24","unstructured":"A. Robinson, Complete Theories, North-Holland, 1956."},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"J.C. Shepherdson, Negation in Logic Programming, in: Foundations of Deductive Databases and Logic Programming, J. Minker (Ed), Morgan Kaufmann, 19\u201388, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"24_CR26","unstructured":"J.C. Shepherdson, Language and Equality Theory in Logic Programming, Technical Report, University of Bristol."},{"key":"24_CR27","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0743-1066(89)90017-4","volume":"6","author":"M. Wallace","year":"1989","unstructured":"M. Wallace, A Computable Semantics for General Logic Programs, Journal of Logic Programming 6, 269\u2013297, 1989.","journal-title":"Journal of Logic Programming"},{"key":"24_CR28","unstructured":"D.A. Wolfram, M.J. Maher & J-L. Lassez, A Unified Treatment of Resolution Strategies for Logic Programs, Proc. 2nd International Logic Programming Conference, Uppsala, Sweden, July 1984, 263\u2013276."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T03:27:09Z","timestamp":1626751629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0013838","relation":{},"subject":[]}}