Constraint-Based Concurrency and Beyond
โ Scribed by Kazunori Ueda
- Book ID
- 108126655
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 176 KB
- Volume
- 162
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This research article demonstrates the use of constraint networks for modelling the knowledge which is necessary for concurrent product and process design. A knowledge-based constraint network system has been developed to maintain design consistency and to support the selection of appropriate manufa
Planning as satisfiability is a very efficient technique for classical planning, i.e., for planning domains in which both the effects of actions and the initial state are completely specified. In this paper we present C-SAT, a SAT-based procedure capable of dealing with planning domains having incom
Synchronous programming . (Berry, 1989) is a powerful approach to programming reactive systems. Following the idea that "processes are relations extended over time" . (Abramsky, 1993), we propose a simple but powerful model for timed, determinate computation, extending the closure-operator model for