메뉴 건너뛰기




Volumn , Issue , 2012, Pages 221-231

Query containment in description logics reconsidered

Author keywords

[No Author keywords available]

Indexed keywords

DATA DESCRIPTION; FORMAL LANGUAGES; ONTOLOGY;

EID: 84893352948     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (30)

References (32)
  • 4
    • 84860568616 scopus 로고    scopus 로고
    • Query and predicate emptiness in description logics
    • Baader, F.; Bienvenu, M.; Lutz, C.; and Wolter, F. 2010. Query and predicate emptiness in description logics. In Proc. of KR, 192-202.
    • (2010) Proc. of KR , pp. 192-202
    • Baader, F.1    Bienvenu, M.2    Lutz, C.3    Wolter, F.4
  • 6
    • 34548305118 scopus 로고    scopus 로고
    • Tractable reasoning and efficient query answering in description logics: The DL-lite family
    • Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2007. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3):385-429.
    • (2007) J. of Automated Reasoning , vol.39 , Issue.3 , pp. 385-429
    • Calvanese, D.1    De Giacomo, G.2    Lembo, D.3    Lenzerini, M.4    Rosati, R.5
  • 8
    • 0031628670 scopus 로고    scopus 로고
    • On the decidability of query containment under constraints
    • Calvanese, D.; De Giacomo, G.; and Lenzerini, M. 1998. On the decidability of query containment under constraints. In Proc. of PODS, 149-158.
    • (1998) Proc. of PODS , pp. 149-158
    • Calvanese, D.1    De Giacomo, G.2    Lenzerini, M.3
  • 9
    • 84881033685 scopus 로고    scopus 로고
    • Containment of regular path queries under description logic constraints
    • Calvanese, D.; Ortiz, M.; and Simkus, M. 2011. Containment of regular path queries under description logic constraints. In Proc. of IJCAI, 805-812.
    • (2011) Proc. of IJCAI , pp. 805-812
    • Calvanese, D.1    Ortiz, M.2    Simkus, M.3
  • 11
    • 84958776545 scopus 로고
    • Optimal implementation of conjunctive queries in relational data bases
    • Chandra, A. K., and Merlin, P. M. 1977. Optimal implementation of conjunctive queries in relational data bases. In Proc. of STOC, 77-90.
    • (1977) Proc. of STOC , pp. 77-90
    • Chandra, A.K.1    Merlin, P.M.2
  • 12
    • 84898929116 scopus 로고
    • Decidable optimization problems for database logic programs (preliminary report)
    • Cosmadakis, S. S.; Gaifman, H.; Kanellakis, P. C.; and Vardi, M. Y. 1988. Decidable optimization problems for database logic programs (preliminary report). In Proc. of STOC, 477-490.
    • (1988) Proc. of STOC , pp. 477-490
    • Cosmadakis, S.S.1    Gaifman, H.2    Kanellakis, P.C.3    Vardi, M.Y.4
  • 15
    • 0023581504 scopus 로고
    • The strong exponential hierarchy collapses
    • Hemachandra, L. A. 1987. The strong exponential hierarchy collapses. In Proc. of STOC, 110-122.
    • (1987) Proc. of STOC , pp. 110-122
    • Hemachandra, L.A.1
  • 16
    • 84880733253 scopus 로고    scopus 로고
    • Data complexity of reasoning in very expressive description logics
    • Hustadt, U.; Motik, B.; and Sattler, U. 2005. Data complexity of reasoning in very expressive description logics. In Proc. of IJCAI, 466-471.
    • (2005) Proc. of IJCAI , pp. 466-471
    • Hustadt, U.1    Motik, B.2    Sattler, U.3
  • 17
    • 33645178605 scopus 로고    scopus 로고
    • The International Health Terminology Standards Development Organisation (IHTSDO)
    • IHTSDO. 2008. SNOMED Clinical Terms User Guide. The International Health Terminology Standards Development Organisation (IHTSDO). Available from http://www.ihtsdo.org/publications/snomed-docs/.
    • (2008) SNOMED Clinical Terms User Guide
  • 18
    • 78649780810 scopus 로고    scopus 로고
    • Supporting concurrent ontology development: Framework, algorithms and tool
    • Jimnez-Ruiz, E.; Grau, B. C.; Horrocks, I.; and Llavori, R. B. 2011. Supporting concurrent ontology development: Framework, algorithms and tool. Data & Knowledge Engineering 70(1):146-164.
    • (2011) Data & Knowledge Engineering , vol.70 , Issue.1 , pp. 146-164
    • Jimnez-Ruiz, E.1    Grau, B.C.2    Horrocks, I.3    Llavori, R.B.4
  • 21
    • 53049098297 scopus 로고    scopus 로고
    • The logical difference problem for description logic terminologies
    • Konev, B.; Walther, D.; and Wolter, F. 2008. The logical difference problem for description logic terminologies. In Proc. of IJCAR, 259-274.
    • (2008) Proc. of IJCAR , pp. 259-274
    • Konev, B.1    Walther, D.2    Wolter, F.3
  • 23
    • 84893358601 scopus 로고    scopus 로고
    • The projection problem for EL actions
    • Liu, H.; Lutz, C.; and Milicic, M. 2008. The projection problem for EL actions. In Proc. of DL.
    • (2008) Proc. of DL
    • Liu, H.1    Lutz, C.2    Milicic, M.3
  • 24
    • 78751689814 scopus 로고    scopus 로고
    • Conjunctive query answering in the description logic EL using a relational database system
    • Lutz, C.; Toman, D.; and Wolter, F. 2009. Conjunctive query answering in the description logic EL using a relational database system. In Proc. of IJCAI, 2070-2075.
    • (2009) Proc. of IJCAI , pp. 2070-2075
    • Lutz, C.1    Toman, D.2    Wolter, F.3
  • 25
    • 53049089896 scopus 로고    scopus 로고
    • The complexity of conjunctive query answering in expressive description logics
    • Lutz, C. 2008. The complexity of conjunctive query answering in expressive description logics. In Proc. of IJCAR, 179-193.
    • (2008) Proc. of IJCAR , pp. 179-193
    • Lutz, C.1
  • 26
    • 0036927347 scopus 로고    scopus 로고
    • PromptDiff: A fixed-point algorithm for comparing ontology versions
    • Noy, N. F., and Musen, M. A. 2002. PromptDiff: A fixed-point algorithm for comparing ontology versions. In Proc. of AAAI, 744-750.
    • (2002) Proc. of AAAI , pp. 744-750
    • Noy, N.F.1    Musen, M.A.2
  • 27
    • 84865830031 scopus 로고    scopus 로고
    • Query answering in the horn fragments of the description logics SHOIQ and SROIQ
    • Ortiz, M.; Rudolph, S.; and Simkus, M. 2011. Query answering in the Horn fragments of the description logics SHOIQ and SROIQ. In Proc. of IJCAI, 1039-1044.
    • (2011) Proc. of IJCAI , pp. 1039-1044
    • Ortiz, M.1    Rudolph, S.2    Simkus, M.3
  • 29
    • 84976685263 scopus 로고
    • Equivalences among relational expressions with the union and difference operators
    • Sagiv, Y., and Yannakakis, M. 1980. Equivalences among relational expressions with the union and difference operators. J. of the ACM 27(4):633-655.
    • (1980) J. of the ACM , vol.27 , Issue.4 , pp. 633-655
    • Sagiv, Y.1    Yannakakis, M.2
  • 30
    • 0023535527 scopus 로고
    • Optimizing datalog programs
    • Sagiv, Y. 1987. Optimizing datalog programs. In Proc. of PODS, 349-362.
    • (1987) Proc. of PODS , pp. 349-362
    • Sagiv, Y.1
  • 31
    • 0023602668 scopus 로고
    • Decidability and expressiveness of logic queries
    • Shmueli, O. 1987. Decidability and expressiveness of logic queries. In Proc. of PODS, 237-249.
    • (1987) Proc. of PODS , pp. 237-249
    • Shmueli, O.1
  • 32
    • 33751431796 scopus 로고    scopus 로고
    • NCI thesaurus: A semantic model integrating cancer-related clinical and molecular information
    • Sioutos, N.; de Coronado, S.; Haber, M.; Hartel, F.; Shaiu, W.; and Wright, L. 2006. NCI thesaurus: a semantic model integrating cancer-related clinical and molecular information. J. of Biomedical Informatics 40(1):30-43.
    • (2006) J. of Biomedical Informatics , vol.40 , Issue.1 , pp. 30-43
    • Sioutos, N.1    De Coronado, S.2    Haber, M.3    Hartel, F.4    Shaiu, W.5    Wright, L.6


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