Constraint satisfaction is a challenging problem in Interval Algebra (IA). So there are many efforts to attack this problem. After building a matrix method to deal with temporal reasoning problems, we develop basic techniques for applying the matrix method to constraint satisfaction in this paper. Thus, the propagating rules and the algorithms of 3- and path-consistency are studied. If our matrix method is used, then the temporal constraint satisfaction problem can be transformed into a problem that can be effectively solved.
Online Publication Date: 01 February 2003
Field of Research
080199 Artificial Intelligence and Image Processing not elsewhere classified
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact email@example.com.