From eager to lazy constrained data acquisition: a general framework

摘要

Constraint Satisfaction Problems(CSPs)~17 are an ef- fective framework for modeling a variety of real life applications and many techniques have been proposed for solving them efficiently. CSPs are based on the assumption that all constrained data(values in variable domains)are available at the beginning of the computation. However, many non-toy prob- lems derive their parameters from an external environment. Data retrieval can be a hard task, because data can come from a third-party system that has to convert information encoded with signals(derived from sensors)into sym- bolic information(exploitable by a SCP solver). Also, data can be provided by the user or have to be queried to a database.