Institutional Repository
| a new matchmaking approach based on abductive conjunctive query answering | |
| Du Jianfeng; Wang Shuai; Qi Guilin; Pan Jeff Z.; Hu Yong | |
| 2012 | |
| Conference Name | Joint International Semantic Technology Conference, JIST 2011 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 144-159 |
| Conference Date | December 4, 2011 - December 7, 2011 |
| Conference Place | Hangzhou, China |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642299223 |
| Department | (1) Guangdong University of Foreign Studies Guangzhou 510006 China; (2) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China; (3) Southeast University Nanjing 211189 China; (4) University of Aberdeen Aberdeen AB243UE United Kingdom |
| English Abstract | To perform matchmaking in Web-based scenarios where data are often incomplete, we propose an extended conjunctive query answering (CQA) problem, called abductive CQA problem, in Description Logic ontologies. Given a consistent ontology and a conjunctive query, the abductive CQA problem computes all abductive answers to the query in the ontology. An abductive answer is an answer to the query in some consistent ontology enlarged from the given one by adding a bounded number of individual assertions, where the individual assertions that can be added are confined by user-specified concept or role names. We also propose a new approach to matchmaking based on the abductive CQA semantics, in which offer information is expressed as individual assertions, request information is expressed as conjunctive queries, and matches for a request are defined as abductive answers to a conjunctive query that expresses the request. We propose a sound and complete method for computing all abductive answers to a conjunctive query in an ontology expressed in the Description Logic Program fragment of OWL 2 DL with the Unique Name Assumption. The feasibility of this method is demonstrated by a real-life application, rental matchmaking, which handles requests for renting houses. © 2012 Springer-Verlag.; To perform matchmaking in Web-based scenarios where data are often incomplete, we propose an extended conjunctive query answering (CQA) problem, called abductive CQA problem, in Description Logic ontologies. Given a consistent ontology and a conjunctive query, the abductive CQA problem computes all abductive answers to the query in the ontology. An abductive answer is an answer to the query in some consistent ontology enlarged from the given one by adding a bounded number of individual assertions, where the individual assertions that can be added are confined by user-specified concept or role names. We also propose a new approach to matchmaking based on the abductive CQA semantics, in which offer information is expressed as individual assertions, request information is expressed as conjunctive queries, and matches for a request are defined as abductive answers to a conjunctive query that expresses the request. We propose a sound and complete method for computing all abductive answers to a conjunctive query in an ontology expressed in the Description Logic Program fragment of OWL 2 DL with the Unique Name Assumption. The feasibility of this method is demonstrated by a real-life application, rental matchmaking, which handles requests for renting houses. © 2012 Springer-Verlag. |
| Keyword | Data Description Formal Languages Logic Programming Query Processing Semantic Web |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15684 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Du Jianfeng,Wang Shuai,Qi Guilin,et al. a new matchmaking approach based on abductive conjunctive query answering[C],2012:144-159. |
| 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