Design and Specification of a Generic Task Model for Solving Boolean ConstraintSatisfaction Problems

摘要

In this report we introduce the Boolean constraint satisfaction problem (BooleanCSP), as a natural generalization of the traditional CSP. We give motivations for this generalization, and formulate a small design example as a Boolean CSP. The language of many-sorted predicate logic serves as the basis for defining syntax and semantics of Boolean constraints. We also discuss the issue of representing such constraints in the DEsign and Specification of Interacting REasoning modules (DESIRE) framework. We propose a generic task model for solving Boolean CSPs. We fully specify the resulting model, describe the separate modules in detail, and discuss two refinements.