메뉴 건너뛰기




Volumn 1, Issue , 2007, Pages 452-457

Complexity boundaries for horn description logics

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY;

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

References (10)
  • 2
    • 29344454351 scopus 로고    scopus 로고
    • DL-Lite: Tractable description logics for ontologies
    • Veloso, M. M, and Kambhampati, S, eds, Pittsburgh, Pennsylvania, USA, AAAI Press AAAI Press, The MIT Press
    • Calvanese, D.; Giacomo, G. D.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2005. DL-Lite: Tractable description logics for ontologies, In Veloso, M. M., and Kambhampati, S., eds., Proc. AAAI-05, Pittsburgh, Pennsylvania, USA, 602-607. AAAI Press AAAI Press / The MIT Press.
    • (2005) Proc. AAAI-05 , pp. 602-607
    • Calvanese, D.1    Giacomo, G.D.2    Lembo, D.3    Lenzerini, M.4    Rosati, R.5
  • 8
    • 36349024504 scopus 로고    scopus 로고
    • Complexity of Horn description logics
    • Technical report, Universität Karlsruhe TH, Germany, Feb
    • Krötzsch, M.; Rudolph, S.; and Hitzler, P. 2007. Complexity of Horn description logics. Technical report, Universität Karlsruhe (TH), Germany, Feb 2007.
    • (2007)
    • Krötzsch, M.1    Rudolph, S.2    Hitzler, P.3


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