{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T15:48:14Z","timestamp":1756309694012},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7594,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0304-3975(92)90286-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"27-56","source":"Crossref","is-referenced-by-count":4,"title":["Transforming normal logic programs to constraint logic programs"],"prefix":"10.1016","volume":"105","author":[{"given":"Kanchana","family":"Kanchanasut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90286-O_BIB1","series-title":"Foundation of Deductive Database and Logic Programming","first-page":"89","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0304-3975(92)90286-O_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0743-1066(90)90023-X","article-title":"A transformational approach to negation in logic programming","volume":"8","author":"Barbuti","year":"1990","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(92)90286-O_BIB3","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/73721.73725","article-title":"Logic programming as constructivism: a formalization and its applications to databases","author":"Bry","year":"1989","journal-title":"Proc. 8th ACM SICAT-SIGMOD-SIGART Symp. on Principles of Database Systems"},{"key":"10.1016\/0304-3975(92)90286-O_BIB4","series-title":"Proc. 5th Internat. Conf. and Symp. on Logic Programming","first-page":"111","article-title":"Constructive negation based on the completed database","author":"Chan","year":"1988"},{"key":"10.1016\/0304-3975(92)90286-O_BIB5","series-title":"Proc. North American Conf. on Logic Programming","first-page":"477","article-title":"An extension of constructive negation and its application in coroutining","author":"Chan","year":"1989"},{"key":"10.1016\/0304-3975(92)90286-O_BIB6","series-title":"Proc. Meta-Programming in Logic Programming Workshop","first-page":"299","article-title":"A treatment of negation during partial evaluation","author":"Chan","year":"1989"},{"key":"10.1016\/0304-3975(92)90286-O_BIB7","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/0304-3975(92)90286-O_BIB8","series-title":"Proc. North American Conf. on Logic Programming","first-page":"604","article-title":"A fixpoint approach to declarative semantics of logic programs","author":"Dung","year":"1989"},{"key":"10.1016\/0304-3975(92)90286-O_BIB9","series-title":"Proc. 9th Internat. Conf. on Foundation of Software Technology and Theoretical Computer Science","first-page":"70","article-title":"A natural semantics of logic programs with negation","volume":"Vol. 405","author":"Dung","year":"1989"},{"key":"10.1016\/0304-3975(92)90286-O_BIB10","series-title":"Proc. 5th Internat. Conf. and Symp. on Logic Programming","first-page":"993","article-title":"A new declarative semantics for logic languages","author":"Falaschi","year":"1988"},{"issue":"4","key":"10.1016\/0304-3975(92)90286-O_BIB11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke\u2014Kleene semantics for logic programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(92)90286-O_BIB12","series-title":"Proc. 5th Internat. Conf. on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programs","author":"Gelfond","year":"1988"},{"key":"10.1016\/0304-3975(92)90286-O_BIB13","first-page":"111","article-title":"Constraint logic programming","author":"Jaffar","year":"1987","journal-title":"Proc. 14th ACM Symp. on the Principles of Programming Languages"},{"key":"10.1016\/0304-3975(92)90286-O_BIB14","doi-asserted-by":"crossref","first-page":"142","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\/0304-3975(92)90286-O_BIB15","series-title":"Proc. 2nd Internat. Conf. on Algebraic and Logic Programming","first-page":"217","article-title":"Eliminating negation from normal logic programs","volume":"Vol. 463","author":"Kanchanasut","year":"1990"},{"key":"10.1016\/0304-3975(92)90286-O_BIB16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in logic programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(92)90286-O_BIB17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","article-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(92)90286-O_BIB18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","article-title":"Making Prolog more expressive","volume":"3","author":"Lloyd","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(92)90286-O_BIB19","first-page":"348","article-title":"Complete axiomatizations of the algebras of finite, Rational and infinite trees","author":"Maher","year":"1988","journal-title":"Proc. 3rd Ann. IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(92)90286-O_BIB20","series-title":"Proc. North American Conf. on Logic Programming","first-page":"23","article-title":"Algebraic properties of a class of logic programs","author":"Mancarella","year":"1990"},{"key":"10.1016\/0304-3975(92)90286-O_BIB21","series-title":"Tech. Report TR-LP-39","article-title":"SEPIA","author":"Meier","year":"1988"},{"key":"10.1016\/0304-3975(92)90286-O_BIB22","first-page":"73","article-title":"Negation and quantifiers in NU-Prolog","author":"Naish","year":"1985","journal-title":"Proc. 3rd Internat. Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(92)90286-O_BIB23","article-title":"Negation and Control in Prolog","volume":"Vol. 238","author":"Naish","year":"1986"},{"key":"10.1016\/0304-3975(92)90286-O_BIB24","series-title":"Foundation of Deductive Database and Logic Programming","first-page":"193","article-title":"On the declarative semantics of deductive database and logic programming","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0304-3975(92)90286-O_BIB25","series-title":"Proc. 6th Logic Programming Symp.","first-page":"655","article-title":"Non-monotonic formalisms and logic programming","author":"Przymusinski","year":"1989"},{"key":"10.1016\/0304-3975(92)90286-O_BIB26","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/73721.73724","article-title":"A procedural semantics for well founded negation in logic programs","author":"Ross","year":"1989","journal-title":"Proc. 8th ACM SICACT-SIGMOD-SIGART Symp. on Principles of Database Systems"},{"key":"10.1016\/0304-3975(92)90286-O_BIB27","series-title":"Proc. Internat. Conf. on Fifth Generation Computer Systems","first-page":"195","article-title":"Transformational logic program synthesis","author":"Sato","year":"1984"},{"key":"10.1016\/0304-3975(92)90286-O_BIB28","series-title":"Proc. North American Conf. on Logic Programming 90","first-page":"119","article-title":"Partial evaluation of a CLP language","author":"Smith","year":"1990"},{"key":"10.1016\/0304-3975(92)90286-O_BIB29","series-title":"Proc. 4th Internat. Conf. on Logic Programming","first-page":"769","article-title":"A system of precise modes for logic programs","author":"Somogyi","year":"1987"},{"key":"10.1016\/0304-3975(92)90286-O_BIB30","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/LICS.1991.151657","article-title":"Constructive negation for constraint logic programming","author":"Stuckey","year":"1991","journal-title":"Proc. 6th Ann. IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(92)90286-O_BIB31","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","article-title":"Efficient tests for top-down termination of logical rules","volume":"35","author":"Ullman","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90286-O_BIB32","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of logic as a programming language","volume":"23","author":"van Emden","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90286-O_BIB33","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/308386.308444","article-title":"Unfounded sets and well-founded semantics for general logic programs","author":"van Gelder","year":"1988","journal-title":"Proc 7th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems"},{"key":"10.1016\/0304-3975(92)90286-O_BIB34","series-title":"Proc. 2nd Internat. Conf. on Logic Programming","first-page":"263","article-title":"A unified treatment of resolution strategies for logic programs","author":"Wolfram","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290286O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290286O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:20:41Z","timestamp":1555129241000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290286O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["030439759290286O"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90286-o","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}