Weight-based consistent query answering over inconsistent knowledge bases
文献类型：期刊论文
| 作者 | Du, Jianfeng ; Qi, Guilin ; Shen, Yi-Dong |
| 刊名 | KNOWLEDGE AND INFORMATION SYSTEMS
 |
| 出版日期 | 2013 |
| 卷号 | 34期号:2页码:335-371 |
| 关键词 | Semantic Web Description logics Query answering Inconsistency-tolerant reasoning Weight-based semantics |
| ISSN号 | 0219-1377 |
| 中文摘要 | Non-standard query mechanisms that work under inconsistency are required in some important description logic (DL)-based applications, including those involving an inconsistent DL knowledge base ( KB) whose intensional knowledge is consistent but is violated by its extensional knowledge. This paper proposes a weight-based semantics for querying such an inconsistent KB. This semantics defines an answer of a conjunctive query posed upon an inconsistent KB as a tuple of individuals whose substitution for the variables in the query head makes the query body entailed by any subbase of the KB consisting of the intensional knowledge and a weight-maximally consistent subset of the extensional knowledge. A novel computational method for this semantics is proposed, which works for extensionally reduced KBs and conjunctive queries without non-distinguished variables. The method first compiles the given KB to a propositional program; then, for any given conjunctive query, it reduces the problem of computing all answers of the given query to a set of propositional satisfiability (SAT) problems with PB-constraints, which are then solved by SAT solvers. A decomposition-based framework for optimizing the method is also proposed. The feasibility of this method is demonstrated in our experiments. |
| 英文摘要 | Non-standard query mechanisms that work under inconsistency are required in some important description logic (DL)-based applications, including those involving an inconsistent DL knowledge base ( KB) whose intensional knowledge is consistent but is violated by its extensional knowledge. This paper proposes a weight-based semantics for querying such an inconsistent KB. This semantics defines an answer of a conjunctive query posed upon an inconsistent KB as a tuple of individuals whose substitution for the variables in the query head makes the query body entailed by any subbase of the KB consisting of the intensional knowledge and a weight-maximally consistent subset of the extensional knowledge. A novel computational method for this semantics is proposed, which works for extensionally reduced KBs and conjunctive queries without non-distinguished variables. The method first compiles the given KB to a propositional program; then, for any given conjunctive query, it reduces the problem of computing all answers of the given query to a set of propositional satisfiability (SAT) problems with PB-constraints, which are then solved by SAT solvers. A decomposition-based framework for optimizing the method is also proposed. The feasibility of this method is demonstrated in our experiments. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000313714100004 |
| 公开日期 | 2014-12-16 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16949]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Du, Jianfeng,Qi, Guilin,Shen, Yi-Dong. Weight-based consistent query answering over inconsistent knowledge bases[J]. KNOWLEDGE AND INFORMATION SYSTEMS,2013,34(2):335-371. |
| APA | Du, Jianfeng,Qi, Guilin,&Shen, Yi-Dong.(2013).Weight-based consistent query answering over inconsistent knowledge bases.KNOWLEDGE AND INFORMATION SYSTEMS,34(2),335-371. |
| MLA | Du, Jianfeng,et al."Weight-based consistent query answering over inconsistent knowledge bases".KNOWLEDGE AND INFORMATION SYSTEMS 34.2(2013):335-371. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。