Domain-independent planning: representation and plan generation
Artificial Intelligence
Coordinated computing: tools and techniques for distributed software
Coordinated computing: tools and techniques for distributed software
Towards a general theory of action and time
Artificial Intelligence
Temporal imagery: an approach to reasoning about time for planning and problem solving
Temporal imagery: an approach to reasoning about time for planning and problem solving
Structure and interpretation of computer programs
Structure and interpretation of computer programs
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Some fundamental properties of local constraint propagation
Artificial Intelligence
Planning with constraints
Constraint-directed search: a case study of job-shop scheduling
Constraint-directed search: a case study of job-shop scheduling
Exploiting Constraints for Domain Managing in CLP(FD)
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Learning search control for constraint-based scheduling
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
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).