Constraint Satisfaction with Delayed Evaluation
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 contributes 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). 1
Cite
Text
Zweben and Eskey. "Constraint Satisfaction with Delayed Evaluation." International Joint Conference on Artificial Intelligence, 1989.Markdown
[Zweben and Eskey. "Constraint Satisfaction with Delayed Evaluation." International Joint Conference on Artificial Intelligence, 1989.](https://mlanthology.org/ijcai/1989/zweben1989ijcai-constraint/)BibTeX
@inproceedings{zweben1989ijcai-constraint,
title = {{Constraint Satisfaction with Delayed Evaluation}},
author = {Zweben, Monte and Eskey, Megan},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1989},
pages = {875-880},
url = {https://mlanthology.org/ijcai/1989/zweben1989ijcai-constraint/}
}