메뉴 건너뛰기




Volumn , Issue , 2001, Pages 89-94

Interval-based temporal reasoning with general TBoxes

Author keywords

[No Author keywords available]

Indexed keywords

CONCRETE DOMAINS; DECISION PROCEDURE; DESCRIPTION LOGIC; TEMPORAL REASONING;

EID: 84880909156     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (31)

References (14)
  • 1
    • 0020849266 scopus 로고
    • Maintaining knowledge about temporal intervals
    • J. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11), 1983.
    • (1983) Communications of the ACM , vol.26 , Issue.11
    • Allen, J.1
  • 5
    • 0002800118 scopus 로고
    • A scheme for integrating concrete domains into concept languages
    • Sydney, Australia, Morgan Kaufmann Publ. Inc.
    • F. Baader and P. Hanschke. A scheme for integrating concrete domains into concept languages. In Proc. of IJCAI-91, pages 452-457, Sydney, Australia, 1991. Morgan Kaufmann Publ. Inc.
    • (1991) Proc. of IJCAI-91 , pp. 452-457
    • Baader, F.1    Hanschke, P.2
  • 8
    • 84856278230 scopus 로고    scopus 로고
    • Interval-based Temporal Reasoning with General TBoxes
    • LuFG Theoretical Computer Science, Germany, See
    • C. Lutz Interval-based Temporal Reasoning with General TBoxes. LTCS-Report LTCS-00-06, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2000. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
    • (2000) LTCS-Report LTCS-00-06
    • Lutz, C.1
  • 9
    • 84867792799 scopus 로고    scopus 로고
    • NExpTime-complete description logics with concrete domains
    • Proc. of IJCAR 2001, Siena, Italy, Springer-Verlag
    • C. Lutz. NExpTime-complete description logics with concrete domains. In Proc. of IJCAR 2001, LNCS, Siena, Italy, 2001. Springer-Verlag.
    • (2001) LNCS
    • Lutz, C.1
  • 10
    • 0025434889 scopus 로고
    • Terminological reasoning is inherently intractable
    • DOI 10.1016/0004-3702(90)90087-G
    • B. Nebel. Terminological reasoning is inherently intractable. Artificial Intelligence, 43:235-249, 1990. (Pubitemid 20697329)
    • (1990) Artificial Intelligence , vol.43 , Issue.2 , pp. 235-249
    • Nebel, B.1
  • 12
    • 0000597279 scopus 로고
    • A correspondence theory for terminological logics
    • Sidney, Australia, Morgan Kaufmann Publ. Inc.
    • K. D. Schild. A correspondence theory for terminological logics. In Proc. of IJCAI-91, pages 466-471, Sidney, Australia, 1991. Morgan Kaufmann Publ. Inc.
    • (1991) Proc. of IJCAI-91 , pp. 466-471
    • Schild, K.D.1
  • 13
    • 0022704337 scopus 로고
    • AUTOMATA-THEORETIC TECHNIQUES FOR MODAL LOGICS OF PROGRAMS.
    • DOI 10.1016/0022-0000(86)90026-7
    • M. Y. Vardi and P. Wolper. Automatatheoretic techniques for modal logic of programs. Journal of Computer and System Sciences, 32:183-221, 1986. (Pubitemid 16586688)
    • (1986) Journal of Computer and System Sciences , vol.32 , Issue.2 , pp. 183-221
    • Vardi, M.Y.1    Wolper, P.2
  • 14
    • 0020311129 scopus 로고
    • A system for reasoning about time
    • Pittsburgh, Pennsylvania
    • M. Vilain. A system for reasoning about time. In Proceedings of the Second AAAI, pages 197-201, Pittsburgh, Pennsylvania, 1982.
    • (1982) Proceedings of the Second AAAI , pp. 197-201
    • Vilain, M.1


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