Constructive Ontologies

DOI

10.2991/csit-19.2019.14How to use a DOI?

Keywords

ontology, deductive synthesis of algorithms, category theory, Cartesian closure, constructive proof, automatic inference.

Abstract

An approach to the description of subject areas is proposed to solve constructive tasks in the form of constructive ontologies at the abstraction level of Cartesian closed categories. Constructiveness of ontology makes it possible correct automatic or automated (man-machine) construction of problem solving. In theory the ontology is constructed in such a way that it decides by itself tasks. The proposed paradigm is based on the paradigm of deductive synthesis of algorithms. The difference is that the synthesized algorithms are obtained as morphisms of the Cartesian closed category. In essence, ontology is designed to describe the subject area as a Cartesian closed category. In this case, initially objects of a category become what is traditionally thought of as classes of objects of a subject area. Elements of most of these classes themselves are often not considered at the initial stage. For constructiveness, the ontology is equipped with a logical machine for constructing output. This machine is conceived as an integral part of the most constructive ontology. From a practical point of view, it is important for reliability to have independent logical calculus and a derivation machine. These mechanisms control each other. The result of the logical machine is checked by calculus.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Anatolii Beltiukov
PY  - 2019/12
DA  - 2019/12
TI  - Constructive Ontologies
BT  - Proceedings of the 21st International Workshop on Computer Science and Information Technologies (CSIT 2019)
PB  - Atlantis Press
SP  - 83
EP  - 88
SN  - 2589-4900
UR  - https://doi.org/10.2991/csit-19.2019.14
DO  - 10.2991/csit-19.2019.14
ID  - Beltiukov2019/12
ER  -