Constraint Satisfaction with Delayed Evaluation
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Planning, Scheduling, Reasoning About Actions. Pages 875-879.
Abstract
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avoid unnecessary computation. The architecture used is a uniform model of computation , where each constraint contribut es its local information to provide a global solution. We demonstrate the utility of the system by formulating a real-world scheduling problem as a constraint satisfaction problem (CSP).
@inproceedings{ijcai1989p140,
title = {Constraint Satisfaction with Delayed Evaluation},
author = {Zweben, Monte and Eskey, Megan},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {875--879},
year = {1989},
month = {8},
note = {Planning, Scheduling, Reasoning About Actions},
url = {https://ijcai.org/proceedings/1989/140},
}
TY - CPAPER TI - Constraint Satisfaction with Delayed Evaluation AU - Zweben, Monte AU - Eskey, Megan T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 875 EP - 879 UR - https://ijcai.org/proceedings/1989/140 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: