Query Answering in the Description Logic S.
Description Logics(2010)
摘要
We consider the complexity of answering conjunctive querie s in the description logic S, i.e., inALC extended with transitive roles. While a co-NE XPTIME lower bound was recently established in [4], the best known upper bound was 2-E XPTIME. In this paper, we concentrate on the case where only a single transitive role (and no other r ol ) is present and establish a tight co-NEXPTIME upper bound. 1Fachbereich Informatik,Universität Bremen, Germany. Email: meghyn@informatik.uni-bremen.de. 2Institute of Information Systems, Vienna University of Tec hnology, Austria. E-mail: eiter@kr.tuwien.ac.at. 3Fachbereich Informatik,Universität Bremen, Germany. Email: clu@informatik.uni-bremen.de. 4Institute of Information Systems, Vienna University of Tec hnology. E-mail: ortiz@kr.tuwien.ac.at. 5Institute of Information Systems, Vienna University of Tec hnology. E-mail: simkus@kr.tuwien.ac.at. Copyright c © 2010 by the authors 2 INFSYS RR 1843-10-01
更多查看译文
关键词
upper bound,description logic,conjunctive queries,lower bound
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络