Skip to main content
SpringerLink
Log in

Paraconsistent Semantics for Description Logics: A Comparison

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

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

Abstract

It is shown that four existing paraconsistent semantics (i.e., four-valued semantics, quasi-classical semantics, single-interpretation semantics and dual-interpretation semantics) for description logics are essentially the same semantics. To show this, two generalized and extended new semantics are introduced, and an equivalence between them is proved.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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. Almukdad, A., Nelson, D.: Constructible falsity and inexact predicates. Journal of Symbolic Logic 49, 231–233 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  3. Kamide, N.: Paraconsistent description logics revisited. In: Proceedings of the 23rd International Workshop on Description Logics (DL 2010), CEUR Workshop Proceedings, vol. 573 (2010)

    Google Scholar 

  4. Kamide, N.: An embedding-based completeness proof for Nelson’s paraconsistent logic. Bulletin of the Section of Logic 39(3/4), 205–214 (2010)

    MathSciNet  MATH  Google Scholar 

  5. Kaneiwa, K.: Description logics with contraries, contradictories, and subcontraries. New Generation Computing 25(4), 443–468 (2007)

    Article  MATH  Google Scholar 

  6. Ma, Y., Hitzler, P., Lin, Z.: Algorithms for paraconsistent reasoning with OWL. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 399–413. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Ma, Y., Hitzler, P., Lin, Z.: Paraconsistent reasoning for expressive and tractable description logics. In: Proceedings of the 21st International Workshop on Description Logic (DL 2008), CEUR Workshop Proceedings, vol. 353 (2008)

    Google Scholar 

  8. Meghini, C., Straccia, U.: A relevance terminological logic for information retrieval. In: Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 197–205 (1996)

    Google Scholar 

  9. Meghini, C., Sebastiani, F., Straccia, U.: Mirlog: A logic for multimedia information retrieval. In: Uncertainty and Logics: Advanced Models for the Representation and Retrieval of Information, pp. 151–185. Kluwer Academic Publishing, Dordrecht (1998)

    Chapter  Google Scholar 

  10. Nelson, D.: Constructible falsity. Journal of Symbolic Logic 14, 16–26 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  11. Odintsov, S.P., Wansing, H.: Inconsistency-tolerant description logic: Motivation and basic systems. In: Hendricks, V.F., Malinowski, J. (eds.) Trends in Logic: 50 Years of Studia Logica, pp. 301–335. Kluwer Academic Publishers, Dordrecht (2003)

    Chapter  Google Scholar 

  12. Odintsov, S.P., Wansing, H.: Inconsistency-tolerant Description Logic. Part II: Tableau Algorithms. Journal of Applied Logic 6, 343–360 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Patel-Schneider, P.F.: A four-valued semantics for terminological logics. Artificial Intelligence 38, 319–351 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. Schmidt-Schauss, M., Smolka, G.: Attributive concept descriptions with complements. Artificial Intelligence 48, 1–26 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  15. Straccia, U.: A sequent calculus for reasoning in four-valued description logics. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol. 1227, pp. 343–357. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  16. Wagner, G.: A database needs two kinds of negations. In: Thalheim, B., Gerhardt, H.-D., Demetrovics, J. (eds.) MFDBS 1991. LNCS, vol. 495, pp. 357–371. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  17. Wansing, H.: The Logic of Information Structures. LNCS (LNAI), vol. 681, pp. 1–163. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  18. Zhang, X., Lin, Z.: Paraconsistent reasoning with quasi-classical semantic in \(\mathcal{ALC}\). In: Calvanese, D., Lausen, G. (eds.) RR 2008. LNCS, vol. 5341, pp. 222–229. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Zhang, X., Qi, G., Ma, Y., Lin, Z.: Quasi-classical semantics for expressive description logics. In: Proceedings of the 22nd International Workshop on Description Logic (DL 2009), CEUR Workshop Proceedings, vol. 477 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Waseda Institute for Advanced Study, Waseda University, 1-6-1 Nishi Waseda, Shinjuku-ku, Tokyo, 169-8050, Japan

    Norihiro Kamide

Authors
  1. Norihiro Kamide
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Integrated Sensor Systems, University of Kaiserslautern, Erwin-Schroedinger-str. 12, 67663, Kaiserslautern, Germany

    Andreas König

  2. Knowledge-Based Systems Group, Department of omputer Science, University of Kaiserslautern, P.O. Box 3049, 67653, Kaiserslautern, Germany

    Andreas Dengel

  3. School of Business, University of Applied Sciences Northwestern Switzerland, Riggenbachstr. 16, 4600, Olten, Switzerland

    Knut Hinkelmann

  4. Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, 599-8531, Sakai, Osaka, Japan

    Koichi Kise

  5. KES International, P.O. Box 2115, BN43 9AF, Shoreham-by-sea, UK

    Robert J. Howlett

  6. University of South Australia, Mawson Lakes, 5095, Adelaide, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamide, N. (2011). Paraconsistent Semantics for Description Logics: A Comparison. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2011. Lecture Notes in Computer Science(), vol 6881. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23851-2_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23851-2_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23850-5

  • Online ISBN: 978-3-642-23851-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation