메뉴 건너뛰기




Volumn 78, Issue 1, 2012, Pages 47-85

Conjunctive query answering in the description logic SH using knots

Author keywords

Computational complexity; Conjunctive query answering; Description Logics; Disjunctive Datalog; Knots

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA DESCRIPTION; FORMAL LANGUAGES; KNOWLEDGE BASED SYSTEMS; OPTIMIZATION; TERMINOLOGY;

EID: 81955161258     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2011.02.012     Document Type: Conference Paper
Times cited : (32)

References (55)
  • 1
    • 38349043953 scopus 로고    scopus 로고
    • Reasoning over extended ER models
    • C. Parent, K.-D. Schewe, V.C. Storey, B. Thalheim, Lecture Notes in Comput. Sci. Springer
    • A. Artale, D. Calvanese, R. Kontchakov, V. Ryzhikov, and M. Zakharyaschev Reasoning over extended ER models C. Parent, K.-D. Schewe, V.C. Storey, B. Thalheim, ER Lecture Notes in Comput. Sci. vol. 4801 2007 Springer 277 292
    • (2007) ER , vol.4801 , pp. 277-292
    • Artale, A.1    Calvanese, D.2    Kontchakov, R.3    Ryzhikov, V.4    Zakharyaschev, M.5
  • 2
    • 81955167180 scopus 로고    scopus 로고
    • Using causal relationships to deal with the ramification problem in action formalisms based on description logics
    • F. Baader, M. Lippmann, H. Liu, Using causal relationships to deal with the ramification problem in action formalisms based on description logics, in: LPAR, vol. 17, 2010.
    • (2010) LPAR , vol.17
    • Baader, F.1    Lippmann, M.2    Liu, H.3
  • 3
    • 29344471510 scopus 로고    scopus 로고
    • Integrating description logics and action formalisms: First results
    • Proceedings of the 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05
    • F. Baader, C. Lutz, M. Milicic, U. Sattler, and F. Wolter Integrating description logics and action formalisms: First results M.M. Veloso, S. Kambhampati, AAAI 2005 AAAI Press/The MIT Press 572 577 (Pubitemid 43006670)
    • (2005) Proceedings of the National Conference on Artificial Intelligence , vol.2 , pp. 572-577
    • Baader, F.1    Lutz, C.2    Milicic, M.3    Sattler, U.4    Wolter, F.5
  • 5
    • 25144441754 scopus 로고    scopus 로고
    • Reasoning on UML class diagrams
    • DOI 10.1016/j.artint.2005.05.003, PII S0004370205000792
    • D. Berardi, D. Calvanese, and G.D. Giacomo Reasoning on uml class diagrams Artificial Intelligence 168 1-2 2005 70 118 (Pubitemid 41338772)
    • (2005) Artificial Intelligence , vol.168 , Issue.1-2 , pp. 70-118
    • Berardi, D.1    Calvanese, D.2    De Giacomo, G.3
  • 7
    • 45749133516 scopus 로고    scopus 로고
    • Conjunctive query containment and answering under description logics constraints
    • D. Calvanese, G. De Giacomo, and M. Lenzerini Conjunctive query containment and answering under description logics constraints ACM Trans. Comput. Log. 9 3 2008 22.1 22.31
    • (2008) ACM Trans. Comput. Log. , vol.9 , Issue.3 , pp. 221-2231
    • Calvanese, D.1    De Giacomo, G.2    Lenzerini, M.3
  • 9
    • 36349023790 scopus 로고    scopus 로고
    • Answering regular path queries in expressive description logics: An automata-theoretic approach
    • AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
    • D. Calvanese, T. Eiter, M. Ortiz, Answering regular path queries in expressive description logics: An automata-theoretic approach, in: Proc. 22nd Nat. Conf. Artificial Intelligence (AAAI 2007), 2007, pp. 391-396. (Pubitemid 350149602)
    • (2007) Proceedings of the National Conference on Artificial Intelligence , vol.1 , pp. 391-396
    • Calvanese, D.1    Eiter, T.2    Ortiz, M.3
  • 19
    • 47549090600 scopus 로고    scopus 로고
    • Computational aspects of monotone dualization: A brief survey
    • T. Eiter, K. Makino, and G. Gottlob Computational aspects of monotone dualization: A brief survey Discrete Appl. Math. 156 2008 2035 2049
    • (2008) Discrete Appl. Math. , vol.156 , pp. 2035-2049
    • Eiter, T.1    Makino, K.2    Gottlob, G.3
  • 21
    • 76249092810 scopus 로고    scopus 로고
    • FDNC: Decidable non-monotonic disjunctive logic programs with function symbols
    • preliminary conference version in LPAR 2007
    • T. Eiter, and M. Šimkus FDNC: Decidable non-monotonic disjunctive logic programs with function symbols ACM Trans. Comput. Log. 11 2 2010 14.1 14.50 preliminary conference version in LPAR 2007
    • (2010) ACM Trans. Comput. Log. , vol.11 , Issue.2 , pp. 141-1450
    • Eiter, T.1    Šimkus, M.2
  • 25
    • 84860513100 scopus 로고    scopus 로고
    • Unions of conjunctive queries in SHOQ
    • G. Brewka, J. Lang, AAAI Press
    • B. Glimm, I. Horrocks, and U. Sattler Unions of conjunctive queries in SHOQ G. Brewka, J. Lang, KR 2008 AAAI Press 252 262
    • (2008) KR , pp. 252-262
    • Glimm, B.1    Horrocks, I.2    Sattler, U.3
  • 27
    • 4344615591 scopus 로고    scopus 로고
    • From SHIQ and RDF to OWL: The making of a Web Ontology Language
    • DOI 10.1016/j.websem.2003.07.001
    • I. Horrocks, P.F. Patel-Schneider, and F. van Harmelen From SHIQ and RDF to OWL: the making of a web ontology language J. Web Sem. 1 1 2003 7 26 (Pubitemid 44914724)
    • (2003) Web Semantics , vol.1 , Issue.1 , pp. 7-26
    • Horrocks, I.1    Patel-Schneider, P.F.2    Van Harmelen, F.3
  • 30
    • 34548304051 scopus 로고    scopus 로고
    • Reasoning in description logics by a reduction to disjunctive datalog
    • DOI 10.1007/s10817-007-9080-3, Special Issue on Reasoning in Description Logics
    • U. Hustadt, B. Motik, and U. Sattler Reasoning in description logics by a reduction to disjunctive datalog J. Automat. Reason. 39 2007 351 384 10.1007/s10817-007-9080-3 (Pubitemid 47340921)
    • (2007) Journal of Automated Reasoning , vol.39 , Issue.3 , pp. 351-384
    • Hustadt, U.1    Motik, B.2    Sattler, U.3
  • 31
    • 33747864496 scopus 로고    scopus 로고
    • An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
    • DOI 10.1016/j.dam.2006.04.012, PII S0166218X06001910
    • L. Khachiyan, E. Boros, K. Elbassioni, and V. Gurvich An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation Discrete Appl. Math. 154 16 2006 2350 2372 (Pubitemid 44287113)
    • (2006) Discrete Applied Mathematics , vol.154 , Issue.16 , pp. 2350-2372
    • Khachiyan, L.1    Boros, E.2    Elbassioni, K.3    Gurvich, V.4
  • 32
    • 49949104444 scopus 로고    scopus 로고
    • Conjunctive queries for a tractable fragment of OWL 1.1
    • K. Aberer, Lecture Notes in Comput. Sci. Springer
    • M. Krötzsch, S. Rudolph, and P. Hitzler Conjunctive queries for a tractable fragment of OWL 1.1 K. Aberer, ISWC/ASWC Lecture Notes in Comput. Sci. vol. 4825 2007 Springer 310 323
    • (2007) ISWC/ASWC , vol.4825 , pp. 310-323
    • Krötzsch, M.1    Rudolph, S.2    Hitzler, P.3
  • 34
    • 0032156942 scopus 로고    scopus 로고
    • Combining Horn rules and description logics in CARIN
    • PII S0004370298000484
    • A.Y. Levy, and M.-C. Rousset Combining Horn rules and description logics in CARIN Artificial Intelligence 104 1-2 1998 165 209 (Pubitemid 128400989)
    • (1998) Artificial Intelligence , vol.104 , Issue.1-2 , pp. 165-209
    • Levy, A.Y.1    Rousset, M.-C.2
  • 38
    • 20144384411 scopus 로고    scopus 로고
    • The complexity of finite model reasoning in description logics
    • DOI 10.1016/j.ic.2004.11.002, PII S0890540104001828, 19th International Conference on Automated Deduction (CADE-19)
    • C. Lutz, U. Sattler, and L. Tendera The complexity of finite model reasoning in description logics Inform. and Comput. 199 1-2 2005 132 171 (Pubitemid 40773677)
    • (2005) Information and Computation , vol.199 , Issue.1-2 , pp. 132-171
    • Lutz, C.1    Sattler, U.2    Tendera, L.3
  • 41
    • 38149066682 scopus 로고    scopus 로고
    • Complexity of planning in action formalisms based on description logics
    • N. Dershowitz, A. Voronkov, Lecture Notes in Comput. Sci. Springer
    • M. Milicic Complexity of planning in action formalisms based on description logics N. Dershowitz, A. Voronkov, LPAR Lecture Notes in Comput. Sci. vol. 4790 2007 Springer 408 422
    • (2007) LPAR , vol.4790 , pp. 408-422
    • Milicic, M.1
  • 42
    • 0002590832 scopus 로고
    • DSc. thesis, Mathematical Institute of The Hungarian Academy of Sciences, Budapest
    • I. Németi, Free algebras and decidability in algebraic logic, DSc. thesis, Mathematical Institute of The Hungarian Academy of Sciences, Budapest, 1986.
    • (1986) Free Algebras and Decidability in Algebraic Logic
    • Németi, I.1
  • 43
    • 33750700796 scopus 로고    scopus 로고
    • Characterizing data complexity for conjunctive query answering in expressive description logics
    • Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06
    • M. Ortiz, D. Calvanese, and T. Eiter Characterizing data complexity for conjunctive query answering in expressive description logics AAAI 2006 AAAI Press 275 280 (Pubitemid 44705297)
    • (2006) Proceedings of the National Conference on Artificial Intelligence , vol.1 , pp. 275-280
    • Ortiz, M.1    Calvanese, D.2    Eiter, T.3
  • 44
    • 47149087499 scopus 로고    scopus 로고
    • Data complexity of query answering in expressive description logics via tableaux
    • M. Ortiz, D. Calvanese, and T. Eiter Data complexity of query answering in expressive description logics via tableaux J. Automat. Reason. 41 1 2008 61 98
    • (2008) J. Automat. Reason. , vol.41 , Issue.1 , pp. 61-98
    • Ortiz, M.1    Calvanese, D.2    Eiter, T.3
  • 46
    • 57749201800 scopus 로고    scopus 로고
    • Worst-case optimal conjunctive query answering for an expressive description logic without inverses
    • M. Ortiz, M. Šimkus, T. Eiter, Worst-case optimal conjunctive query answering for an expressive description logic without inverses, in: Fox and Gomes [22], pp. 504-510.
    • Fox and Gomes , Issue.22 , pp. 504-510
    • M. Ortiz1
  • 52
    • 81955162461 scopus 로고    scopus 로고
    • Building scalable semantic peer-to-peer data management systems: The somewhere approach
    • M.-C. Rousset, Building scalable semantic peer-to-peer data management systems: The somewhere approach, in: Mexican International Conference on Computer Science, vol. 0, 2007, p. xvii.
    • (2007) Mexican International Conference on Computer Science , vol.0
    • Rousset, M.-C.1
  • 53
    • 57349089749 scopus 로고    scopus 로고
    • Terminological reasoning in SHIQ with ordered binary decision diagrams
    • S. Rudolph, M. Krötzsch, P. Hitzler, Terminological reasoning in SHIQ with ordered binary decision diagrams, in: Fox and Gomes [22], pp. 529-534.
    • Fox and Gomes , Issue.22 , pp. 529-534
    • S. Rudolph1


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