메뉴 건너뛰기




Volumn 102, Issue 1, 1998, Pages 143-155

A unifying approach to temporal constraint reasoning

Author keywords

Algorithms; Complexity; Disjunctive linear relations; Temporal constraint reasoning

Indexed keywords

ALGEBRA; ALGORITHMS; MATHEMATICAL TECHNIQUES; POLYNOMIALS;

EID: 0041126003     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(98)00031-9     Document Type: Article
Times cited : (76)

References (26)
  • 1
    • 0020849266 scopus 로고
    • Maintaining knowledge about temporal intervals
    • J.F. Allen, Maintaining knowledge about temporal intervals, Comm. ACM 26 (11) (1983) 832-843.
    • (1983) Comm. ACM , vol.26 , Issue.11 , pp. 832-843
    • Allen, J.F.1
  • 2
    • 0001847014 scopus 로고
    • Temporal reasoning and planning
    • J. Allen, H. Kautz, R. Pelavin, J. Tenenberg (Eds.), Morgan Kaufmann, San Mateo, CA
    • J.F. Allen, Temporal reasoning and planning, in: J. Allen, H. Kautz, R. Pelavin, J. Tenenberg (Eds.), Reasoning about Plans, Morgan Kaufmann, San Mateo, CA, 1991, pp. 1-67.
    • (1991) Reasoning about Plans , pp. 1-67
    • Allen, J.F.1
  • 3
    • 0010203958 scopus 로고
    • A metric time-point and duration-based temporal model
    • F.A. Barber, A metric time-point and duration-based temporal model, SIGART Bull. 4 (3) (1993) 30-49.
    • (1993) SIGART Bull. , vol.4 , Issue.3 , pp. 30-49
    • Barber, F.A.1
  • 4
    • 0000168740 scopus 로고
    • On the topology of the genetic fine structure
    • S. Benzer, On the topology of the genetic fine structure, Proc. Nat. Acad. Sci. USA (1959) 1607-1620.
    • (1959) Proc. Nat. Acad. Sci. USA , pp. 1607-1620
    • Benzer, S.1
  • 5
    • 0024101726 scopus 로고
    • Reasoning about partially ordered events
    • T. Dean, M. Boddy, Reasoning about partially ordered events. Artificial Intelligence 36 (1989) 375-399.
    • (1989) Artificial Intelligence , vol.36 , pp. 375-399
    • Dean, T.1    Boddy, M.2
  • 8
    • 0009348969 scopus 로고    scopus 로고
    • Eight maximal tractable subclasses of Allen's algebra with metric time
    • T. Drakengren, P. Jonsson, Eight maximal tractable subclasses of Allen's algebra with metric time, J. Artif. Intell. Res. 7 (1997) 25-45.
    • (1997) J. Artif. Intell. Res. , vol.7 , pp. 25-45
    • Drakengren, T.1    Jonsson, P.2
  • 9
    • 0031164340 scopus 로고    scopus 로고
    • Twenty-one large tractable subclasses of Allen's algebra
    • T. Drakengren, P. Jonsson, Twenty-one large tractable subclasses of Allen's algebra, Artificial Intelligence 93 (1997) 297-319.
    • (1997) Artificial Intelligence , vol.93 , pp. 297-319
    • Drakengren, T.1    Jonsson, P.2
  • 10
  • 11
    • 0027694565 scopus 로고
    • Complexity and algorithms for reasoning about time: A graph-theoretic approach
    • M.C. Golumbic, R. Shamir, Complexity and algorithms for reasoning about time: a graph-theoretic approach, J. ACM 40 (5) (1993) 1108-1133.
    • (1993) J. ACM , vol.40 , Issue.5 , pp. 1108-1133
    • Golumbic, M.C.1    Shamir, R.2
  • 15
    • 51249181779 scopus 로고
    • A new polynomial time algorithm for linear programming
    • N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.1
  • 17
    • 0000564361 scopus 로고
    • A polynomial algorithm in linear programming
    • L.G. Khachiyan, A polynomial algorithm in linear programming, Soviet Math. Dokl. 20 (1979) 191-194.
    • (1979) Soviet Math. Dokl. , vol.20 , pp. 191-194
    • Khachiyan, L.G.1
  • 20
    • 0003150121 scopus 로고
    • A canonical form for generalized linear constraints
    • J.-L. Lassez, K. McAloon, A canonical form for generalized linear constraints, J. Symbolic Logic 13 (1992) 1-14.
    • (1992) J. Symbolic Logic , vol.13 , pp. 1-14
    • Lassez, J.-L.1    McAloon, K.2
  • 21
    • 0030288617 scopus 로고    scopus 로고
    • Combining qualitative and quantitative constraints in temporal reasoning
    • I. Meiri, Combining qualitative and quantitative constraints in temporal reasoning, Artificial Intelligence 87 (1-2) (1996) 343-385.
    • (1996) Artificial Intelligence , vol.87 , Issue.1-2 , pp. 343-385
    • Meiri, I.1
  • 22
    • 0029229419 scopus 로고
    • Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra
    • B. Nebel, H.-J. Bürckert, Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra, J. ACM 42 (1) (1995) 43-66.
    • (1995) J. ACM , vol.42 , Issue.1 , pp. 43-66
    • Nebel, B.1    Bürckert, H.-J.2
  • 24
    • 84990586467 scopus 로고
    • Exact and approximate reasoning about temporal relations
    • P. van Beek, R. Cohen, Exact and approximate reasoning about temporal relations. Comput. Intell. 6 (3) (1990) 132-144.
    • (1990) Comput. Intell. , vol.6 , Issue.3 , pp. 132-144
    • Van Beek, P.1    Cohen, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.