摘要
In this paper,we present a relation matrix description of temporal relations.Based on this modela new algorithm for labelling temporal relations is proposed.Under certain conditions the algorithm iscompleted and has a polynomial complexity.In general cases it is still an efficient algorithm comparedto some known algorithms.
In this paper,we present a relation matrix description of temporal relations.Based on this model a new algorithm for labelling temporal relations is proposed.Under certain conditions the algorithm is completed and has a polynomial complexity.In general cases it is still an efficient algorithm compared to some known algorithms.
