Increasing Functional Constraints Need to Be Checked Only Once
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction. Pages 586-590.
Abstract
Central to solving Constraint Satisfaction Problem (CSP) is the problem of consistency check. Past research has produced many general and specific consistency algorithms. Specific algorithms are efficient specializations of the general ones for specific constraints. Functional, anti-functional and monotonic constraints are three important classes of specific constraints. They form the basis of the current constraint programming languages. This paper proposes a more efficient method for checking an Important subclass of functional constraints increasing functional constraints. Rather thachecking them many times as in a typical consistency check process, in the new method they (almost all of them) only need to be checked once. This results in a substantial saving in computation.
@inproceedings{ijcai1995p77,
title = {Increasing Functional Constraints Need to Be Checked Only Once},
author = {Liu, Bing},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {586--590},
year = {1995},
note = {Constraint Satisfaction},
url = {https://ijcai.org/proceedings/1995/77},
}
TY - CPAPER TI - Increasing Functional Constraints Need to Be Checked Only Once AU - Liu, Bing T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 586 EP - 590 UR - https://ijcai.org/proceedings/1995/77 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
