Geodesic
Document models
The Bulletin of Irkutsk State University. Series Mathematics, Tome 21 (2017), pp. 89-107 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In this paper, the concept of locally simple models is considered. Locally simple models are arbitrarily complex models built from relatively simple components. A lot of practically important domains of discourse can be described as locally simple models, for example, business models of enterprises and companies. Up to now, research in human reasoning automation has been mainly concentrated around the most intellectually intensive activities, such as automated theorem proving. On the other hand, the retailer business model is formed from "jobs", and each "job" can be modelled and automated more or less easily. At the same time, the whole retailer model as an integrated system is extremely complex. In this paper, we offer a variant of the mathematical definition of a locally simple model. This definition is intended for modelling a wide range of domains. Therefore, we also must take into account the perceptual and psychological issues. Logic is elitist, and if we want to attract to our models as many people as possible, we need to hide this elitism behind some metaphor, to which 'ordinary' people are accustomed. As such a metaphor, we use the concept of a document, so our locally simple models are called document models. Document models are built in the paradigm of semantic programming. This allows us to achieve another important goal — to make the documentary models executable. Executable models are models that can act as practical information systems in the described domain of discourse. Thus, if our model is executable, then programming becomes redundant. The direct use of a model, instead of its programming coding, brings important advantages, for example, a drastic cost reduction for development and maintenance. Moreover, since the model is well and sound, and not dissolved within programming modules, we can directly apply AI tools, in particular, machine learning. This significantly expands the possibilities for automation and robotization of management and control activities.
Keywords: locally simple model, document model, semantic programming. 
@article{IIGUM_2017_21_a6,
     author = {A. A. Malykh and A. V. Mantsivoda},
     title = {Document models},
     journal = {The Bulletin of Irkutsk State University. Series Mathematics},
     pages = {89--107},
     year = {2017},
     volume = {21},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIGUM_2017_21_a6/}
}
TY  - JOUR
AU  - A. A. Malykh
AU  - A. V. Mantsivoda
TI  - Document models
JO  - The Bulletin of Irkutsk State University. Series Mathematics
PY  - 2017
SP  - 89
EP  - 107
VL  - 21
UR  - http://geodesic.mathdoc.fr/item/IIGUM_2017_21_a6/
LA  - ru
ID  - IIGUM_2017_21_a6
ER  - 
%0 Journal Article
%A A. A. Malykh
%A A. V. Mantsivoda
%T Document models
%J The Bulletin of Irkutsk State University. Series Mathematics
%D 2017
%P 89-107
%V 21
%U http://geodesic.mathdoc.fr/item/IIGUM_2017_21_a6/
%G ru
%F IIGUM_2017_21_a6
A. A. Malykh; A. V. Mantsivoda. Document models. The Bulletin of Irkutsk State University. Series Mathematics, Tome 21 (2017), pp. 89-107. http://geodesic.mathdoc.fr/item/IIGUM_2017_21_a6/

[1] Vityev E., “Semantic Probablistic Inference of Predictions”, Izv. Irkutsk. Gos. Univ. Ser. Mat., 21 (2017), 33–50 (in Russian) | Zbl

[2] Malykh A., Mantsivoda A., Ulyanov V. S., “Logical Architectures and Object Oriented Approach”, Vestnik NGU. Series: Mathematics, Mechanics, Informatics, 9:3 (2009), 64–85 (In Russian) | Zbl

[3] Malykh A., Mantsivoda A., “Object Theories over List Superstructures”, Izv. Irkutsk. Gos. Univ. Ser. Mat., 2012, no. 4, 27–44 (In Russian)

[4] Malykh A., Mantsivoda A., “Libretto System: Web Resources Development Based On a Holistic Data and Knowledge Model”, Proceedings of The 6th All-Russian Conference on Control Problems (Gelendzhik, September, 2013), 73–75

[5] L. T. Berners, J. Hendler, O. Lassila, “The Semantic Web”, Scientific American, 284, May (2001), 34–43 | DOI

[6] S. S. Goncharov, Yu. L. Ershov, D. I. Sviridenko, “Semantic foundations of programming”, Lecture Notes in Computer Science, 278, 1987, 116–122 | DOI | MR | Zbl

[7] S. S. Goncharov, Yu. L. Ershov, D. I. Sviridenko, “Semantic programming”, Information processing, Proc. IFIP 10-th World Comput. Congress (Dublin, 1986), v. 10, 1093–1100 | MR

[8] I. Horrocks, P. Patel-Schneider, F. Van Harmelen, “From SHIQ and RDF to OWL: The making of a Web Ontology Language”, Journal of Web Semantics, 1:1 (2003), 7–26 | DOI

[9] I. Horrocks, U. Sattler, U. Tobies, “Practical reasoning for expressive description logics”, Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, LPAR'99, Lecture Notes in Artificial Intelligence, 1705, eds. H. Ganzinger, D. McAllester, A. Voronkov, Springer-Verlag, 1999, 161–180 | DOI | MR | Zbl

[10] B. Kovalerchuk, E. Vityaev, Data Mining in finance: Advances in Relational and Hybrid Methods, Kluwer Academic Publishers, 2000, 456 pp. | Zbl

[11] A. Malykh, A. Mantsivoda, “Query Language for Logic Architectures”, Lecture Notes in Computer Science, 5947, Springer-Verlag, Berlin–Heidelberg, 2010, 294–305 | DOI | Zbl

[12] J. A. Robinson, “A Machine Oriented Logic Based on the Resolution Principle”, J. ACM, 12 (1965), 23–41 | DOI | MR | Zbl

[13] Riazanov A., Voronkov A., “The design and implementation of VAMPIRE”, Journal AI Communications, 15:2–3 (2002), 91–110 | Zbl

[14] Semantic Web activity, http://www.w3.org/2001/sw/