We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Zhang Bo, Zhang Ling. A Relation Matrix Approach to Labelling Temporal Relations in Scheduling[J]. Journal of Computer Science and Technology, 1991, 6(4): 339-346.
Citation: Zhang Bo, Zhang Ling. A Relation Matrix Approach to Labelling Temporal Relations in Scheduling[J]. Journal of Computer Science and Technology, 1991, 6(4): 339-346.

A Relation Matrix Approach to Labelling Temporal Relations in Scheduling

More Information
  • Published Date: October 09, 1991
  • 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.
  • [1]
    Allen.J.F., An interval-based representation of temporal knowledge. IJCAI-81, 221-226.
    [2]
    Allen.J.F., Toward a general theory of actions and time. Al, 23 (1984), 123-154.
    [3]
    McDermott.D., A temporal logic for reasoning about processes and plans. Cognitive Science 6, 1982. 101-155.
    [4]
    Charniak.E & McDermott.D., Introduction to Artificial Intelligence. Addison-Wesley Pub.CO., 1985.
    [5]
    Cook.S.A., The complexity of theorem-proving procedures. Proc. 3rd Ann . ACM Symp. On Theory of Computing, ACM.1971.151-158. ………….

Catalog

    Article views (10) PDF downloads (1258) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return