3 research outputs found
ΠΠ±Π΄ΡΠΊΡΠΈΠ²Π½ΡΠΉ ΡΠΈΠ½ΡΠ΅Π· ΡΡΡΡΠΊΡΡΡ ΡΡΠ½ΠΊΡΠΈΠΎΠ½Π°Π»ΡΠ½ΡΡ ΡΠΈΠΏΠΎΠ² ΡΡΠ΅Π½Π°ΡΠΈΠ΅Π² Π΄Π»Ρ ΡΡΡΠ°Π½ΠΎΠ²Π»Π΅Π½ΠΈΡ Π°Π½Π°Π»ΠΎΠ³ΠΈΠΉ Π² ΠΌΠ½ΠΎΠ³ΠΎΠΌΠΎΠ΄Π΅Π»ΡΠ½ΠΎΠΉ ΠΊΠΎΠ½ΡΠ΅ΠΏΡΡΠ°Π»ΡΠ½ΠΎ-ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΠ΅ Π·Π½Π°Π½ΠΈΠΉ
It is proposed to empower the intelligent system with an ability of the abductive generation of new knowledge based on conclusions by analogy. With such an ability it could be trained on precedents, taking place in different areas, transferring knowledge about the phenomena observed in one subject area to another. It is important that, on the basis of the task to be solved, the establishment of analogies can be carried out by means of finding similar structures, invariant properties and akin actions in the multi-model conceptual and ontological knowledge system. Establishing semantic similarity of the observed specifications and the ones generated by an intelligent system is based on the ability of the Giromat in general case to perform the transition from the approximating concepts that belong to the same problem domain (context), through the approximated ones (more general, abstract), to approximating as well, but belonging to a different problem domain (context).Π ΡΡΠ°ΡΡΠ΅ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΎ Π½Π°Π΄Π΅Π»ΠΈΡΡ ΠΈΠ½ΡΠ΅Π»Π»Π΅ΠΊΡΡΠ°Π»ΡΠ½ΡΡ ΡΠΈΡΡΠ΅ΠΌΡ ΡΠΏΠΎΡΠΎΠ±Π½ΠΎΡΡΡΡ ΠΊ Π°Π±Π΄ΡΠΊΡΠΈΠ²Π½ΠΎΠΌΡ ΠΏΠΎΡΠΎΠΆΠ΄Π΅Π½ΠΈΡ Π½ΠΎΠ²ΡΡ
Π·Π½Π°Π½ΠΈΠΉ, ΠΎΡΠ½ΠΎΠ²Π°Π½Π½ΠΎΠΌΡ Π½Π° Π²ΡΠ²ΠΎΠ΄Π°Ρ
ΠΏΠΎ Π°Π½Π°Π»ΠΎΠ³ΠΈΠΈ. ΠΠ±Π»Π°Π΄Π°Ρ ΡΠΊΠ°Π·Π°Π½Π½ΠΎΠΉ ΡΠΏΠΎΡΠΎΠ±Π½ΠΎΡΡΡΡ, ΠΎΠ½Π° ΡΠΌΠΎΠΆΠ΅Ρ ΠΎΠ±ΡΡΠ°ΡΡΡΡ Π½Π° ΠΏΡΠ΅ΡΠ΅Π΄Π΅Π½ΡΠ°Ρ
, ΠΈΠΌΠ΅ΡΡΠΈΡ
ΠΌΠ΅ΡΡΠΎ Π² ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ
ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ½ΡΡ
ΠΎΠ±Π»Π°ΡΡΡΡ
, ΠΏΠ΅ΡΠ΅Π½ΠΎΡΡ Π·Π½Π°Π½ΠΈΡ ΠΎ ΡΠ²Π»Π΅Π½ΠΈΡΡ
, Π½Π°Π±Π»ΡΠ΄Π°Π΅ΠΌΡΡ
Π² ΠΎΠ΄Π½ΠΎΠΉ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ½ΠΎΠΉ ΠΎΠ±Π»Π°ΡΡΠΈ, Π² Π΄ΡΡΠ³ΡΡ. ΠΡΠΈ ΡΡΠΎΠΌ Π²Π°ΠΆΠ½ΡΠΌ ΡΠ²Π»ΡΠ΅ΡΡΡ ΡΠΎΡ ΡΠ°ΠΊΡ, ΡΡΠΎ ΠΈΡΡ
ΠΎΠ΄Ρ ΠΈΠ· ΡΠ΅ΡΠ°Π΅ΠΌΠΎΠΉ Π·Π°Π΄Π°ΡΠΈ, ΡΡΡΠ°Π½ΠΎΠ²Π»Π΅Π½ΠΈΠ΅ Π°Π½Π°Π»ΠΎΠ³ΠΈΠΉ ΠΌΠΎΠΆΠ΅Ρ ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΡΡΡΡ ΠΏΡΡΠ΅ΠΌ Π½Π°Ρ
ΠΎΠΆΠ΄Π΅Π½ΠΈΡ ΠΏΠΎΠ΄ΠΎΠ±Π½ΡΡ
ΡΡΡΡΠΊΡΡΡ, ΠΈΠ½Π²Π°ΡΠΈΠ°Π½ΡΠ½ΡΡ
ΡΠ²ΠΎΠΉΡΡΠ² ΠΈ Π±Π»ΠΈΠ·ΠΊΠΈΡ
Π΄Π΅ΠΉΡΡΠ²ΠΈΠΉ, ΠΎΠΏΠΈΡΠ°Π½Π½ΡΡ
Π² ΠΌΠ½ΠΎΠ³ΠΎΠΌΠΎΠ΄Π΅Π»ΡΠ½ΠΎΠΉ ΠΊΠΎΠ½ΡΠ΅ΠΏΡΡΠ°Π»ΡΠ½ΠΎ-ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΠ΅ Π·Π½Π°Π½ΠΈΠΉ. Π£ΡΡΠ°Π½ΠΎΠ²Π»Π΅Π½ΠΈΠ΅ ΡΠ΅ΠΌΠ°Π½ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΏΠΎΠ΄ΠΎΠ±ΠΈΡ Π½Π°Π±Π»ΡΠ΄Π°Π΅ΠΌΡΡ
ΠΈ ΡΠΎΡΠΌΠΈΡΡΠ΅ΠΌΡΡ
ΠΈΠ½ΡΠ΅Π»Π»Π΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΠΎΠΉ ΡΠΏΠ΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΉ Π±Π°Π·ΠΈΡΡΠ΅ΡΡΡ Π½Π° Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΡΡΠΈ Π³ΠΈΡΠΎΠΌΠ°ΡΠ° Π² ΠΎΠ±ΡΠ΅ΠΌ ΡΠ»ΡΡΠ°Π΅ ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΡΡ ΠΏΠ΅ΡΠ΅Ρ
ΠΎΠ΄ ΠΎΡ Π°ΠΏΠΏΡΠΎΠΊΡΠΈΠΌΠΈΡΡΡΡΠΈΡ
ΠΊΠΎΠ½ΡΠ΅ΠΏΡΠΎΠ², ΠΏΡΠΈΠ½Π°Π΄Π»Π΅ΠΆΠ°ΡΠΈΡ
ΠΎΠ΄Π½ΠΎΠΉ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ½ΠΎΠΉ ΠΎΠ±Π»Π°ΡΡΠΈ (ΠΊΠΎΠ½ΡΠ΅ΠΊΡΡΡ), ΡΠ΅ΡΠ΅Π· Π°ΠΏΠΏΡΠΎΠΊΡΠΈΠΌΠΈΡΡΠ΅ΠΌΡΠ΅ (Π±ΠΎΠ»Π΅Π΅ ΠΎΠ±ΡΠΈΠ΅, Π°Π±ΡΡΡΠ°ΠΊΡΠ½ΡΠ΅) ΠΊ Π°ΠΏΠΏΡΠΎΠΊΡΠΈΠΌΠΈΡΡΡΡΠΈΠΌ, Π½ΠΎ ΠΏΡΠΈΠ½Π°Π΄Π»Π΅ΠΆΠ°ΡΠΈΠΌ Π΄ΡΡΠ³ΠΎΠΉ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ½ΠΎΠΉ ΠΎΠ±Π»Π°ΡΡΠΈ (ΠΊΠΎΠ½ΡΠ΅ΠΊΡΡΡ)
ΠΠΎΠΏΠΎΠ»Π½Π΅Π½ΠΈΠ΅ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΡ ΡΠΈΡΡΠ΅ΠΌ Π·Π½Π°Π½ΠΈΠΉ Π½Π° ΠΎΡΠ½ΠΎΠ²Π΅ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΡΠΌΠΎΠ·Π°ΠΊΠ»ΡΡΠ΅Π½ΠΈΠΉ Ρ ΡΡΠ΅ΡΠΎΠΌ ΡΠ΅ΠΌΠ°Π½ΡΠΈΠΊΠΈ ΡΠΎΠ»Π΅ΠΉ
The article considers the issue of automatic completion of ontology with roles and concepts formed by an intelligent system in the provision of new facts. Implementation of specified calculations allows increasing ontology information content during data stream preprocessing.Π ΡΡΠ°ΡΡΠ΅ ΡΠ°ΡΡΠΌΠΎΡΡΠ΅Π½ Π²ΠΎΠΏΡΠΎΡ, ΡΠ²ΡΠ·Π°Π½Π½ΡΠΉ Ρ Π°Π²ΡΠΎΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΠΌ ΠΏΠΎΠΏΠΎΠ»Π½Π΅Π½ΠΈΠ΅ΠΌ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΈ ΡΠΎΠ»ΡΠΌΠΈ ΠΈ ΠΊΠΎΠ½ΡΠ΅ΠΏΡΠ°ΠΌΠΈ, ΡΠΎΡΠΌΠΈΡΡΠ΅ΠΌΡΠΌΠΈ ΠΈΠ½ΡΠ΅Π»Π»Π΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΠΎΠΉ, ΠΏΡΠΈ ΠΏΡΠ΅Π΄ΠΎΡΡΠ°Π²Π»Π΅Π½ΠΈΠΈ Π΅ΠΉ Π½ΠΎΠ²ΡΡ
ΡΠ°ΠΊΡΠΎΠ². ΠΡΡΡΠ΅ΡΡΠ²Π»Π΅Π½ΠΈΠ΅ ΡΠΊΠ°Π·Π°Π½Π½ΡΡ
ΠΏΡΠ΅Π΄Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΠΉ ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ΅Ρ ΠΏΠΎΠ²ΡΡΠΈΡΡ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ΅ ΡΠΎΠ΄Π΅ΡΠΆΠ°Π½ΠΈΠ΅ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΈ Π½Π° ΡΡΠ°ΠΏΠ΅ ΠΏΡΠ΅Π΄Π²Π°ΡΠΈΡΠ΅Π»ΡΠ½ΠΎΠΉ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ ΠΏΠΎΡΠΎΠΊΠ° ΠΏΠΎΡΡΡΠΏΠ°ΡΡΠΈΡ
Π΄Π°Π½Π½ΡΡ
Query answering via modal definability with FaCT++: First blood
Abstract. We use results on modal definability of first-order formulas to reduce the problem of answering conjunctive queries over knowledge bases (of any expressivity) to checking inconsistency of those knowledge bases extended with a number of ALCI concept assertions. This reduction has been shown to work for conjunctive queries without cycles that only involve bound variables. In this paper, we present an optimised algorithm for the reduction, its implementation using FaCT++ as an underlying reasoner and the results of first experiments.