Weight-based consistent query answering over inconsistent knowledge bases

ISCAS OpenIR

	Weight-based consistent query answering over inconsistent knowledge bases
	Du, Jianfeng; Qi, Guilin; Shen, Yi-Dong
	2013
发表期刊	KNOWLEDGE AND INFORMATION SYSTEMS
ISSN	0219-1377
卷号	34 期号:2 页码:335-371
摘要	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
关键词	Semantic Web Description Logics Query Answering Inconsistency-tolerant Reasoning Weight-based Semantics
部门归属	[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.
语种	英语
WOS记录号	WOS:000313714100004
引用统计
内容类型	期刊论文
URI标识	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.