Refined approximation of concepts in ontology

Dazhou Kang, Baowen Xu, Jianjiang Lu, Yanhui Li, Peng Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages82-85
Number of pages4
DOIs
StatePublished - 2005
Event9th Congress of the Italian Association for Artificial Intelligence - AI/IA 2005: Advances in Artificial Intelligence - Milan, Italy
Duration: 21 Sep 200523 Sep 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3673 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th Congress of the Italian Association for Artificial Intelligence - AI/IA 2005: Advances in Artificial Intelligence
Country/TerritoryItaly
CityMilan
Period21/09/0523/09/05

Fingerprint

Dive into the research topics of 'Refined approximation of concepts in ontology'. Together they form a unique fingerprint.

Cite this