Modelling of the relation of implication with use of the directed relational networks

Authors

DOI:

https://doi.org/10.15587/1729-4061.2014.30567

Keywords:

theory of intelligence, predicate algebra, algebra-predicate structures, directed relational networks, linear logical operators

Abstract

Models of the directed relational networks of relation of implication that can be used to represent knowledge in intelligent parallel action systems were developed in the paper. A relational network that implements the implication operation was created. The method of binary decomposition of the predicate of the modeled object is used for the relational network construction. The original n-ary predicate is represented as a conjunction of binary predicates. Testing of step-by-step operation of the relational network for all sets of values of object variables in the forward and inverse direction was carried out. An example of the relational network model operation for the relational network arc using a linear logical operator was considered. A method of constructing directed diagrams of the relational network was described. Directed diagrams of the relational network (forward and inverse) were built. Unification of the forward and inverse directed diagrams of relational networks was performed. Directed diagrams of relational networks can be used in creating knowledge bases to make up production rules. Directed diagrams of relational networks can become an important part of parallel knowledge bases and inference.

Author Biography

Виталий Иванович Булкин, Makiivka economic-humanitarian institute Оstrovsky str., 16, Makiivka, Ukraine, 86157

Associate professor

Department of the applied mathematics and information technologies

References

  1. Rosenblatt, F. (1958). The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain. J Psychological Review, 65 (6), 386–408. doi: 10.1037/h0042519
  2. Hopfield, J. J. (1982). Neural Networks and Physical Systems with Emergent Collective Computational Abilities. Proceedings of the National Academy of Science, 79 (8), 2554–2558. doi: 10.1073/pnas.79.8.2554
  3. Lipman, R. (1987). An Introduction to Computing with Neural Nets. IEEE Acoustic Speech and Signal Processing Magazine, 4 (2), 4–22. doi: 10.1109/massp.1987.1165576
  4. Bulkin, V. I., Sharonova, N. V. (2010). Mathematical models of knowledges and their realization by algebrapredicate structures. Publisher Dmitrenko L.R., Donetsk, 304.
  5. Shabanov-Kushnarenko, Y. P. (1984). Theory of intellect. Mathematical facilities. Kharkov, Vischa shk., 144.
  6. Bulkin, V. I. (2012). Presentation of algebra predicate structures as associative-logical transformers. J Artificial intelligence, 3, 6–17.
  7. Stern, R., Felner, A., Berg, J., Puzis, R., Shah, R., Goldberg, K. (2014). Potential-based bounded-cost search and Anytime Non-Parametric. Artificial Intelligence, 214, 1–25. doi: 10.1016/j.artint.2014.05.002
  8. McGreggor, K., Kunda, M., Goel, A. (2014). Fractals and Ravens. Artificial Intelligence, 215, 1–23. doi: 10.1016/j.artint.2014.05.005
  9. Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N. (2014). A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artificial Intelligence Review, 42 (1) 21–57. doi: 10.1007/s10462-012-9328-0
  10. Bunkhumpornpat, C., Sinapiromsaran, K., Lursinsap, C. (2012). DBSMOTE: Density-Based Synthetic Minority Over-sampling. Applied Intelligence, 36 (3), 664–684. doi: 10.1007/s10489-011-0287-y
  11. Sun, G., Zhao, R. (2014). Dynamic partition search algorithm for global numerical optimization. Applied Intelligence, 41 (4), 1108–1126. doi: 10.1007/s10489-014-0587-0
  12. Jain, L. C., Seera, M., Lim, C. P., Balasubramaniam, P. (2014). A review of online learning in supervised neural networks. Neural Computing and Applications, 25 (3–4), 491–509. doi: 10.1007/s00521-013-1534-4
  13. Peteiro-Barral, D., Guijarro-Berdiñas, B. (2013). A survey of methods for distributed machine learning. Progress in Artificial Intelligence, 2 (1), 1–11. doi: 10.1007/s13748-012-0035-5
  14. Charlesworth, A. (2014). The Comprehensibility Theorem and the Foundations of Artificial Intelligence. Minds and Machines, 24 (4), 439–476.
  15. Leschinskiy, V. A. (2006). Models of binary logical networks and their application in artificial intelligence. Kharkov, 160.
  16. Efimova, I. A., Leshhinskij, V. A. (2005). About the method of construction of models of binary logical networks. Eastern-European Journal of Enterprise Technologies, Kharkov, 4, 121–124.
  17. Bondarenko, M. F., Dudar, Z. V., Efimova, I. A., Leshhinskij, V. A., Shabanov-Kushnarenko, S. Ju. (2004). About brainlike computers. Radio electronics and informatics. Kharkov, Publishing House KHNURE, 2, 89–105.
  18. Leschinskaya, I. A. (2010). About the method of construction of the directed charts of relyacionnykh networks on the example of relation of equivalence. Systemi obrobki informatsii, 1 (82), 75–81.
  19. Rotin, I. M. (1994). Linear and bilinear boolean operators and their application in informative CASS. Kharkov, 163.
  20. Vechirskaya, I. D. (2007). Linear logical transformations and their application to artificial intelligence. Kharkov, 149.
  21. Bondarenko, M. F., Hahanova, I. V. (2003). Logic networks application for computing process organization. Radio electronics and informatics. Kharkov, Publishing House KHNURE, 3, 150–156.

Downloads

Published

2014-12-22

How to Cite

Булкин, В. И. (2014). Modelling of the relation of implication with use of the directed relational networks. Eastern-European Journal of Enterprise Technologies, 6(4(72), 30–37. https://doi.org/10.15587/1729-4061.2014.30567

Issue

Vol. 6 No. 4(72) (2014): Mathematics and Cybernetics - applied aspects

Section

Mathematics and Cybernetics - applied aspects

License

Copyright (c) 2014 Виталий Иванович Булкин

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.