Skip to main content

Association nets: An alternative formalization of common thinking

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1234))

Included in the following conference series:

  • 111 Accesses

Abstract

The development of programming as well as some studies in artificial intelligence have produced their own conceptualizations used in the representation of tasks being solved and methods applied. This paper is an attempt at logic-like representation of a programming system, based on the open data model and object-oriented programming, earlier developed and extensively used by the author for various tasks including authomatic programming and natural language understanding. This is suggested as an alternative to traditional logic systems in description of common thinking.

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. Cejtin, G.S.: Programmirovanie na associativnyq setjaq. In EhVM v proektirovanii i proizvodstve, vyp. 2, pod red. G.V.Orlovskogo, 16–48. “Mashinostroenie”, Leningr. otdelenie, Leningrad, 1985 (G.S.Tseytin. Programming with association nets. English version at http://gamma.niimm. spb.su/~tseytin/netslong.html)

    Google Scholar 

  2. Zheleznjakov, M.M., Nevleva, T.N., Novickaja, I.M., Smirnova, L.N., Cejtin, G.S.: Opyt postroenija modeli “tekst ⇉ dejstviteljnostj” s ispoljzovaniem associativnyq setej. In Mashinnyj fond russkogo jazyka: predproektnye issledovanija, 140–167. Institut russkogo jazyka, Moskva, 1988 (M.M.Zheleznyakov, T.N.Nevleva, I.M.Novitskaya, L.N.Smirnova, G.S.Tseytin. An attempt of building a “text ⇉ reality” model using association nets. English version at http://gamma.niimm.spb.su/~tseytin/article.html)

    Google Scholar 

  3. Tseytin, G.S.: On some mechanisms of representation of meaning in natural languages. The Prague Bulletin of Mathematical Linguistics, 65–66 (1996) 5–12 (See also at http://gamma.niimm.spb.su/~tseytin/mytalke.html)

    Google Scholar 

  4. Tseytin, G.S.: From Logicism to Proceduralism (an autobiographical account). In Algorithms in Modern Mathematics and Computer Science, Lecture Notes in Computer Science, 122 (1981) 390–396

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Sergei Adian Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tseytin, G.S. (1997). Association nets: An alternative formalization of common thinking. In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-63045-7_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63045-6

  • Online ISBN: 978-3-540-69065-8

  • eBook Packages: Springer Book Archive

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