Language Representation and Knowledge Based Reasoning

  • A. O. Tarakanov
  • V. A. Skormin
  • S. P. Sokolova

Abstract

From the algebraic point of view, any language represents some subset of words of a free monoid (Lalleman, 1979). Formally, the main problems of language representation and knowledge-based reasoning can be reduced to the limitations on a free monoid, and to those that also allow such words and sentences to be recognized (Salomaa, 1981). By their nature, at least, these problems are similar to those of representation and recognition of self and nonself by the natural immune system. This chapter will show that the analogy is actually much more profound, and that it leads to developing an IC approach to language representation and knowledge-based reasoning.

Keywords

Language Representation Free Monoid Complete Matrix Peptide Spectrum Natural Immune System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • A. O. Tarakanov
    • 1
  • V. A. Skormin
    • 2
  • S. P. Sokolova
    • 1
  1. 1.St. Petersburg Institute for InformaticsRussian Academy of SciencesSt. PetersburgRussia
  2. 2.Watson SchoolBinghamton UniversityBinghamtonUSA

Personalised recommendations