{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:13Z","timestamp":1761620773001,"version":"build-2065373602"},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":5831,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004562","name":"Minist\u00e8re de l&apos;Education Nationale, de l&apos;Enseignement Superieur et de la Recherche","doi-asserted-by":"publisher","award":["93S0051"],"award-info":[{"award-number":["93S0051"]}],"id":[{"id":"10.13039\/501100004562","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0743-1066(96)00092-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"85-118","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":32,"title":["Constructive negation by pruning"],"prefix":"10.1016","volume":"32","author":[{"given":"Fran\u00e7ois","family":"Fages","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(96)00092-1_BIB1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","article-title":"Logic Programming and Negation: A Survey","volume":"19\/20","author":"Apt","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB2","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1987"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB3","series-title":"Proc. 11th Int. Conf. Logic Programming","first-page":"520","article-title":"A Bottom-Up Semantics for Constructive Negation","author":"Bossi","year":"1994"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","article-title":"The s-Semantics Approach: Theory and Applications","volume":"19\/20","author":"Bossi","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB5","series-title":"Proc. CAAP'94","first-page":"52","article-title":"Compilative Constructive Negation in Constraint Logic Programs","author":"Bruscoli","year":"1994"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB6","series-title":"Proc. 5th Int. Conf. Logic Programming","first-page":"11","article-title":"Constructive Negation Based on the Completed Database","author":"Chan","year":"1988"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB7","series-title":"Proc. North American Conf. Logic Programming'89","first-page":"477","article-title":"An Extension of Constructive Negation and Its Applications in Coroutining","author":"Chan","year":"1989"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB8","series-title":"An Approach to Constructive Negation","first-page":"27","article-title":"What Is Failure?","volume":"32","author":"Drabent","year":"1995"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB9","series-title":"Proc. 13th FSTTCS Conf.","first-page":"193","article-title":"On the Semantics of Optimization Predicates in CLP Languages","author":"Fages","year":"1993"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB10","series-title":"Constraint Programming: Basics and Trends","first-page":"68","article-title":"Constructive Negation by Pruning and Optimization Higher-Order Predicates for CLP and CC Languages","author":"Fages","year":"1995"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB11","series-title":"Proc. PLILP'94","first-page":"261","article-title":"Handling Preferences in Constraint Logic Programming with Relational Optimization","author":"Fages","year":"1994"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB12","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":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB13","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 Programs","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoretical Comput. Sci."},{"key":"10.1016\/S0743-1066(96)00092-1_BIB14","series-title":"Proc. 1st Int. Conf. Constraint Programming CP'95","first-page":"186","article-title":"Solving Linear, Min and Max Constraint Systems Using CLP Based on Relational Interval Arithmetic","author":"Girodias","year":"1995"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB15","series-title":"Proc. POPL'87","first-page":"111","article-title":"Constraint Logic Programming","author":"Jaffar","year":"1987"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB16","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint Logic Programming: A Survey","volume":"19\/20","author":"Jaffar","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB17","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\/S0743-1066(96)00092-1_BIB18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","article-title":"Signed Data Dependencies in Logic Programming","volume":"7","author":"Kunen","year":"1989","journal-title":"J. Logic Programming"},{"year":"1987","series-title":"Foundations of Logic Programming","author":"Lloyd","key":"10.1016\/S0743-1066(96)00092-1_BIB19"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB20","series-title":"Proc. 4th Int. Conf. Logic Programming","first-page":"858","article-title":"Logic Semantics for a Class of Committed-Choice Languages","author":"Maher","year":"1987"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB21","series-title":"Proc. 10th Int. Conf. Logic Programming","first-page":"737","article-title":"A Logic Programming View of CLP","author":"Maher","year":"1993"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB22","series-title":"Proc. North American Conf. Logic Programming'89","first-page":"461","article-title":"Fail Substitutions for Negation as Failure","author":"Maluszy\u0144ski","year":"1989"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB23","series-title":"Proc. North American Conf. Logic Programming'89","first-page":"20","article-title":"Expanding Query Power in Constraint Logic Programming Languages","author":"Maher","year":"1989"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB24","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/176454.176522","article-title":"Semantics of Constraint Logic Programs with Optimization","volume":"2","author":"Marriott","year":"1993","journal-title":"ACM Lett. Programming Languages and Syst."},{"year":"1993","series-title":"Concurrent Constraint Programming","author":"Saraswat","key":"10.1016\/S0743-1066(96)00092-1_BIB25"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB26","series-title":"Proc. LICS'91","first-page":"328","article-title":"Constructive Negation for Constraint Logic Programming","author":"Stuckey","year":"1991"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB27","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1006\/inco.1995.1048","article-title":"Negation and Constraint Logic Programming","volume":"118","author":"Stuckey","year":"1995","journal-title":"Inform. and Computation"},{"year":"1989","series-title":"Constraint Satisfaction in Logic Programming","author":"Van Hentenryck","key":"10.1016\/S0743-1066(96)00092-1_BIB28"},{"key":"10.1016\/S0743-1066(96)00092-1_BIB29","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","article-title":"A Generic Arc-Consistency Algorithm and Its Specialization","volume":"57","author":"Van Hentenryck","year":"1992","journal-title":"Artificial Intell."},{"key":"10.1016\/S0743-1066(96)00092-1_BIB30","series-title":"Proc. Fifth Int. Conf. on Algebraic and Logic Programming'96","article-title":"A Hierarchy of Semantics for Normal Constraint Logic Programs","author":"Fages","year":"1996"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696000921?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696000921?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:45:56Z","timestamp":1760046356000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106696000921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0743106696000921"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(96)00092-1","relation":{},"ISSN":["0743-1066"],"issn-type":[{"type":"print","value":"0743-1066"}],"subject":[],"published":{"date-parts":[[1997,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Constructive negation by pruning","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0743-1066(96)00092-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}