Institutional Repository
| Weight-based consistent query answering over inconsistent knowledge bases | |
| Du, Jianfeng; Qi, Guilin; Shen, Yi-Dong | |
| 2013 | |
| Source | KNOWLEDGE AND INFORMATION SYSTEMS
![]() |
| ISSN | 0219-1377 |
| Volume | 34Issue:2Pages:335-371 |
| English Abstract | 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. |
| Indexed Type | SCI |
| Keyword | Semantic Web Description Logics Query Answering Inconsistency-tolerant Reasoning Weight-based Semantics |
| Department | [Du, Jianfeng] Guangdong Univ Foreign Studies, Guangzhou 510006, Guangdong, Peoples R China. [Du, Jianfeng; Shen, Yi-Dong] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China. [Qi, Guilin] Southeast Univ, Sch Comp Sci & Engn, Nanjing 211189, Jiangsu, Peoples R China. [Qi, Guilin] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing 210008, Jiangsu, Peoples R China. |
| Language | 英语 |
| WOS ID | WOS:000313714100004 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16949 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment