The formalization of lists in the meta-language of normal forms of knowledge
DOI:
https://doi.org/10.15407/dopovidi2017.10.018Keywords:
definition, list, meta-language of normal forms of knowledge, predicate, recursionAbstract
The formalization of list-based predicates in the meta-language of normal forms of knowledge is presented for the first time, based on the known descriptions of these concepts in Prolog, which use a list-domain. Among the predica tes described are the following: adding an element to the list, removing an element, removing duplicates, checking if an element is in a list, finding the last element of a list, finding adjacent elements in a list, concatenation of lists, re versing a list, etc.
Downloads
References
Abelson, H., Sussman, G. J. & Sussman, J. (1996). Structure and interpretation of computer programs. Cambridge: MIT Press.
Haskell 98. (2003). Language and Libraries. The Revised Report. Ed. S.P. Jones. Cambridge Academ.
Seibel, Peter. (2005). Practical Common Lisp. Apress. https://doi.org/10.1007/978-1-4302-0017-8
Bratko, Ivan. (2012). Prolog Programming for Artificial Intelligence. Third Edition. Addison-Wesley.
Adamenko, A. N. & Kuchukov, A. M. (2003). Logical Programming and Visual Prolog. St. Petersburg: BHVPetersburg (in Russian).
Clocksin, William., Mellish & Christopher, S. (2003). Programming in Prolog: Using the ISO Standard 5th Edition. Berlin etc.: Springer. https://doi.org/10.1007/978-3-642-55481-0
Kurgaev, A. & Grygoryev, S. (2015). The normal forms of knowledge. Dopov. Nac. acad. nauk Ukr. No. 11, pp. 36-43 (in Russian).
Kurgaev, A. & Grygoryev, S. (2016). Metalanguage of Normal Forms of Knowledge. Cybernetics and Systems Analysis. 52(6), pp. 839-848. https://doi.org/10.1007/s10559-016-9885-3
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Reports of the National Academy of Sciences of Ukraine
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
