Skip to main content

\(\mathcal{ALE}\) Defeasible Description Logic

  • Conference paper
AI 2006: Advances in Artificial Intelligence (AI 2006)

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

Included in the following conference series:

  • 3693 Accesses

Abstract

One of Semantic Web strengths is the ability to address incomplete knowledge. However, at present, it cannot handle incomplete knowledge directly. Also, it cannot handle non-monotonic reasoning. In this paper, we extend \(\mathcal{ALC^{-}}\) Defeasible Description Logic with existential quantifier, i.e., \(\mathcal{ALE}\) Defeasible Description Logic. Also, we modify some parts of the logic, resulting in an increasing efficiency in its reasoning.

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. Antoniou, G., Billington, D., Governatori, G., Maher, M.: Representation Results for Defeasible Logic. ACM Transactions on Computational Logic 2(2), 255–287 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Billington, D.: Defeasible Logic is Stable. Journal of Logic and Computation 3, 370–400 (1993)

    Article  MathSciNet  Google Scholar 

  3. Governatori, G.: Defeasible Description Logics. In: Antoniou, G., Boley, H. (eds.) RuleML 2004. LNCS, vol. 3323, pp. 98–112. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Maher, M.J.: Propositional Defeasible Logic has Linear Complexity. Theory and Practice of Logic Programming 1(6), 691–711 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Maher, M.J., Rock, A., Antoniou, G., Billignton, D., Miller, T.: Efficient Defeasible Reasoning Systems. International Journal of Artificial Intelligence Tools 10(4), 483–501 (2001)

    Article  Google Scholar 

  6. Nute, D.: Defeasible Logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 353–395. Oxford University Press, Oxford (1987)

    Google Scholar 

  7. Pothipruk, P., Governatori, G.: A Formal Ontology Reasoning with Individual Optimization: A Realization of the Semantic Web. In: Ngu, A.H.H., Kitsuregawa, M., Neuhold, E.J., Chung, J.-Y., Sheng, Q.Z. (eds.) WISE 2005. LNCS, vol. 3806, pp. 119–132. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pothipruk, P., Governatori, G. (2006). \(\mathcal{ALE}\) Defeasible Description Logic. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_15

Download citation

  • DOI: https://doi.org/10.1007/11941439_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49787-5

  • Online ISBN: 978-3-540-49788-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy