{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:14:33Z","timestamp":1761610473590,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80121-5","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"158-174","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Defining Standard Prolog in Rewriting Logic"],"prefix":"10.1016","volume":"36","author":[{"given":"M.","family":"Kula\u0161","sequence":"first","affiliation":[]},{"given":"C.","family":"Beierle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80121-5_BIB1","series-title":"Operational Semantics and Proof Theory","article-title":"Logic Programming","author":"Andrews","year":"1992"},{"key":"10.1016\/S1571-0661(05)80121-5_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":"Journal of the ACM"},{"issue":"4","key":"10.1016\/S1571-0661(05)80121-5_BIB3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0743-1066(87)90008-2","article-title":"Operational and denotational semantics of Prolog","volume":"4","author":"Arbab","year":"1987","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(05)80121-5_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(92)90045-5","article-title":"Proving termination properties of Prolog programs: A semantic approach","volume":"14","author":"Baudinet","year":"1992","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"10.1016\/S1571-0661(05)80121-5_BIB5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(95)00006-E","article-title":"A mathematical definition of full Prolog","volume":"24","author":"B\u00f6rger","year":"1995","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S1571-0661(05)80121-5_BIB6","unstructured":"P. Brisset and O. Ridoux. Continuations in \u03bbProlog. In ICLP'93: 10th Int. Conference on Logic Programming, Budapest, 1993."},{"issue":"1","key":"10.1016\/S1571-0661(05)80121-5_BIB7","first-page":"237","article-title":"Comparative semantics for Prolog with cut","volume":"13","author":"de Vink","year":"1989","journal-title":"Science of Computer Programming"},{"issue":"1","key":"10.1016\/S1571-0661(05)80121-5_BIB8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0743-1066(88)90007-6","article-title":"Denotational and operational semantics for Prolog","volume":"5","author":"Debray","year":"1988","journal-title":"Journal of Logic Programming"},{"year":"1996","series-title":"Prolog: The Standard (Reference Manual).","author":"Deransart","key":"10.1016\/S1571-0661(05)80121-5_BIB9"},{"key":"10.1016\/S1571-0661(05)80121-5_BIB10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF03037477","article-title":"An operational formal definition of Prolog: A specification method an its application","volume":"10","author":"Deransart","year":"1992","journal-title":"New Generation Computing"},{"key":"10.1016\/S1571-0661(05)80121-5_BIB11","unstructured":"ISO Prolog Standard. http:\/\/www.logic-programming.org\/prolog_std.html."},{"key":"10.1016\/S1571-0661(05)80121-5_BIB12","first-page":"281","article-title":"Stepwise development of operational and denotational semantics for Prolog","author":"Jones","year":"1984","journal-title":"SLP'84-' 1st Int. Symposium on Logic Programming, Atlantic City"},{"issue":"3","key":"10.1016\/S1571-0661(05)80121-5_BIB13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/FI-1998-34302","article-title":"Rule-based constraint programming","volume":"34","author":"Kirchner","year":"1998","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S1571-0661(05)80121-5_BIB14","first-page":"2000","article-title":"A rewriting Prolog semantics","author":"Kula\u0161","year":"2000"},{"key":"10.1016\/S1571-0661(05)80121-5_BIB15","first-page":"603","article-title":"A continuation-passing style for Prolog","author":"Lindgren","year":"1994"},{"key":"10.1016\/S1571-0661(05)80121-5_BIB16","first-page":"21","article-title":"Efficient implementation of a defensible semantics for dynamic Prolog code","author":"Lindholm","year":"1987","journal-title":"ICLP'87: 4-th Int. Conference on Logic Programming, Melbourne"},{"issue":"1","key":"10.1016\/S1571-0661(05)80121-5_BIB17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","article-title":"Conditional rewriting logic as a unified model of concurrency","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"10.1016\/S1571-0661(05)80121-5_BIB18","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/69558.69564","article-title":"A denotational semantics for Prolog","volume":"11","author":"Nicholson","year":"1989","journal-title":"ACM Trans, on Prog. Lang, and Systems"},{"year":"1990","series-title":"The Craft of Prolog","author":"O'Keefe","key":"10.1016\/S1571-0661(05)80121-5_BIB19"},{"key":"10.1016\/S1571-0661(05)80121-5_BIB20","unstructured":"M. Pettersson. Compiling Natural Semantics. PhD thesis, Link\u00f6ping University, 1995."},{"year":"1986","series-title":"Denotational Semantics","author":"Schmidt","key":"10.1016\/S1571-0661(05)80121-5_BIB21"},{"issue":"1","key":"10.1016\/S1571-0661(05)80121-5_BIB22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/251595.251617","article-title":"On the need for a popular formal semantics","volume":"32","author":"Schmidt","year":"1997","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(05)80121-5_BIB23","doi-asserted-by":"crossref","unstructured":"P. Tarau and V. Dahl. Logic programming and logic grammars with binarization and first-order continuations. In LOPSTR'94: 4th Int. Workshop on Logic Program Synthesis and Transformation, Pisa, volume 883 of LNCS. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58792-6_14"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801215?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801215?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:01Z","timestamp":1761610141000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105801215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":23,"alternative-id":["S1571066105801215"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80121-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Defining Standard Prolog in Rewriting Logic","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80121-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}