Extending Consistent Domains of Numeric CSP
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction. Pages 406-412.
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.
@inproceedings{ijcai1999p59,
title = {Extending Consistent Domains of Numeric CSP},
author = {Collavizza, Hélène and Delobel, François and Rueher, Michel},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {406--412},
year = {1999},
note = {Constraint Satisfaction},
url = {https://ijcai.org/proceedings/1999/59},
}
TY - CPAPER TI - Extending Consistent Domains of Numeric CSP AU - Collavizza, Hélène AU - Delobel, François AU - Rueher, Michel T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 406 EP - 412 UR - https://ijcai.org/proceedings/1999/59 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
