Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Analyzing Natural-Language Knowledge Under Uncertainty on the Basis of Description Logics

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The article overviews the means for describing and formally analyzing natural-language text knowledge under uncertainty. We consider a family of classic attribute languages and logics based on them, their properties, problems, and solution tools. We also overview propositional n-valued logics and fuzzy logics, their syntax and semantics. Based on the considered logical constructions, we propose syntax and set-theoretic interpretation of n-valued description logic ALCQn that provides the means for describing concept intersection, union, complement, value restrictions, and qualitative and quantitative constraints. We consider the means for solving key problems of reasoning over such logics: executability, augmentation, equivalence, and disjunctivity. As an algorithm for calculating the executability degree, we consider an extension of the tableau algorithm often used for first-order logic with solving simple numerical constraints. We prove that the algorithm is terminal, complete, and non-contradictory. We also provide several applications for the formal representation in natural language processing, including extending results of machine learning models, combining knowledge from multiple sources and formally describing uncertain facts.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. J. Bos, “Applying automated deduction to natural language understanding,” J. Appl. Logic, Vol. 7, No. 1, 100–112 (2009). https://doi.org/https://doi.org/10.1016/j.jal.2007.07.008.

    Article  Google Scholar 

  2. G. Licata, “Fuzzy logic, knowledge and natural language,” in: M. F. Azeem (ed.), Fuzzy Inference System — Theory and Applications, IntechOpen (2012), pp. 3–18. https://doi.org/10.5772/36498.

  3. M. Joshi, D. Chen, Y. Liu, D. S. Weld, L. Zettlemoyer, and O. Levy, “SpanBERT: Improving pre-training by representing and predicting spans,” Trans. of the Assoc. for Comput. Linguistics, Vol. 8, 64–77 (2020). URL: https://transacl.org/index.php/tacl/article/view/1853.

  4. E. Cambria and B. White, “Jumping NLP curves: A review of natural language processing research,” IEEE Comput. Intelligence Magazine, Vol. 9, Iss. 2, 48–57 (2014). https://doi.org/10.1109/MCI.2014.2307227.

  5. S. Kryvyi and H. Hoherchak, “Analyzing natural language knowledge in uncertainty,” in: Proc. 2022 IEEE Intern. Conf. on Advanced Trends in Information Theory (ATIT 2022) (15–17 December 2022, Kyiv, Ukraine), Kyiv (2022), pp. 268–272.

  6. H. Hoherchak, N. Darchuk, and S. Kryvyi, “Representation, analysis, and extraction of knowledge from unstructured natural language texts,” Cybern. Syst. Analysis, Vol. 57, No. 3, 481–500 (2021). https://doi.org/https://doi.org/10.1007/s10559-021-00373-7.

    Article  MathSciNet  Google Scholar 

  7. H. Hoherchak, “Knowledge based and description logics applications to natural language texts analysis,” in: Proc. 12th Intern. Sci. and Pract. Conf. of Programming (UkrPROG 2020) (15–16 September 2020, Kyiv, Ukraine), Kyiv (2020), pp. 259–269. URL: https://ceur-ws.org/Vol-2866/ceur_260-269hoherchak.pdf.

  8. F. Baader, I. Horrocks, C. Latz, and U. Sattler, An Introduction in Description Logic, Cambridge Univ. Press (2017). https://doi.org/https://doi.org/10.1017/9781139025355.

    Article  Google Scholar 

  9. M. Wajsberg, “Axiomatization of the three-valued propositional calculus,” in: S. McCall (ed.), Polish Logic: 1920–1939, Oxford Univ. Press, New York (1967), pp. 264–284.

    Google Scholar 

  10. S. Aguzzoli and A. Ciabattoni, “Finitness in infinite-valued Łukasiewich logic,” J. of Logic, Language and Information, Vol. 9, Iss. 1, 5–29 (2000). https://doi.org/10.1023/A:1008311022292.

  11. J. Zhan and H. Zhao, “Span model for open information extraction on accurate corpus,” in: Proc. 34th AAAI Conf. on Artificial Intelligence (AAAI-20) (7–12 February 2020, New York, USA), Vol. 34, No. 5, New York (2020), pp. 9523–9530. https://doi.org/10.1609/aaai.v34i05.6497.

  12. S. Pogorilyy and A. Kramov, “Coreference resolution method using a convolutional neural network,” in: Proc. 2019 IEEE Intern. Conf. on Advanced Trends in Information Theory (ATIT 2019) (18–20 December 2019, Kyiv, Ukraine), Kyiv (2019), pp. 397–401. https://doi.org/10.1109/ATIT49449.2019.9030596.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Kryvyi.

Additional information

Translated from Kibernetyka ta Systemnyi Analiz, No. 1, January–February, 2024, pp. 32–47; https://doi.org/10.34229/KCA2522-9664.24.1.3

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kryvyi, S., Hoherchak, H. Analyzing Natural-Language Knowledge Under Uncertainty on the Basis of Description Logics. Cybern Syst Anal 60, 24–38 (2024). https://doi.org/10.1007/s10559-024-00643-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-024-00643-0

Keywords