메뉴 건너뛰기




Volumn 188, Issue , 2005, Pages

Tailoring OWL for data intensive ontologies

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPTUAL MODEL; CONCEPTUAL VIEWS; CONJUNCTIVE QUERIES; DATA REPOSITORIES; DESCRIPTION LOGIC; LARGE AMOUNTS OF DATA; MODELING FEATURES; UML CLASS DIAGRAMS;

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

References (20)
  • 5
    • 84880843747 scopus 로고    scopus 로고
    • Query rewriting and answering under constraints in data integration systems
    • A. Calí, D. Lembo, and R. Rosati. Query rewriting and answering under constraints in data integration systems. In Proc. of IJCAI 2003, pages 16-21, 2003.
    • (2003) Proc. of IJCAI 2003 , pp. 16-21
    • Calí, A.1    Lembo, D.2    Rosati, R.3
  • 6
    • 0039344197 scopus 로고    scopus 로고
    • Reasoning with inclusion axioms in description logics: Algorithms and complexity
    • John Wiley & Sons
    • D. Calvanese. Reasoning with inclusion axioms in description logics: Algorithms and complexity. In Proc. of ECAI'96, pages 303-307. John Wiley & Sons, 1996.
    • (1996) Proc. of ECAI'96 , pp. 303-307
    • Calvanese, D.1
  • 9
    • 85158139777 scopus 로고    scopus 로고
    • Answering queries using views over description logics knowledge bases
    • D. Calvanese, G. De Giacomo, and M. Lenzerini. Answering queries using views over description logics knowledge bases. In Proc. of AAAI 2000, pages 386-391, 2000.
    • (2000) Proc. of AAAI 2000 , pp. 386-391
    • Calvanese, D.1    De Giacomo, G.2    Lenzerini, M.3
  • 11
    • 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 Log. and Comp., 4(4): 423-452, 1994.
    • (1994) J. of Log. and Comp. , vol.4 , Issue.4 , pp. 423-452
    • Donini, F.M.1    Lenzerini, M.2    Nardi, D.3    Schaerf, A.4
  • 12
    • 84880493386 scopus 로고    scopus 로고
    • Description logic programs: Combining logic programs with description logic
    • B. N. Grosof, I. Horrocks, R. Volz, and S. Decker. Description logic programs: Combining logic programs with description logic. In Proc. of WWW 2003, pages 48-57, 2003.
    • (2003) Proc. of WWW 2003 , pp. 48-57
    • Grosof, B.N.1    Horrocks, I.2    Volz, R.3    Decker, S.4
  • 13
    • 0035268580 scopus 로고    scopus 로고
    • A portrait of the semantic web in action
    • J. Heflin and J. Hendler. A portrait of the semantic web in action. IEEE Intelligent Systems, 16(2): 54-59, 2001.
    • (2001) IEEE Intelligent Systems , vol.16 , Issue.2 , pp. 54-59
    • Heflin, J.1    Hendler, J.2
  • 15
    • 84880733253 scopus 로고    scopus 로고
    • Data complexity of reasoning in very expressive description logics
    • U. Hustadt, B. Motik, and U. Sattler. Data complexity of reasoning in very expressive description logics. In Proc. of IJCAI 2005, 2005.
    • (2005) Proc. of IJCAI 2005
    • Hustadt, U.1    Motik, B.2    Sattler, U.3
  • 16
    • 0036036947 scopus 로고    scopus 로고
    • Data integration: A theoretical perspective
    • M. Lenzerini. Data integration: A theoretical perspective. In Proc. of PODS 2002, pages 233-246, 2002.
    • (2002) Proc. of PODS 2002 , pp. 233-246
    • Lenzerini, M.1
  • 18
    • 0032156942 scopus 로고    scopus 로고
    • Combining horn rules and description logics in CARIN
    • A. Y. Levy and M.-C. Rousset. Combining Horn rules and description logics in CARIN. Artificial Intelligence, 104(1-2): 165-209, 1998.
    • (1998) Artificial Intelligence , vol.104 , Issue.1-2 , pp. 165-209
    • Levy, A.Y.1    Rousset, M.-C.2
  • 19
    • 33750699119 scopus 로고    scopus 로고
    • Data complexity of answering conjunctive queries over SHIQ knowledge bases
    • Free Univ. of Bozen-Bolzano, July Also available as CORR technical report at http://arxiv.org/abs/cs.LO/0507059/
    • M. M. Ortiz de la Fuente, D. Calvanese, T. Eiter, and E. Franconi. Data complexity of answering conjunctive queries over SHIQ knowledge bases. Technical report, Fac. of Computer Science, Free Univ. of Bozen-Bolzano, July 2005. Also available as CORR technical report at http://arxiv.org/abs/cs.LO/0507059/.
    • (2005) Technical Report, Fac of Computer Science
    • Ortiz De La Fuente, M.M.1    Calvanese, D.2    Eiter, T.3    Franconi, E.4
  • 20
    • 85028752389 scopus 로고
    • The complexity of relational query languages
    • M. Y. Vardi. The complexity of relational query languages. In Proc. of STOC'82, pages 137-146, 1982.
    • (1982) Proc. of STOC'82 , pp. 137-146
    • Vardi, M.Y.1


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