메뉴 건너뛰기




Volumn , Issue , 2013, Pages 768-774

Tractable queries for lightweight description logics

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; DATA BASE THEORY; DATALOG PROGRAMS; DESCRIPTION LOGIC; KNOWLEDGE BASIS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; QUERY EVALUATION;

EID: 84896062717     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (49)

References (24)
  • 1
    • 77957599502 scopus 로고    scopus 로고
    • Pushing the EL envelope
    • Franz Baader, Sebastian Brandt, and Carsten Lutz. Pushing the EL envelope. In Proc. of IJCAI, pages 364-369, 2005.
    • (2005) Proc. of IJCAI , pp. 364-369
    • Baader, F.1    Brandt, S.2    Lutz, C.3
  • 2
    • 34548305118 scopus 로고    scopus 로고
    • Tractable reasoning and efficient query answering in description logics: The DL-Lite family
    • Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Automated Reasoning, 39(3):385-429, 2007.
    • (2007) J. 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
  • 3
    • 84948974054 scopus 로고    scopus 로고
    • Conjunctive query containment revisited
    • Springer
    • Chandra Chekuri and Anand Rajaraman. Conjunctive query containment revisited. In Proc. of ICDT, pages 56-70. Springer, 1997.
    • (1997) Proc. of ICDT , pp. 56-70
    • Chekuri, C.1    Rajaraman, A.2
  • 4
    • 0038062314 scopus 로고    scopus 로고
    • Complexity and expressive power of logic programming
    • September
    • Evgeny Dantsin, Thomas Eiter, Georg Gottlob, and Andrei Voronkov. Complexity and expressive power of logic programming. ACM Computing Survey, 33(3):374-425, September 2001.
    • (2001) ACM Computing Survey , vol.33 , Issue.3 , pp. 374-425
    • Dantsin, E.1    Eiter, T.2    Gottlob, G.3    Voronkov, A.4
  • 6
    • 0032650621 scopus 로고    scopus 로고
    • Hypertree decompositions and tractable queries
    • ACM Press
    • Georg Gottlob, Nicola Leone, and Francesco Scarcello. Hypertree decompositions and tractable queries. In Proc. of PODS, pages 21-32. ACM Press, 1999.
    • (1999) Proc. of PODS , pp. 21-32
    • Gottlob, G.1    Leone, N.2    Scarcello, F.3
  • 7
    • 25144513579 scopus 로고    scopus 로고
    • LUBM: A benchmark for OWL knowledge base systems
    • Yuanbo Guo, Zhengxiang Pan, and Jeff Heflin. LUBM: A benchmark for OWL knowledge base systems. J. Web Semantics, 3(2-3):158-182, 2005.
    • (2005) J. Web Semantics , vol.3 , Issue.2-3 , pp. 158-182
    • Guo, Y.1    Pan, Z.2    Heflin, J.3
  • 9
    • 84891921527 scopus 로고    scopus 로고
    • Conjunctive query answering with OWL 2 QL
    • AAAI Press
    • Stanislav Kikot, Roman Kontchakov, and Michael Zakharyaschev. Conjunctive query answering with OWL 2 QL. In Proc. of KR. AAAI Press, 2012.
    • (2012) Proc. of KR
    • Kikot, S.1    Kontchakov, R.2    Zakharyaschev, M.3
  • 11
    • 0032156942 scopus 로고    scopus 로고
    • Combining Horn rules and description logics in CARIN
    • Alon Y. Levy and Marie-Christine 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.2
  • 12
    • 78751689814 scopus 로고    scopus 로고
    • Conjunctive query answering in the description logic EL using a relational database system
    • Carsten Lutz, David Toman, and Frank Wolter. Conjunctive query answering in the description logic EL using a relational database system. In Proc. of IJCAI, pages 2070-2075, 2009.
    • (2009) Proc. of IJCAI , pp. 2070-2075
    • Lutz, C.1    Toman, D.2    Wolter, F.3
  • 13
    • 84892402824 scopus 로고    scopus 로고
    • The combined approach to OBDA: Taming role hierarchies using filters (with appendix)
    • Carsten Lutz, Inanc Seylan, David Toman, and Frank Wolter. The combined approach to OBDA: Taming role hierarchies using filters (with appendix). In Proc. of SSWS+HPCSW, 2012.
    • (2012) Proc. of SSWS+HPCSW
    • Lutz, C.1    Seylan, I.2    Toman, D.3    Wolter, F.4
  • 14
    • 53049089896 scopus 로고    scopus 로고
    • The complexity of conjunctive query answering in expressive description logics
    • Springer
    • Carsten Lutz. The complexity of conjunctive query answering in expressive description logics. In Proc. of IJCAR, pages 179-193. Springer, 2008.
    • (2008) Proc. of IJCAR , pp. 179-193
    • Lutz, C.1
  • 15
    • 84865814453 scopus 로고    scopus 로고
    • Reasoning and query answering in description logics
    • Springer
    • Magdalena Ortiz and Mantas Simkus. Reasoning and query answering in description logics. In Reasoning Web, pages 1-53. Springer, 2012.
    • (2012) Reasoning Web , pp. 1-53
    • Ortiz, M.1    Simkus, M.2
  • 16
  • 18
  • 19
    • 84893393225 scopus 로고    scopus 로고
    • High performance query answering over DL-Lite ontologies
    • AAAI Press
    • Mariano Rodriguez-Muro and Diego Calvanese. High performance query answering over DL-Lite ontologies. In Proc. of KR, pages 308-318. AAAI Press, 2012.
    • (2012) Proc. of KR , pp. 308-318
    • Rodriguez-Muro, M.1    Calvanese, D.2
  • 20
    • 84885910857 scopus 로고    scopus 로고
    • Improving query answering over DL-Lite ontologies
    • AAAI Press
    • Riccardo Rosati and Alessandro Almatelli. Improving query answering over DL-Lite ontologies. In Proc. of KR. AAAI Press, 2010.
    • (2010) Proc. of KR
    • Rosati, R.1    Almatelli, A.2
  • 21
    • 56649109557 scopus 로고    scopus 로고
    • Cheap boolean role constructors for description logics
    • Sebastian Rudolph, Markus Krötzsch, and Pascal Hitzler. Cheap boolean role constructors for description logics. In Proc. of JELIA, pages 362-374, 2008.
    • (2008) Proc. of JELIA , pp. 362-374
    • Rudolph, S.1    Krötzsch, M.2    Hitzler, P.3
  • 22
    • 80051700021 scopus 로고    scopus 로고
    • Owlgres: A scalable OWL reasoner
    • CEUR-WS.org
    • Markus Stocker and Michael Smith. Owlgres: A scalable OWL reasoner. In Proc. of OWLED. CEUR-WS.org, 2008.
    • (2008) Proc. of OWLED
    • Stocker, M.1    Smith, M.2
  • 23
    • 84872895221 scopus 로고    scopus 로고
    • Incremental query rewriting for OWL 2 QL
    • CEUR-WS.org
    • Tassos Venetis, Giorgos Stoilos, and Giorgos B. Stamou. Incremental query rewriting for OWL 2 QL. In Proc. of DL. CEUR-WS.org, 2012.
    • (2012) Proc. of DL
    • Venetis, T.1    Stoilos, G.2    Stamou, G.B.3
  • 24
    • 0019714095 scopus 로고
    • Algorithms for acyclic database schemes
    • IEEE Computer Society
    • Mihalis Yannakakis. Algorithms for acyclic database schemes. In Proc. of VLDB, pages 82-94. IEEE Computer Society, 1981.
    • (1981) Proc. of VLDB , pp. 82-94
    • Yannakakis, M.1


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