@inproceedings{306b3147e29d47af9660e96f62378c1b,
title = "Refined approximation of concepts in ontology",
abstract = "Finding approximations of concepts in other ontologies is the key problem in approximate query rewriting, an approach of querying in heterogeneous ontologies. The data-driven method suffers from the extremely overlarge expressions of approximations. The paper defines multielement least upper bounds and multielement greatest lower bounds of concept to get refined approximations. They are proved having the same answer sets as the approximations from data-driven method, but are in simplified expressions. The effective algorithms to find the multielement bounds are also provided.",
author = "Dazhou Kang and Baowen Xu and Jianjiang Lu and Yanhui Li and Peng Wang",
year = "2005",
doi = "10.1007/11558590\_9",
language = "English",
isbn = "3540290419",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "82--85",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
note = "9th Congress of the Italian Association for Artificial Intelligence - AI/IA 2005: Advances in Artificial Intelligence ; Conference date: 21-09-2005 Through 23-09-2005",
}