Paraconsistent Query Answering Over DL-Lite Ontologies
Consistent query answering over description logic-based ontologies is an important topic in ontology engineering as it can provide meaningful answers to queries posed over inconsistent ontologies.Current approaches for dealing with this problem usually consist of two steps: the first step is extracting some consistent sub-ontologies of an inconsistent ontology, then posing the query over these sub-ontologies.In this paper,we propose an alternative approach for consistent query answering over DL-Lite ontologies based on four-valued semantics,where DL-Lite is a family of tractable DLs.We give an algorithm to compute answers to a query over inconsistent DL-Lite ontologies and show that it is tractable.In particular,it is PTime in the size of TBox, and LOGSPACE in the size of ABox.
Liping Zhou Houkuan Huang Yue Ma Guilin Qi Zhisheng Huang Youli Qu
Beijing Jiaotong University,Beijing,China LIPN,Université Paris-Nord,France AIFB,Universit(a)t Karlsruhe,Germany Department of Computer Science,Vrije Universiteit Amsterdam,The Netherlands
国际会议
南京
英文
1-12
2009-08-29（万方平台首次上网日期，不代表论文的发表时间）