Abstract
The paper considers the problem of representing conceptual dependencies in the domain description code with the support of their semantic integrity. It deals with the mechanisms for maintaining integrity in the course of computations in the conceptual model in two processes: (1) reduction with the provision of a given reduction strategy and (2) serialization of dependencies to provide for the transfer of dependence between various environments of computations. The paper compares the selected mechanisms and mechanisms of supporting systems of programming languages. The shortcomings of their computing systems arising from the lack of built-in mechanisms of sufficient power are analyzed. The paper considers the possibility of overcoming the existing problems. The approach to the extension of practical computing systems by the proposed possibilities (JavaScript language as an example) is investigated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Klimov VV, Chernyshov AA, Balandina AI, Kostkina AD (2017) Problems of teaching students to use the featured technologies in the area of semantic web. AIP Conf Proc 1797:030008
Ismailova LY, Wolfengagen VE, Kosikov SV (2018) Basic constructions of the computational model of support for access operations to the semantic network. Procedia Comput Sci 123:183–188
Sleptsov IO, Kosikov SV (2016) Potentially infinite lists: tools for processing the ordered structures. Practical use. In: Proceedings of the international conference “Situation centers and class 4i information and analytical systems for monitoring and security problems” SCVRT2015-2016, Pushchino, TsarGrad, pp 123–128
Expression trees (C#). https://docs.microsoft.com/en-us/dotnet/csharp/programming-guide/concepts/expression-trees/index. Accessed 14 Nov 2018
Standard ECMA-262. https://www.ecma-international.org/publications/standards/Ecma-262.htm. Accessed 14 Nov 2018
Bash Reference Manual. http://www.gnu.org/software/bash/manual/bashref.html. Accessed 14 Nov 2018
Jones SP, Hughes J, Augustsson L, et al. (1999) Report on the programming language Haskell 98. A Non-strict, Purely Functional Language
Serializable Closures in PLT Scheme. https://blog.racket-lang.org/2009/06/serializable-closures-in-plt-scheme.html. Accessed 14 Nov 2018
Wolfram language for high-tech programming. https://www.wolfram.com/language/. Accessed 14 Nov 2018
Acknowledgements
The paper is supported by the grants 19-07-00326-a, 19-07-00420-a, 18-07-01082-a, and 17-07-00893-a of the Russian Foundation for Basic Research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Slieptsov, I.O., Ismailova, L.Y., Kosikov, S.V. (2020). Representation of Conceptual Dependencies in the Domain Description Code. In: Samsonovich, A. (eds) Biologically Inspired Cognitive Architectures 2019. BICA 2019. Advances in Intelligent Systems and Computing, vol 948. Springer, Cham. https://doi.org/10.1007/978-3-030-25719-4_65
Download citation
DOI: https://doi.org/10.1007/978-3-030-25719-4_65
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25718-7
Online ISBN: 978-3-030-25719-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)