메뉴 건너뛰기




Volumn 147, Issue , 2005, Pages

Data complexity of query answering in description logics

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; CONP-HARDNESS; DATA COMPLEXITY; DESCRIPTION LOGIC; FIRST ORDER LOGIC; KNOWLEDGE BASIS; LOGSPACE; QUERY ANSWERING; SQL QUERY; UML CLASS DIAGRAMS;

EID: 33750729084     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (10)

References (10)
  • 6
    • 0001173857 scopus 로고
    • Deduction in concept languages: From subsumption to instance checking
    • F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Deduction in concept languages: From subsumption to instance checking. J. of Logic and Computation, 4(4):423{452, 1994.
    • (1994) J. of Logic and Computation , vol.4 , Issue.4 , pp. 423-452
    • Donini, F.M.1    Lenzerini, M.2    Nardi, D.3    Schaerf, A.4
  • 8
    • 0035268580 scopus 로고    scopus 로고
    • A portrait of the semantic web in action
    • J. Hein and J. Hendler. A portrait of the semantic web in action. IEEE Intel- ligent Systems, 16(2):54{59, 2001.
    • (2001) IEEE Intel- Ligent Systems , vol.16 , Issue.2 , pp. 54-59
    • Hein, J.1    Hendler, J.2


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