{"type":"ScholarlyArticle","title":"Improved bounds on the complexity of kB-consistency","authors":[{"name":"Lucas Bordeaux","slug":"lucas-bordeaux","given":"Lucas","family":"Bordeaux","affiliation":""},{"name":"Éric Monfroy","slug":"eric-monfroy","given":"Éric","family":"Monfroy","affiliation":""},{"name":"Frédéric Benhamou","slug":"frederic-benhamou","given":"Frédéric","family":"Benhamou","affiliation":""}],"abstract":"-consistencies form the class of strong consistencies used in interval constraint programming. We survey, prove, and give theoretical motivations to some technical improvements to a naive \u0002 \u0004\u0003consistency algorithm. Our contribution is twofold: on the one hand, we introduce an optimal \u0005 \u0003consistency algorithm whose time-complexity of\u0006\b\u0007 \u000e \u0010\u000f\u0012\u0011 improves the known bound by a factor\u000f( is the number of constraints, \u000f is the number of variables, and is the maximal size of the intervals of the box). On the other hand, we prove that improved bounds on time complexity can effectively be reached for higher values of \u0002 . These results are obtained with very affordable overheads in terms of space complexity","doi":null,"url":"https://ijcai.org/proceedings/2001/43","pdf":"https://ijcai.org/proceedings/2001/0043.pdf","markdown":"https://ijcai.org/proceedings/2001/43.md","bibtex":"https://ijcai.org/proceedings/2001/bibtex/43","volume":{"slug":"2001","title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2001","url":"https://ijcai.org/proceedings/2001/","year":2001,"location":"Seattle, Washington, USA","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":43,"pages":{"first":303,"last":307},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}