{"type":"ScholarlyArticle","title":"Extending Consistent Domains of Numeric CSP","authors":[{"name":"Hélène Collavizza","slug":"helene-collavizza","given":"Hélène","family":"Collavizza","affiliation":""},{"name":"François Delobel","slug":"francois-delobel","given":"François","family":"Delobel","affiliation":""},{"name":"Michel Rueher","slug":"michel-rueher","given":"Michel","family":"Rueher","affiliation":""}],"abstract":"This paper introduces a new framework for extending consiste nt domains of numeric CSP. Th e aim is to offer the greatest possible freedom of choice for one variable to the designer of a CAD application. Thus , we provide here an efficient and incremental algorithm which computes the maximal extension of the domain of one variable. The key point of this fr amework is the definition, for each inequality, of an univariate extrema function which computes the left most and right most solutions of a selected variable (in a space delimited by the domains of the other variables). We show how these univariate extrema fun ct ions can be implemented efficiently. The capabilities of this approach are illustrated on a ballistic exampl e.","doi":null,"url":"https://ijcai.org/proceedings/1999/59","pdf":"https://ijcai.org/proceedings/1999/0059.pdf","markdown":"https://ijcai.org/proceedings/1999/59.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/59","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction","track":"Constraint Satisfaction","number":59,"pages":{"first":406,"last":412},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}