Open constraint programming

摘要

Traditionally, constraint satisfaction problems (CSP) have assumed closed-world scenarios where all domains and constraints are fixed from the beginning. With the Internet, many of the traditional CSP applications in resource allocation, scheduling and planning pose themselves in open-world settings, where domains and constraints must be discovered from different sources in a network. To model this scenario, we define open constraint satisfaction problems (OCSP) as CSP where domains and constraints are incrementally discovered through a network. We then extend the concept to open constraint optimization (OCOP).