Skip to main content

Refined Approximation of Concepts in Ontology

  • Conference paper
AI*IA 2005: Advances in Artificial Intelligence (AI*IA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3673))

Included in the following conference series:

  • 719 Accesses

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.

This work was supported in part by the NSFC (60373066, 60425206, 90412003, 60403016), National Grand Fundamental Research 973 Program of China (2002CB312000), National Research Foundation for the Doctoral Program of Higher Education of China (20020286004), Advanced Armament Research Project(51406020105JB8103).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Shah, U., Finin, T., Joshi, A., Cost, R.S., Mayfield, J.: Information Retrieval on the Semantic Web. In: The 10th International Conference on Information and Knowledge Management, pp. 461–468. ACM Press, McLean (2002)

    Google Scholar 

  2. Tzitzikas, Y.: Collaborative Ontology-based Information Indexing and Retrieval. Doctoral Dissertation, Heraklion (2002)

    Google Scholar 

  3. Chang, C., Garcia-Molina, H.: Approximate query mapping: Accounting for translation closeness. The VLDB Journal 10(2-3), 155–181 (2001)

    MATH  Google Scholar 

  4. Stuckenschmidt, H.: Ontology-Based Information Sharing in Weakly Structured Environments. PhD thesis, AI Department, Vrije Universiteit Amsterdam (2002)

    Google Scholar 

  5. Goasdoué, F., Rousset, M.C.: Answering Queries using Views: a KRDB Perspective for the Semantic Web. ACM Transactions on Internet Technology 4(3), 255–288 (2004)

    Article  Google Scholar 

  6. Galton, A.: Logic for Information Technology. John Wiley & Sons, Chichester (1990)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kang, D., Xu, B., Lu, J., Li, Y., Wang, P. (2005). Refined Approximation of Concepts in Ontology. In: Bandini, S., Manzoni, S. (eds) AI*IA 2005: Advances in Artificial Intelligence. AI*IA 2005. Lecture Notes in Computer Science(), vol 3673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558590_9

Download citation

  • DOI: https://doi.org/10.1007/11558590_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29041-4

  • Online ISBN: 978-3-540-31733-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics