메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 572-577

Integrating description logics and action formalisms: First results

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; INFORMATION TECHNOLOGY; LINEAR ALGEBRA; PROBLEM SOLVING; SEMANTICS;

EID: 29344471510     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (117)

References (15)
  • 1
    • 84956862612 scopus 로고    scopus 로고
    • A road-map on complexity for hybrid logics
    • of LNCS, Springer-Verlag.
    • Areces, C.; Blackburn, P.; and Marx, M. 1999. A road-map on complexity for hybrid logics. In Proc. of CSL'05, volume 1683 of LNCS, 307-321. Springer-Verlag.
    • (1999) Proc. of CSL'05 , vol.1683 , pp. 307-321
    • Areces, C.1    Blackburn, P.2    Marx, M.3
  • 3
    • 29344457172 scopus 로고    scopus 로고
    • Integrating description logics and action formalisms for reasoning about web services
    • Baader, F.; Lutz, C.; Milicic, M.; Sattler, U.; Wolter, F. 2005. Integrating description logics and action formalisms for reasoning about web services. Technical report LTCS-05-02. http:/lat.inf.tu-dresden.de/research/ reports.html
    • (2005) Technical Report LTCS-05-02
    • Baader, F.1    Lutz, C.2    Milicic, M.3    Sattler, U.4    Wolter, F.5
  • 6
    • 0030374010 scopus 로고    scopus 로고
    • Embracing causality in specifying the indeterminate effects of actions
    • MIT Press
    • Lin, F. 1996. Embracing causality in specifying the indeterminate effects of actions. In Proc. of AAAI-96, 670-676. MIT Press.
    • (1996) Proc. of AAAI-96 , pp. 670-676
    • Lin, F.1
  • 7
    • 0025434889 scopus 로고
    • Terminological reasoning is inherently intractable
    • Nebel, B. 1990. Terminological reasoning is inherently intractable. Artificial Intelligence 43:235-249.
    • (1990) Artificial Intelligence , vol.43 , pp. 235-249
    • Nebel, B.1
  • 9
    • 0002048328 scopus 로고
    • The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression
    • Academic Press
    • Reiter, R. 1991. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In AI and Mathematical Theory of Computation. Academic Press. 359-380.
    • (1991) AI and Mathematical Theory of Computation , pp. 359-380
    • Reiter, R.1
  • 13
    • 0004098886 scopus 로고    scopus 로고
    • Nondeterministic actions in the fluent calculus: Disjunctive state update axioms
    • Kluwer Academic
    • Thielscher, M. 2000. Nondeterministic actions in the fluent calculus: Disjunctive state update axioms. In Intellectics and Computational Logic. Kluwer Academic. 327-345.
    • (2000) Intellectics and Computational Logic , pp. 327-345
    • Thielscher, M.1
  • 14
    • 14344269579 scopus 로고    scopus 로고
    • The complexity of reasoning with car-dinality restrictions and nominals in expressive description logics
    • Tobies, S. 2000. The complexity of reasoning with car-dinality restrictions and nominals in expressive description logics. JAIR 12:199-217.
    • (2000) JAIR , vol.12 , pp. 199-217
    • Tobies, S.1
  • 15
    • 85156267281 scopus 로고
    • Reasoning about action using a possible models approach
    • Winslett, M. 1988. Reasoning about action using a possible models approach. In Proc. of AAAI'88, 89-93.
    • (1988) Proc. of AAAI'88 , pp. 89-93
    • Winslett, M.1


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