Temporal constraint satisfaction in matrix method

Publication Type:
Journal Article
Applied Artificial Intelligence, 2003, 17 (2), pp. 135 - 154
Issue Date:
Filename Description Size
Thumbnail2003000490.pdf186.88 kB
Adobe PDF
Full metadata record
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. © 2003 Taylor and Francis Group, LLC.
Please use this identifier to cite or link to this item: