{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T14:55:38Z","timestamp":1760799338697},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p> When a Constraint Satisfaction Problem (CSP) admits no solution, it can be useful to pinpoint which constraints are actually contradicting one another and make the problem infeasible. In this paper, a recent heuristic-based approach to compute infeasible minimal subparts of discrete CSPs, also called Minimally Unsatisfiable Cores (MUCs), is improved. The approach is based on the heuristic exploitation of the number of times each constraint has been falsified during previous failed search steps. It appears to enhance the performance of the initial technique, which was the most efficient one until now. <\/jats:p>","DOI":"10.1142\/s0218213008004138","type":"journal-article","created":{"date-parts":[[2008,9,2]],"date-time":"2008-09-02T11:01:05Z","timestamp":1220353265000},"page":"745-763","source":"Crossref","is-referenced-by-count":11,"title":["ON FINDING MINIMALLY UNSATISFIABLE CORES OF CSPs"],"prefix":"10.1142","volume":"17","author":[{"given":"\u00c9RIC","family":"GR\u00c9GOIRE","sequence":"first","affiliation":[{"name":"Universit\u00e9 Lille-Nord de France, Artois, F-62307 Lens, CRIL, F-62307 Lens, CNRS UMR 8188, F-62307 Lens, rue Jean Souvraz SP18, F-62307 Lens, France"}]},{"given":"BERTRAND","family":"MAZURE","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Lille-Nord de France, Artois, F-62307 Lens, CRIL, F-62307 Lens, CNRS UMR 8188, F-62307 Lens, rue Jean Souvraz SP18, F-62307 Lens, France"}]},{"given":"C\u00c9DRIC","family":"PIETTE","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Lille-Nord de France, Artois, F-62307 Lens, CRIL, F-62307 Lens, CNRS UMR 8188, F-62307 Lens, rue Jean Souvraz SP18, F-62307 Lens, France"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.08.005"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1145\/1177352.1177354"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009812409930"},{"key":"rf8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6103-3_14","volume-title":"Advances in Sensitivity Analysis and Parametric Programming","volume":"6","author":"Chinneck J. W.","year":"1997"},{"key":"rf12","volume-title":"Constraint Processing","author":"Dechter R.","year":"2003"},{"key":"rf13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"Ginsberg M. L.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1109\/3477.752801"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90042-6"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1993.tb00310.x"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213008004138","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:28:38Z","timestamp":1565144918000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213008004138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":11,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.1142\/S0218213008004138"],"URL":"https:\/\/doi.org\/10.1142\/s0218213008004138","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}