Skip to main content

Combining Revision Production Rules and Description Logics

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2003)

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

Abstract

Knowledges of every application area are heterogeneous and they develop in time. Therefore, a combination of several formalisms on which revision operations are defined, is required for knowledge representation of such a hybrid system. In this paper, we will introduce several revision policies in DL-based knowledge bases and show how revision operators are computed for DL language \(\mathcal{ALE}\). From this, we define revision production rules consequent of which is a revision operator. Such rules allow us to represent context rules in translation between DL-based ontologies. Finally, we will introduce formal semantics of the formalism combining revision production rules and Description Logics (\(\mathcal{ALE}\)).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Nebel, B.: Reasoning and Revision in Hybrid Representation Systems, Thesis (1990-1995)

    Google Scholar 

  2. Nebel, B.: Terminological reasoning is inherently intractable. Artificial Intelligence (1990)

    Google Scholar 

  3. Schmidt-Schauβ, M., Smolka, G.: Attributive concept descriptions with complements. Artificial Intelligence (1991)

    Google Scholar 

  4. Levy, A.Y., Rousset, M.C.: Combining Horn Rules and Description Logics in CARIN. Artificial Intelligence 104 (1998)

    Google Scholar 

  5. Donini, F.M., Lenzerini, M., Nardi, D., Nutt, W., Schaerf, A.: An Epistemic Operator for Description Logics. Artificial Intelligence 100 (1998)

    Google Scholar 

  6. Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: Reasoning in Description Logics. CSLI Publications, Stanford (1997)

    Google Scholar 

  7. Küsters, R.: Non-Standard Inferences in Description Logics. Thesis. Springer, Heidelberg (2001)

    Book  Google Scholar 

  8. Baader, F., Küsters, R., Molitor, R.: Computing least common subsumer in Description Logics with existential restrictions. In: Proc. of the 16th Int. Joint Conf. on Artificial Intelligence IJCAI 1999 (1999)

    Google Scholar 

  9. Le Duc, C., Le Thanh, N.: Combining Revision Production Rules and Description Logics. Technical Report (2003), See http://www.i3s.unice.fr/~cleduc

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Le Duc, C., Le Thanh, N. (2003). Combining Revision Production Rules and Description Logics. In: Palade, V., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2003. Lecture Notes in Computer Science(), vol 2773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45224-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45224-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40803-1

  • Online ISBN: 978-3-540-45224-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics