Constraint Satisfaction Problems in Matrix Model

摘要

Constraints are fundamental in many AI tasks such as planning, scheduling, and temporal reasoning. The constraint satisfaction problems can be divided into qualitative constraints and quantitative constraints. Our work concentrate on qualitative constraints in this paper. We will show how to describe them with matrix method.