{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:44:59Z","timestamp":1762458299056},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":5405,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0743-1066(98)10002-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:44:48Z","timestamp":1027629888000},"page":"1-46","source":"Crossref","is-referenced-by-count":97,"title":["The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1"],"prefix":"10.1016","volume":"37","author":[{"given":"Joxan","family":"Jaffar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Maher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0743-1066(98)10002-X_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":"Journal of the ACM"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB2","doi-asserted-by":"crossref","unstructured":"K.L. Clark, Negation as failure, in: H. Gallaire, J. Minker (Eds.), Logic and Databases, Plenum Press, New York, 1978, pp. 293\u2013322","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB3","unstructured":"A. Colmerauer, Prolog-II Manuel de Reference at Modele Theorique, Groupe Intelligence Artificelle, Universite d'Aix-Marseille II, 1982"},{"issue":"4","key":"10.1016\/S0743-1066(98)10002-X_BIB4","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":"van Emden","year":"1976","journal-title":"Journal of the ACM"},{"issue":"3","key":"10.1016\/S0743-1066(98)10002-X_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative modeling of the operational behavior of logic languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB6","unstructured":"M. Gabbrielli, G. Levi, Modeling answer constraints in constraint logic programs, in: Proceedings of the Eighth International Conference on Logic Programming, 1991, pp. 238\u2013252"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB7","doi-asserted-by":"crossref","unstructured":"J. Jaffar, J.-L. Lassez, Constraint logic programming, Technical Report 86\/73, Department of Computer Science, Monash University, 1986","DOI":"10.1016\/0743-1066(86)90018-X"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB8","doi-asserted-by":"crossref","unstructured":"J. Jaffar, J.-L. Lassez, Constraint logic programming, in: Proceedings of the 14th Annual ACM Symposium, Principles of Programming Languages, 1987, pp. 111\u2013119","DOI":"10.1145\/41625.41635"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB9","unstructured":"J. Jaffar, J.-L. Lassez, J.W. Lloyd, Completeness of the negation as failure rule, in: Proceedings of IJCAI-83, 1983, pp. 500\u2013506"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB10","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":"3","author":"Jaffar","year":"1984","journal-title":"The Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB11","doi-asserted-by":"crossref","unstructured":"J. Jaffar, M. Maher, Constraint logic programming: A survey, Journal of Logic Programming 19\/20 (1994) 503\u2013581","DOI":"10.1016\/0743-1066(94)90033-7"},{"issue":"3","key":"10.1016\/S0743-1066(98)10002-X_BIB12","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","article-title":"The CLP(R)language and system","volume":"14","author":"Jaffar","year":"1992","journal-title":"ACM Transactions on Programming Languages"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(86)90027-7","article-title":"Semantics of infinite tree logic programming","volume":"46","author":"Jaffar","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB14","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\/S0743-1066(98)10002-X_BIB15","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 Journal of Mathematics"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB16","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\/S0743-1066(98)10002-X_BIB17","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987","DOI":"10.1007\/978-3-642-83189-8"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB18","unstructured":"M. Maher, Logic semantics for a class of committed-choice programs, in: Proceedings of the Fourth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1987, pp. 858\u2013876"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB19","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, ch. 23, 1971, pp. 262\u2013281","DOI":"10.1016\/S0049-237X(08)70560-3"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB20","doi-asserted-by":"crossref","unstructured":"K. Marriott, P. Stuckey, Programming with Constraints: An Introduction, MIT Press, Cambridge, MA, 1998","DOI":"10.7551\/mitpress\/5625.001.0001"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB21","doi-asserted-by":"crossref","unstructured":"E. Mendelson, Introduction to Mathematical Logic, Wadsworth and Brooks, 3rd ed., 1987","DOI":"10.1007\/978-1-4615-7288-6"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB22","unstructured":"J.R. Shoenfield, Mathematical Logic, Addison\u2013Wesley, Reading, MA, 1967"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB23","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0743-1066(89)90017-4","article-title":"A computable semantics for general logic programs","volume":"6","author":"Wallace","year":"1989","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(98)10002-X_BIB24","unstructured":"D.A. Wolfram, M.J. Maher, J.-L. Lassez, A unified treatment of resolution strategies for logic programs, in: Proceedings of the Second International Conference on Logic Programming, Uppsala, 1984, pp. 263\u2013276"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S074310669810002X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S074310669810002X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T14:07:22Z","timestamp":1580825242000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S074310669810002X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S074310669810002X"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(98)10002-x","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}