Generalizing Inconsistency Learning for Constraint Satisfaction
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction. Pages 563-570.
Abstract
Constraint satisfaction problems, where values are sought for problem variables subject to restrictions on which combinations of values are acceptable, have many applications in artificial intelligence. Conventional learning methods acquire individual tuples of inconsistent values. These learning experiences can be generalized. We propose a model of generalized learning, based on inconsistency preserving mappings, which is sufficiently focused so as to be computationally cost effective. Rather than recording an individual inconsistency that led to a failure, and looking for that specific inconsistency to recur, we observe the context of a failure, and then look for a related context in which to apply our experience opportunistically. As a result we leverage our learning power. This model is implemented, extended and evaluated using two simple but important classes of constraint problems.
@inproceedings{ijcai1995p74,
title = {Generalizing Inconsistency Learning for Constraint Satisfaction},
author = {Freuder, Eugene C. and Wallace, Richard J.},
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 = {563--570},
year = {1995},
note = {Constraint Satisfaction},
url = {https://ijcai.org/proceedings/1995/74},
}
TY - CPAPER TI - Generalizing Inconsistency Learning for Constraint Satisfaction AU - Freuder, Eugene C. AU - Wallace, Richard J. T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 563 EP - 570 UR - https://ijcai.org/proceedings/1995/74 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: