Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Database Systems: A Practical Approach to Design, Implementation and Management 2nd Ed.
Database Systems: A Practical Approach to Design, Implementation and Management 2nd Ed.
Component-Oriented Programming as an AI-Planning Problem
IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
| Hi-index | 0.00 |
We have presented here an algorithm CPRAO for doing constraint processing using relational algebraic operators. Van Beek and others have investigated such constraint processing in the relational algebraic framework, for quite some time, producing some unique results. Apart from providing new theoretical angles, the framework also provides the opportunity to use the existing efficient implementations of relational database management systems as the underlying data structures for any relevant algorithm. Our algorithm here enhances that framework. The algorithm is quite general in its current form. Weak heuristics (like forward checking) developed within the CSP area could be plugged in this algorithm. The algorithm is developed here is targeted toward a component-oriented modeling problem that we are currently working on, namely, the problem of interactive modeling for batch-simulation of engineering systems (IMBSES). However, it could be adopted for many other CSP problems as well. The article here discusses the algorithm and many aspects of the problem we are addressing.