26 research outputs found
ΠΠΎΠΏΠΎΠ»Π½Π΅Π½ΠΈΠ΅ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΡ ΡΠΈΡΡΠ΅ΠΌ Π·Π½Π°Π½ΠΈΠΉ Π½Π° ΠΎΡΠ½ΠΎΠ²Π΅ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΡΠΌΠΎΠ·Π°ΠΊΠ»ΡΡΠ΅Π½ΠΈΠΉ Ρ ΡΡΠ΅ΡΠΎΠΌ ΡΠ΅ΠΌΠ°Π½ΡΠΈΠΊΠΈ ΡΠΎΠ»Π΅ΠΉ
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.Π ΡΡΠ°ΡΡΠ΅ ΡΠ°ΡΡΠΌΠΎΡΡΠ΅Π½ Π²ΠΎΠΏΡΠΎΡ, ΡΠ²ΡΠ·Π°Π½Π½ΡΠΉ Ρ Π°Π²ΡΠΎΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΠΌ ΠΏΠΎΠΏΠΎΠ»Π½Π΅Π½ΠΈΠ΅ΠΌ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΈ ΡΠΎΠ»ΡΠΌΠΈ ΠΈ ΠΊΠΎΠ½ΡΠ΅ΠΏΡΠ°ΠΌΠΈ, ΡΠΎΡΠΌΠΈΡΡΠ΅ΠΌΡΠΌΠΈ ΠΈΠ½ΡΠ΅Π»Π»Π΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΠΎΠΉ, ΠΏΡΠΈ ΠΏΡΠ΅Π΄ΠΎΡΡΠ°Π²Π»Π΅Π½ΠΈΠΈ Π΅ΠΉ Π½ΠΎΠ²ΡΡ
ΡΠ°ΠΊΡΠΎΠ². ΠΡΡΡΠ΅ΡΡΠ²Π»Π΅Π½ΠΈΠ΅ ΡΠΊΠ°Π·Π°Π½Π½ΡΡ
ΠΏΡΠ΅Π΄Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΠΉ ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ΅Ρ ΠΏΠΎΠ²ΡΡΠΈΡΡ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ΅ ΡΠΎΠ΄Π΅ΡΠΆΠ°Π½ΠΈΠ΅ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΈ Π½Π° ΡΡΠ°ΠΏΠ΅ ΠΏΡΠ΅Π΄Π²Π°ΡΠΈΡΠ΅Π»ΡΠ½ΠΎΠΉ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ ΠΏΠΎΡΠΎΠΊΠ° ΠΏΠΎΡΡΡΠΏΠ°ΡΡΠΈΡ
Π΄Π°Π½Π½ΡΡ
Dealing with Inconsistencies and Updates in Description Logic Knowledge Bases
The main purpose of an "Ontology-based Information System" (OIS) is to provide an explicit description of the domain of interest, called ontology, and let all the functions of the system be based on such representation, thus freeing the users from the knowledge about the physical repositories where the real data reside. The functionalities that an OIS should provide to the user include both query answering, whose goal is to extract information from the system, and update, whose goal is to modify the information content of the system in order to reflect changes in the domain of interest.
The "ontology" is a formal, high quality intentional representation of the domain, designed in such a way to avoid inconsistencies in the modeling of concepts and relationships. On the contrary, the extensional level of the system, constituted by a set of autonomous, heterogeneous data sources, is built independently from the conceptualization represented by the ontology, and therefore may contain information that is incoherent with the ontology itself.
This dissertation presents a detailed study on the problem of dealing with inconsistencies in OISs, both in query answering, and in performing updates. We concentrate on the case where the knowledge base in the OISs is expressed in Description Logics, especially the logics of the DL-lite family. As for query answering, we propose both semantical frameworks that are inconsistency-tolerant, and techniques for answering unions of conjunctive queries posed to OISs under such inconsistency-tolerant semantics. As for updates, we present an approach to compute the result of updating a possibly inconsistent OIS with both insertion and deletion of extensional knowledge
ΠΠ±Π΄ΡΠΊΡΠΈΠ²Π½ΡΠΉ ΡΠΈΠ½ΡΠ΅Π· ΡΡΡΡΠΊΡΡΡ ΡΡΠ½ΠΊΡΠΈΠΎΠ½Π°Π»ΡΠ½ΡΡ ΡΠΈΠΏΠΎΠ² ΡΡΠ΅Π½Π°ΡΠΈΠ΅Π² Π΄Π»Ρ ΡΡΡΠ°Π½ΠΎΠ²Π»Π΅Π½ΠΈΡ Π°Π½Π°Π»ΠΎΠ³ΠΈΠΉ Π² ΠΌΠ½ΠΎΠ³ΠΎΠΌΠΎΠ΄Π΅Π»ΡΠ½ΠΎΠΉ ΠΊΠΎΠ½ΡΠ΅ΠΏΡΡΠ°Π»ΡΠ½ΠΎ-ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΠ΅ Π·Π½Π°Π½ΠΈΠΉ
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).Π ΡΡΠ°ΡΡΠ΅ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΎ Π½Π°Π΄Π΅Π»ΠΈΡΡ ΠΈΠ½ΡΠ΅Π»Π»Π΅ΠΊΡΡΠ°Π»ΡΠ½ΡΡ ΡΠΈΡΡΠ΅ΠΌΡ ΡΠΏΠΎΡΠΎΠ±Π½ΠΎΡΡΡΡ ΠΊ Π°Π±Π΄ΡΠΊΡΠΈΠ²Π½ΠΎΠΌΡ ΠΏΠΎΡΠΎΠΆΠ΄Π΅Π½ΠΈΡ Π½ΠΎΠ²ΡΡ
Π·Π½Π°Π½ΠΈΠΉ, ΠΎΡΠ½ΠΎΠ²Π°Π½Π½ΠΎΠΌΡ Π½Π° Π²ΡΠ²ΠΎΠ΄Π°Ρ
ΠΏΠΎ Π°Π½Π°Π»ΠΎΠ³ΠΈΠΈ. ΠΠ±Π»Π°Π΄Π°Ρ ΡΠΊΠ°Π·Π°Π½Π½ΠΎΠΉ ΡΠΏΠΎΡΠΎΠ±Π½ΠΎΡΡΡΡ, ΠΎΠ½Π° ΡΠΌΠΎΠΆΠ΅Ρ ΠΎΠ±ΡΡΠ°ΡΡΡΡ Π½Π° ΠΏΡΠ΅ΡΠ΅Π΄Π΅Π½ΡΠ°Ρ
, ΠΈΠΌΠ΅ΡΡΠΈΡ
ΠΌΠ΅ΡΡΠΎ Π² ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ
ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ½ΡΡ
ΠΎΠ±Π»Π°ΡΡΡΡ
, ΠΏΠ΅ΡΠ΅Π½ΠΎΡΡ Π·Π½Π°Π½ΠΈΡ ΠΎ ΡΠ²Π»Π΅Π½ΠΈΡΡ
, Π½Π°Π±Π»ΡΠ΄Π°Π΅ΠΌΡΡ
Π² ΠΎΠ΄Π½ΠΎΠΉ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ½ΠΎΠΉ ΠΎΠ±Π»Π°ΡΡΠΈ, Π² Π΄ΡΡΠ³ΡΡ. ΠΡΠΈ ΡΡΠΎΠΌ Π²Π°ΠΆΠ½ΡΠΌ ΡΠ²Π»ΡΠ΅ΡΡΡ ΡΠΎΡ ΡΠ°ΠΊΡ, ΡΡΠΎ ΠΈΡΡ
ΠΎΠ΄Ρ ΠΈΠ· ΡΠ΅ΡΠ°Π΅ΠΌΠΎΠΉ Π·Π°Π΄Π°ΡΠΈ, ΡΡΡΠ°Π½ΠΎΠ²Π»Π΅Π½ΠΈΠ΅ Π°Π½Π°Π»ΠΎΠ³ΠΈΠΉ ΠΌΠΎΠΆΠ΅Ρ ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΡΡΡΡ ΠΏΡΡΠ΅ΠΌ Π½Π°Ρ
ΠΎΠΆΠ΄Π΅Π½ΠΈΡ ΠΏΠΎΠ΄ΠΎΠ±Π½ΡΡ
ΡΡΡΡΠΊΡΡΡ, ΠΈΠ½Π²Π°ΡΠΈΠ°Π½ΡΠ½ΡΡ
ΡΠ²ΠΎΠΉΡΡΠ² ΠΈ Π±Π»ΠΈΠ·ΠΊΠΈΡ
Π΄Π΅ΠΉΡΡΠ²ΠΈΠΉ, ΠΎΠΏΠΈΡΠ°Π½Π½ΡΡ
Π² ΠΌΠ½ΠΎΠ³ΠΎΠΌΠΎΠ΄Π΅Π»ΡΠ½ΠΎΠΉ ΠΊΠΎΠ½ΡΠ΅ΠΏΡΡΠ°Π»ΡΠ½ΠΎ-ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΠ΅ Π·Π½Π°Π½ΠΈΠΉ. Π£ΡΡΠ°Π½ΠΎΠ²Π»Π΅Π½ΠΈΠ΅ ΡΠ΅ΠΌΠ°Π½ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΏΠΎΠ΄ΠΎΠ±ΠΈΡ Π½Π°Π±Π»ΡΠ΄Π°Π΅ΠΌΡΡ
ΠΈ ΡΠΎΡΠΌΠΈΡΡΠ΅ΠΌΡΡ
ΠΈΠ½ΡΠ΅Π»Π»Π΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΠΎΠΉ ΡΠΏΠ΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΉ Π±Π°Π·ΠΈΡΡΠ΅ΡΡΡ Π½Π° Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΡΡΠΈ Π³ΠΈΡΠΎΠΌΠ°ΡΠ° Π² ΠΎΠ±ΡΠ΅ΠΌ ΡΠ»ΡΡΠ°Π΅ ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΡΡ ΠΏΠ΅ΡΠ΅Ρ
ΠΎΠ΄ ΠΎΡ Π°ΠΏΠΏΡΠΎΠΊΡΠΈΠΌΠΈΡΡΡΡΠΈΡ
ΠΊΠΎΠ½ΡΠ΅ΠΏΡΠΎΠ², ΠΏΡΠΈΠ½Π°Π΄Π»Π΅ΠΆΠ°ΡΠΈΡ
ΠΎΠ΄Π½ΠΎΠΉ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ½ΠΎΠΉ ΠΎΠ±Π»Π°ΡΡΠΈ (ΠΊΠΎΠ½ΡΠ΅ΠΊΡΡΡ), ΡΠ΅ΡΠ΅Π· Π°ΠΏΠΏΡΠΎΠΊΡΠΈΠΌΠΈΡΡΠ΅ΠΌΡΠ΅ (Π±ΠΎΠ»Π΅Π΅ ΠΎΠ±ΡΠΈΠ΅, Π°Π±ΡΡΡΠ°ΠΊΡΠ½ΡΠ΅) ΠΊ Π°ΠΏΠΏΡΠΎΠΊΡΠΈΠΌΠΈΡΡΡΡΠΈΠΌ, Π½ΠΎ ΠΏΡΠΈΠ½Π°Π΄Π»Π΅ΠΆΠ°ΡΠΈΠΌ Π΄ΡΡΠ³ΠΎΠΉ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ½ΠΎΠΉ ΠΎΠ±Π»Π°ΡΡΠΈ (ΠΊΠΎΠ½ΡΠ΅ΠΊΡΡΡ)
MUS-Based Partitioning for Inconsistency Measures
National audienceMesurer le degrΓ© d'incohΓ©rence des bases de connaissances permet aux agents une meilleur comprΓ©hension de leur environnement. DiffΓ©rentes approches sΓ©mantiques et syntaxiques ont Γ©tΓ© proposΓ©es pour quantifier l'incohΓ©rence. Dans ce papier, nous proposons d'analyser les limites des approches existantes. Tout d'abord, nous explorons la propriΓ©tΓ© logique d'additivitΓ© en considΓ©rant les composantes connexes du graphe reprΓ©sentant les bases de connaissances. Ensuite, nous montrons comment la structure de ce graphe peut Γͺtre prise en compte pour identifier d'une maniΓ¨re plus fine la responsabilitΓ© de chaque formule dans l'incohΓ©rence. Finalement, nous Γ©tendons notre approche pour fournir une mesure d'incohΓ©rence de la base entiΓ¨re en satisfaisant des propriΓ©tΓ©s dΓ©finies
Combining open and closed world reasoning for the semantic web
Dissertação para obtenção do Grau de Doutor
em InformΓ‘ticaOne important problem in the ongoing standardization of knowledge representation
languages for the Semantic Web is combining open world ontology languages, such as the OWL-based ones, and closed world rule-based languages.
The main difficulty of such a combination is that both formalisms are quite orthogonal w.r.t. expressiveness and how decidability is achieved. Combining non-monotonic rules and ontologies is thus a challenging task
that requires careful balancing between expressiveness of the knowledge representation language and the computational complexity of reasoning.
In this thesis, we will argue in favor of a combination of ontologies and nonmonotonic
rules that tightly integrates the two formalisms involved, that has a computational complexity that is as low as possible, and that allows us to query for information instead of calculating the whole model. As our starting point we choose the mature approach of hybrid MKNF knowledge
bases, which is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. We extend the two-valued framework of MKNF logics to a three-valued logics, and we propose a well-founded semantics for non-disjunctive hybrid MKNF knowledge bases. This new semantics promises to provide better efficiency of reasoning,and it is faithful w.r.t. the original two-valued MKNF semantics and compatible with both the OWL-based semantics and the traditional Well-
Founded Semantics for logic programs. We provide an algorithm based on operators to compute the unique model, and we extend SLG resolution with tabling to a general framework that allows us to query a combination of non-monotonic rules and any given ontology language. Finally, we
investigate concrete instances of that procedure w.r.t. three tractable ontology
languages, namely the three description logics underlying the OWL 2 pro les.Fundação para a CiΓͺncia e Tecnologia - grant contract SFRH/BD/28745/200
Π‘ΠΏΠΎΡΠΎΠ±ΠΈ ΠΎΠ±ΡΠΈΡΠ»Π΅Π½Π½Ρ ΠΌΡΡΠΈ Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΠ΅ΠΉ OWL ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ
ΠΠΊΡΡΠ°Π»ΡΠ½ΡΡΡΡ ΡΠ΅ΠΌΠΈ. Π ΠΎΠ·Π²ΠΈΡΠΎΠΊ ΡΠ½ΡΠΎΡΠΌΠ°ΡΡΠΉΠ½ΠΎ-ΡΠ΅Π»Π΅ΠΊΠΎΠΌΡΠ½ΡΠΊΠ°ΡΡΠΉΠ½ΠΈΡ
ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΡΠΉ ΡΠΏΡΠΈΡΡ Π·Π±ΡΠ»ΡΡΠ΅Π½Π½Ρ ΠΎΠ±ΡΡΠ³ΡΠ² ΡΠ½ΡΠΎΡΠΌΠ°ΡΡΡ, Π½Π΅ΠΎΠ±Ρ
ΡΠ΄Π½ΠΎΡ Π΄Π»Ρ ΡΠΎΠ±ΠΎΡΠΈ
ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΠΈΡ
ΡΠΈΡΡΠ΅ΠΌ. Π’ΠΎΠΌΡ Π½Π° ΡΡΠΎΠ³ΠΎΠ΄Π½Ρ ΡΡΠ½ΡΡ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ° Π΅ΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡ
ΠΎΠ±ΡΠΎΠ±ΠΊΠΈ Π΄Π°Π½ΠΈΡ
. ΠΠ΄Π½ΠΈΠΌ ΡΠ· Π²Π°ΡΡΠ°Π½ΡΡΠ² ΡΡΡΠ΅Π½Π½Ρ ΡΡΡΡ Π·Π°Π΄Π°ΡΡ Ρ ΠΎΠ±ΡΠΎΠ±ΠΊΠ° Π΄Π°Π½ΠΈΡ
Π²
ΡΠΈΡΡΠ΅ΠΌΠ°Ρ
Π· Π²ΠΈΠΊΠΎΡΠΈΡΡΠ°Π½Π½ΡΠΌ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ. ΠΠ½ΡΠΎΠ»ΠΎΠ³ΡΡ β ΡΠΎΡΠΌΠ°Π»ΡΠ·ΠΎΠ²Π°Π½Π΅
ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π½Ρ Π·Π½Π°Π½Ρ ΠΏΡΠΎ ΠΏΠ΅Π²Π½Ρ ΠΏΡΠ΅Π΄ΠΌΠ΅ΡΠ½Ρ ΠΎΠ±Π»Π°ΡΡΡ, ΠΏΡΠΈΠ΄Π°ΡΠ½Π΅ Π΄Π»Ρ
Π°Π²ΡΠΎΠΌΠ°ΡΠΈΠ·ΠΎΠ²Π°Π½ΠΎΡ ΠΎΠ±ΡΠΎΠ±ΠΊΠΈ. Π’Π°ΠΊΠΈΠΌ ΡΠΈΠ½ΠΎΠΌ Π΄Π°Π½Ρ ΠΎΡ
ΠΎΠΏΠ»ΡΡΡΡ ΠΌΠ΅Π½ΡΠΈΠΉ ΠΎΠ±'ΡΠΌ
ΠΏΠ°ΠΌ'ΡΡΡ, Π° ΡΠ½ΡΠΎΡΠΌΠ°ΡΡΡ Π· Π½ΠΈΡ
ΠΌΠΎΠΆΠ½Π° ΠΎΡΡΠΈΠΌΠ°ΡΠΈ Π±ΡΠ»ΡΡΠ΅. Π ΠΎΠ·ΠΌΡΡ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ
Π½Π΅Π²ΠΏΠΈΠ½Π½ΠΎ Π·ΡΠΎΡΡΠ°Ρ, ΡΠΎΠΌΡ Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΡΡΡΡ Π°Π±ΠΎ Π²Π½ΡΡΡΡΡΠ½Ρ ΠΏΡΠΎΡΠΈΡΡΡΡΡ
ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΡ Π² ΡΠ°ΠΊΠΈΡ
Π²ΠΈΠΏΠ°Π΄ΠΊΠ°Ρ
Ρ Π·Π²ΠΈΡΠ½ΠΈΠΌ ΡΠ²ΠΈΡΠ΅ΠΌ. ΠΠ»Ρ ΠΎΠ±ΡΠΎΠ±ΠΊΠΈ ΡΠ° Π°Π½Π°Π»ΡΠ·Ρ
ΡΠ°ΠΊΠΈΡ
ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ Π½Π΅ΠΎΠ±Ρ
ΡΠ΄Π½ΠΎ Π·Π°ΡΡΠΎΡΠΎΠ²ΡΠ²Π°ΡΠΈ ΡΠΏΠΎΡΠΎΠ±ΠΈ ΠΎΠ±ΡΠΈΡΠ»Π΅Π½Π½Ρ ΠΌΡΡΠΈ
Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΡ, ΡΠΊΡ Ρ Π±ΡΠ΄ΡΡΡ ΡΠΎΠ·Π³Π»ΡΠ½ΡΡΡ Π² Π΄Π°Π½ΡΠΉ Π΄ΠΈΡΠ΅ΡΡΠ°ΡΡΠΉΠ½ΡΠΉ ΡΠΎΠ±ΠΎΡΡ.
ΠΠ±βΡΠΊΡΠΎΠΌ Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Π½Ρ Ρ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΡΠ½Ρ ΡΠΈΡΡΠ΅ΠΌΠΈ, Π½Π΅ΠΊΠΎΡΠΈΡΡΠ΅Π½ΡΠ½ΡΡΡΡ
ΠΏΡΠΈ ΠΏΠΎΠ±ΡΠ΄ΠΎΠ²Ρ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ.
ΠΡΠ΅Π΄ΠΌΠ΅ΡΠΎΠΌ Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Π½Ρ Ρ ΡΠΏΠΎΡΠΎΠ±ΠΈ ΠΎΠ±ΡΠΈΡΠ»Π΅Π½Π½Ρ ΠΌΡΡΠΈ
Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΡ OWL ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ.
ΠΠ΅ΡΠΎΠ΄ΠΈ Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½Π½Ρ β ΠΌΠ΅ΡΠΎΠ΄ΠΈ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ½ΠΎΡ ΡΡΠ°ΡΠΈΡΡΠΈΠΊΠΈ Π΄Π»Ρ Π°Π½Π°Π»ΡΠ·Ρ
ΠΎΠ±ΡΠΈΡΠ»Π΅Π½Π½Ρ ΠΌΡΡΠΈ Π½Π΅ΠΊΠΎΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΡ OWL ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ.
ΠΠ΅ΡΠ° ΡΠΎΠ±ΠΎΡΠΈ: ΠΏΡΠ΄Π²ΠΈΡΠ΅Π½Π½Ρ Π΅ΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΡ ΠΎΠ±ΡΠΎΠ±ΠΊΠΈ Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΈΡ
ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ ΡΠ»ΡΡ
ΠΎΠΌ Π·Π°ΡΡΠΎΡΡΠ²Π°Π½Π½Ρ ΠΎΠ±ΡΠΈΡΠ»Π΅Π½Π½Ρ ΠΌΡΡΠΈ Π½Π΅Π²ΡΠ΄Π½ΠΎΠ²ΡΠ΄Π½ΠΎΡΡΡ;
Π°Π΄Π°ΠΏΡΠ°ΡΡΡ ΠΏΡΠ΄Ρ
ΠΎΠ΄ΡΠ² Π΄ΠΎ ΠΎΠ±ΡΠΈΡΠ»Π΅Π½Π½Ρ ΠΌΡΡΠΈ Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΡ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ Π²
ΠΎΠΏΠΈΡΠΎΠ²ΡΠΉ Π»ΠΎΠ³ΡΡΡ Π΄ΠΎ OWL ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ; ΠΎΠΏΡΠΈΠΌΡΠ·Π°ΡΡΡ ΡΠΏΠΎΡΠΎΠ±ΡΠ² ΠΎΠ±ΡΠΈΡΠ»Π΅Π½Π½Ρ ΠΌΡΡΠΈ
Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΡ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΡΠΉ Π·Π°Π΄Π»Ρ Π·ΠΌΠ΅Π½ΡΠ΅Π½Π½Ρ ΡΠ°ΡΡ ΡΡ
Π²ΠΈΠΊΠΎΠ½Π°Π½Π½Ρ.Actuality of subject. The development of information and
telecommunication technologies contributes to the increase of the amount of
information necessary for the work of corporate systems. Therefore, today there is
a problem of efficient data processing. One of the solutions to this problem is the
processing of data in systems using ontologies. Ontology is a formalized
representation of knowledge about a particular subject area, suitable for automated
processing. This way, the data covers a smaller amount of memory, and more
information can be obtained from it. The size of the ontologies is constantly
increasing, so the inconsistency or internal contradiction of ontology in such cases
is a common occurrence. For the processing and analysis of such ontologies, it is
necessary to use methods for calculating the degree of inconsistency, which will be
considered in this thesis.
The object of the study is ontological systems, non-consistency in the
construction of ontologies.
The subject of the study is how to calculate the degree of non-consistency
of OWL ontologies.
Methods of research - methods of mathematical statistics for the analysis
of the calculation of the degree of non-consistency of OWL ontologies.
The purpose of the work: to increase the efficiency of processing
inconsistent ontologies by applying the calculation of the degree of noncompliance;
adaptation of approaches to calculating the degree of inconsistency of
ontologies in descriptive logic to OWL ontologies; optimization of methods for
calculating the degree of inconsistency of ontologies to reduce the time of their
implementation.ΠΠΊΡΡΠ°Π»ΡΠ½ΠΎΡΡΡ ΡΠ΅ΠΌΡ. Π Π°Π·Π²ΠΈΡΠΈΠ΅ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎ-
ΡΠ΅Π»Π΅ΠΊΠΎΠΌΠΌΡΠ½ΠΈΠΊΠ°ΡΠΈΠΎΠ½Π½ΡΡ
ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΠΈΠΉ ΡΠΏΠΎΡΠΎΠ±ΡΡΠ²ΡΠ΅Ρ ΡΠ²Π΅Π»ΠΈΡΠ΅Π½ΠΈΡ ΠΎΠ±ΡΠ΅ΠΌΠΎΠ²
ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΈ, Π½Π΅ΠΎΠ±Ρ
ΠΎΠ΄ΠΈΠΌΠΎΠΉ Π΄Π»Ρ ΡΠ°Π±ΠΎΡΡ ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΡΡ
ΡΠΈΡΡΠ΅ΠΌ. ΠΠΎΡΡΠΎΠΌΡ Π½Π°
ΡΠ΅Π³ΠΎΠ΄Π½ΡΡΠ½ΠΈΠΉ Π΄Π΅Π½Ρ ΡΡΡΠ΅ΡΡΠ²ΡΠ΅Ρ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ° ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΠΉ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ Π΄Π°Π½Π½ΡΡ
.
ΠΠ΄Π½ΠΈΠΌ ΠΈΠ· Π²Π°ΡΠΈΠ°Π½ΡΠΎΠ² ΡΠ΅ΡΠ΅Π½ΠΈΡ ΡΡΠΎΠΉ Π·Π°Π΄Π°ΡΠΈ ΡΠ²Π»ΡΠ΅ΡΡΡ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠ° Π΄Π°Π½Π½ΡΡ
Π²
ΡΠΈΡΡΠ΅ΠΌΠ°Ρ
Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΉ. ΠΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΡ - ΡΠΎΡΠΌΠ°Π»ΠΈΠ·ΠΎΠ²Π°Π½Π½ΠΎΠ΅
ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ΠΈΠ΅ Π·Π½Π°Π½ΠΈΠΉ ΠΎΠ± ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Π½ΠΎΠΉ ΠΏΡΠ΅Π΄ΠΌΠ΅ΡΠ½ΠΎΠΉ ΠΎΠ±Π»Π°ΡΡΠΈ, ΠΏΡΠΈΠ³ΠΎΠ΄Π½ΠΎΠ΅ Π΄Π»Ρ
Π°Π²ΡΠΎΠΌΠ°ΡΠΈΠ·ΠΈΡΠΎΠ²Π°Π½Π½ΠΎΠΉ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ. Π’Π°ΠΊΠΈΠΌ ΠΎΠ±ΡΠ°Π·ΠΎΠΌ Π΄Π°Π½Π½ΡΠ΅ ΠΎΡ
Π²Π°ΡΡΠ²Π°ΡΡ ΠΌΠ΅Π½ΡΡΠΈΠΉ
ΠΎΠ±ΡΠ΅ΠΌ ΠΏΠ°ΠΌΡΡΠΈ, Π° ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΈ ΠΏΠΎ Π½ΠΈΠΌ ΠΌΠΎΠΆΠ½ΠΎ Π±ΠΎΠ»ΡΡΠ΅. Π Π°Π·ΠΌΠ΅Ρ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΉ
ΠΏΠΎΡΡΠΎΡΠ½Π½ΠΎ ΡΠ°ΡΡΠ΅Ρ, ΠΏΠΎΡΡΠΎΠΌΡ Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΈΡΡΡ ΠΈΠ»ΠΈ Π²Π½ΡΡΡΠ΅Π½Π½Π΅Π΅ ΠΏΡΠΎΡΠΈΠ²ΠΎΡΠ΅ΡΠΈΠ΅
ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΈ Π² ΡΠ°ΠΊΠΈΡ
ΡΠ»ΡΡΠ°ΡΡ
ΡΠ²Π»ΡΠ΅ΡΡΡ ΠΎΠ±ΡΡΠ½ΡΠΌ ΡΠ²Π»Π΅Π½ΠΈΠ΅ΠΌ. ΠΠ»Ρ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ ΠΈ
Π°Π½Π°Π»ΠΈΠ·Π° ΡΠ°ΠΊΠΈΡ
ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΉ Π½Π΅ΠΎΠ±Ρ
ΠΎΠ΄ΠΈΠΌΠΎ ΠΏΡΠΈΠΌΠ΅Π½ΡΡΡ ΡΠΏΠΎΡΠΎΠ±Ρ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ
ΡΡΠ΅ΠΏΠ΅Π½ΠΈ Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΠΈ, ΠΊΠΎΡΠΎΡΡΠ΅ ΠΈ Π±ΡΠ΄ΡΡ ΡΠ°ΡΡΠΌΠΎΡΡΠ΅Π½Ρ Π² Π΄Π°Π½Π½ΠΎΠΉ
Π΄ΠΈΡΡΠ΅ΡΡΠ°ΡΠΈΠΎΠ½Π½ΠΎΠΉ ΡΠ°Π±ΠΎΡΠ΅.
ΠΠ±ΡΠ΅ΠΊΡΠΎΠΌ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΡΠ²Π»ΡΠ΅ΡΡΡ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ,
Π½Π΅ΠΊΠΎΡΠΈΡΡΠ΅Π½ΡΠ½ΠΈΡΡΡ ΠΏΡΠΈ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΠΈ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΉ.
ΠΡΠ΅Π΄ΠΌΠ΅ΡΠΎΠΌ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΡΠ²Π»ΡΡΡΡΡ ΡΠΏΠΎΡΠΎΠ±Ρ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΡΡΠ΅ΠΏΠ΅Π½ΠΈ
Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΠΈ OWL ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΉ.
ΠΠ΅ΡΠΎΠ΄Ρ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ - ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΡΠ°ΡΠΈΡΡΠΈΠΊΠΈ Π΄Π»Ρ
Π°Π½Π°Π»ΠΈΠ·Π° Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΠΌΠ΅ΡΡ Π½Π΅ΠΊΠΎΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΠΈ OWL ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΉ.
Π¦Π΅Π»Ρ ΡΠ°Π±ΠΎΡΡ: ΠΏΠΎΠ²ΡΡΠ΅Π½ΠΈΠ΅ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΠΈ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΈΡ
ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΉ ΠΏΡΡΠ΅ΠΌ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΡ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΠΌΠ΅ΡΡ Π½Π΅ΡΠΎΠΎΡΠ²Π΅ΡΡΡΠ²ΠΈΡ; Π°Π΄Π°ΠΏΡΠ°ΡΠΈΡ
ΠΏΠΎΠ΄Ρ
ΠΎΠ΄ΠΎΠ² ΠΊ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΡΡΠ΅ΠΏΠ΅Π½ΠΈ Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΠΈ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΉ Π²
ΠΎΠΏΠΈΡΠ°ΡΠ΅Π»ΡΠ½ΠΎΠΉ Π»ΠΎΠ³ΠΈΠΊΠ΅ Π² OWL ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΈ; ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΡ ΡΠΏΠΎΡΠΎΠ±ΠΎΠ² Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ
ΠΌΠ΅ΡΡ Π½Π΅ΠΊΠΎΠ½ΡΠΈΡΡΠ΅Π½ΡΠ½ΠΎΡΡΠΈ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΉ Π΄Π»Ρ ΡΠΌΠ΅Π½ΡΡΠ΅Π½ΠΈΡ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΠΈΡ
Π²ΡΠΏΠΎΠ»Π½Π΅Π½ΠΈΡ
Analysing inconsistent information using distance-based measures
There have been a number of proposals for measuring inconsistency in a knowledgebase (i.e. a set of logical formulae). These include measures that consider the minimally inconsistent subsets of the knowledgebase, and measures that consider the paraconsistent models (3 or 4 valued models) of the knowledgebase. In this paper, we present a new approach that considers the amount by which each formula has to be weakened in order for the knowledgebase to be consistent. This approach is based on ideas of knowledge merging by Konienczny and Pino-Perez. We show that this approach gives us measures that are different from existing measures, that have desirable properties, and that can take the significance of inconsistencies into account. The latter is useful when we want to differentiate between inconsistencies that have minor significance from inconsistencies that have major significance. We also show how our measures are potentially useful in applications such as evaluating violations of integrity constraints in databases and for deciding how to act on inconsistency
Pseudo-contractions as Gentle Repairs
Updating a knowledge base to remove an unwanted consequence is a challenging task. Some of the original sentences must be either deleted or weakened in such a way that the sentence to be removed is no longer entailed by the resulting set. On the other hand, it is desirable that the existing knowledge be preserved as much as possible, minimising the loss of information. Several approaches to this problem can be found in the literature. In particular, when the knowledge is represented by an ontology, two different families of frameworks have been developed in the literature in the past decades with numerous ideas in common but with little interaction between the communities: applications of AGM-like Belief Change and justification-based Ontology Repair. In this paper, we investigate the relationship between pseudo-contraction operations and gentle repairs. Both aim to avoid the complete deletion of sentences when replacing them with weaker versions is enough to prevent the entailment of the unwanted formula. We show the correspondence between concepts on both sides and investigate under which conditions they are equivalent. Furthermore, we propose a unified notation for the two approaches, which might contribute to the integration of the two areas