Description Logic Research Articles

The Balancing Between The Principles Of Justice, Legal Certainty, And Expediency In The Implementation Of Auction Execution In The Settlement Of Civil Cases

The ultimate goal of the law enforcement process is that the law guarantees the implementation of equal justice and protection for human dignity, order, peace, and legal certainty under the provisions of the law. Three principles must receive professional attention, although it is challenging to do in practice. Therefore, the Judge must make every effort so that every decision rendered contains the three principles that are the basis and purpose of the law. The research method used in this research is analytical descriptive data obtained from secondary legal sources. The data obtained from field studies and document studies are then analyzed in a qualitative juridical manner. After the data has been collected, it is poured into a logical and systematic description without using mathematical formulas. The purpose of a court is to obtain a judgment and decision-making that knows the actuality of the case. As well as the legal rules governing it that will be applied, both legal authorities wrote in legislation and unwritten law, and to analyze the application of the three principles in the judgment and decision making. The results prove that judgment and decision-making are unrest and unsortable in life without these three principles, especially for justice seekers. Furthermore, the research results show that in applying legal certainty, whatever happens, the rules are so and must be obeyed or implemented. The application of justice is fair if it can provide balanced treatment between rights and obligations. While utilization means that the law exists for humans, then implementing the law or law enforcement must benefit society.

Computing the fuzzy partition corresponding to the greatest fuzzy auto-bisimulation of a fuzzy graph-based structure under the Gödel semantics

The similarity measure based on fuzzy bisimulation has the Hennessy-Milner property as a strong logical foundation. It is useful for classification and clustering. In this work, we design an efficient algorithm with the complexity O((mlog⁡l+n)log⁡n) for computing the fuzzy partition corresponding to the greatest fuzzy auto-bisimulation of a finite fuzzy labeled graph G under the Gödel semantics, where n, m and l are the number of vertices, the number of non-zero edges and the number of different fuzzy degrees of edges of G, respectively. Our notion of fuzzy partition is novel, defined for finite sets with respect to the Gödel t-norm, with the aim to facilitate the computation of the greatest fuzzy auto-bisimulation. By using that algorithm, we also provide an algorithm with the complexity O(m⋅log⁡l⋅log⁡n+n2) for computing the greatest fuzzy bisimulation between two finite fuzzy labeled graphs under the Gödel semantics. This latter algorithm is better (has a lower complexity order) than the previously known algorithms for the considered problem. Our algorithms can be restated for other fuzzy graph-based structures such as fuzzy automata, fuzzy labeled transition systems, fuzzy Kripke models, fuzzy social networks and fuzzy interpretations in fuzzy description logics.

Model of the Performance Based on Artificial Intelligence-Fuzzy Logic Description of Physical Activity.

The aim of the study was to build a fuzzy model of lower limb peak torque in an isokinetic mode. The study involved 93 male participants (28 male deaf soccer players, 19 hearing soccer players and 46 deaf untraining male). A fuzzy computational model of different levels of physical activity with a focus on the lower limbs was constructed. The proposed fuzzy model assessing lower limb peak torque in an isokinetic mode demonstrated its effectiveness. The novelty of our research lies in the use of hierarchical fuzzy logic to extract computational rules from data provided explicitly and then to determine the corresponding physiological and pathological mechanisms. The contribution of our research lies in complementing the methods for describing physiology, pathology and rehabilitation with fuzzy parameters, including the so-called dynamic norm embedded in the model.

Approximate Reasoning for Large-Scale ABox in OWL DL Based on Neural-Symbolic Learning

The ontology knowledge base (KB) can be divided into two parts: TBox and ABox, where the former models schema-level knowledge within the domain, and the latter is a set of statements of assertions or facts about instances. ABox reasoning is a process of discovering implicit knowledge in ABox based on the existing KB, which is of great value in KB applications. ABox reasoning is influenced by both the complexity of TBox and scale of ABox. The traditional logic-based ontology reasoning methods are usually designed to be provably sound and complete but suffer from long algorithm runtimes and do not scale well for ontology KB represented by OWL DL (Description Logic). In some application scenarios, the soundness and completeness of reasoning results are not the key constraints, and it is acceptable to sacrifice them in exchange for the improvement of reasoning efficiency to some extent. Based on this view, an approximate reasoning method for large-scale ABox in OWL DL KBs was proposed, which is named the ChunfyReasoner (CFR). The CFR introduces neural-symbolic learning into ABox reasoning and integrates the advantages of symbolic systems and neural networks (NNs). By training the NN model, the CFR approximately compiles the logic deduction process of ontology reasoning, which can greatly improve the reasoning speed while ensuring higher reasoning quality. In this paper, we state the basic idea, framework, and construction process of the CFR in detail, and we conduct experiments on two open-source ontologies built on OWL DL. The experimental results verify the effectiveness of our method and show that the CFR can support the applications of large-scale ABox reasoning of OWL DL KBs.

Towards World Identification in Description Logics

The logical analysis of the usability of nominals, that are introduced by Hybrid Logic, informal descriptions of the world (within modern knowledge representation systems and semantic systems) is very important because nominals, as second sorts of propositional symbols, can support logical identification of the described world at specific states. This paper will focus on answering the philosophical-logical question of ‘how a fundamental world description in the description logic (DL) and a nominal can be related to each other?’. Based on my assumption that nominals can support more adequate identification of the world in DL, this paper will deal with the concept of ‘world identification’. Accordingly, based on a logical-terminological analysis of nominals, it will analyse hybridised fundamental world descriptions. Relying on the outcomes, this research will reach the idea that we can have a hybrid description logic with the analysed concepts.

Defeasible linear temporal logic

After the seminal work of Kraus, Lehmann and Magidor (formally known as the KLM approach) on conditionals and preferential models, many aspects of defeasibility in more complex formalisms have been studied in recent years. Examples of these aspects are the notion of typicality in description logic and defeasible necessity in modal logic. We discuss a new aspect of defeasibility that can be expressed in the case of temporal logic, which is the normality in an execution. In this contribution, we take Linear Temporal Logic () as case study for this defeasible aspect. has found extensive applications in Computer Science and Artificial Intelligence, notably as a formal framework for representing and verifying computer systems that vary over time. However, some systems may presents exceptions at some innocuous time points where they can be tolerated, or conversely, exceptions at other crucial time points where they need to be addressed. In order to ensure the reliability of such systems, we study a preferential extension of , called defeasible linear temporal logic (). In the first part of this paper, we show how semantics of KLM's preferential models can be integrated with . We also discuss the addition of non-monotonic temporal operators as a way to formalise defeasible properties of these systems. The second part of this paper is a study of the satisfiability problem of sentences. Based on Sistla and Clarke's work on the complexity of the classical language, we show the bounded-model property of two fragments of language. Moreover, we provide a procedure to check the satisfiability of sentences in both of these fragments.

The uses of mobile phones and Gifts in marriage in rural Moroccan communities in light of electric energy consumption: Interactive analysis

In an unprecedented global environment marked by energy dependence. Access to electricity in rural Moroccan areas revolutionizing everyday life and ways of social interaction. So that, the uses of mobile phone become normal and more important. This study aims to explore, in light of the importance of access to electricity and mobile phone’s uses, the role of the Gift in the consolidation of the social relationships on marriage occasions in Moroccan rural communities; by prioritizing the families’ point of view. Based on comprehensive biographical interview; it has been performed during 3 months (June; July and August 2022; because it’s the wedding period after the crops-gathering seasons); with 15 families in rural area in south East of Morocco. The verbatim was content analyzed. It allowed us to detect two levels: the first one is based on descriptive logic in relation to families view; indicating the importance of marriage in village knowledge’s as well as the role of electric energy and mobile phone in their daily lives. While the second is building on an interactionism standpoint and shedding light on redefinition of social relationships. Results show; on one hand, the importance of electric energy, and on the other hand; marriage as practice governed by social norms that recreate cohesion between families through ritual such as gifts witch have seen a big retreat due to the mobile phone uses.

Community in Organizational Research: A Review and an Institutional Logics Perspective

More than a decade ago, Thornton and colleagues added community to the inter-institutional system and argued that the community logic shapes individual and organizational behavior, determines organizing principles, and influences community–organization relationships. In justifying this addition and defining the ideal type, they drew mostly upon the literature on local communities and organizations. However, the increasing relevance of other types of communities to organization studies necessitates a re-examination and further specification of this framework. This article starts with a review of 172 papers from highly ranked organization and management journals over the last 30 years and summarizes insights on four types of communities for which discussion has flourished: communities of place, of practice, of users, and of firms. This is followed by pattern matching to explore whether these four types follow the initial description of the community logic. We find four variants of the community logic, one for each type of community. We show that all the reviewed types organize around a common boundary, which yields a new definition of the community logic. This commonality also offers scope for comparative research and reconceptualization of community–organization relationships. Furthermore, by specifying the organizing principles that vary, we extend previous research and explicate the main underpinnings of community organizing. The paper ends by suggesting avenues for future research that further embrace an institutional logics perspective on communities.

Формулы, выражающие тотальную нестабильность истинностных значений формул

In this short paper we consider problem of nonstable truth values of formulas. We investigate temporal-modal logic for description of reliability information. The logic itself is generated by rather standard models on linear time. We consider intervals of nonstable truth values of formulas. This mean that the formula permanently and for a reasonably big time change its truth from true to false and vice versa. We aim to construct some technique and to find an algorithm which may recognize permanently nonstable formulas.

Consequence-based Axiom Pinpointing for Expressive Description Logic Ontologies

Consequence-based Axiom Pinpointing for Expressive Description Logic Ontologies

Фіскально-регулююча роль рентної плати в Україні

Resource rent taxation is an instrument of state regulation designed to stimulate natural resource users to minimize the loss of natural resources during their extraction and involvement in economic circulation, to ensure their rational use. Together with the performance of the regulatory function, resource rent taxation should be a significant source of income for the state budget. The purpose of the article is to highlight the current problems of resource rent taxation in Ukraine from the standpoint of its fiscal and regulatory role, to formulate proposals of an applied nature regarding the improvement of taxation of natural resources in the conditions of the intensification of European integration and martial law. The following general scientific and special methods were used in the research process: logical analysis, synthesis, expert evaluation, description, comparison, theoretical generalization and abstract-logical. The current state of distribution of resource rent taxation to state and local budgets is highlighted. It is also revealed that the State Budget of Ukraine accumulates the main part of resource rent taxation. The fiscal role of the resource rent taxation in the revenues of the Consolidated Budget of Ukraine in general and in terms of individual payments, in particular, is analyzed. It has been proven that the resource rent taxation remains one of the few mandatory payments that increase revenues and ensure the fulfillment of planned indicators. The main changes in the mechanism of accrual and payment of resource rent taxation in Ukraine are highlighted. It was established that resource rent taxation does not ensure rational use of natural resources. It was concluded that the reform of resource rent taxation should be based on the differentiation of rates depending on the objects of taxation, taking into account objective assessments of the productivity of sources of natural resources. At the same time, it is necessary to focus on ensuring optimal profitability indicators of economic entities that use natural resources, especially in strategically important areas, such as gas or oil production.

Defeasible RDFS via rational closure

In the field of non-monotonic logics, the notion of Rational Closure (RC) is acknowledged as a notable approach. In recent years, RC has gained popularity in the context of Description Logics (DLs), the logic underpinning the standard semantic Web Ontology Language OWL 2, whose main ingredients are classes, the relationship among classes and roles, which are used to describe the properties of classes.In this work, we show instead how to integrate RC within the triple language RDFS (Resource Description Framework Schema), which together with OWL 2 is a major standard semantic web ontology language.To do so, we start from ρdf, a minimal, but significant RDFS fragment that covers the essential features of RDFS, and then extend it to ρdf⊥, allowing to state that two entities are incompatible/disjoint with each other. Eventually, we propose defeasible ρdf⊥ via a typical RC construction allowing to state default class/property inclusions.Furthermore, to overcome the main weaknesses of RC in our context, i.e., the “drowning problem” (viz. the “inheritance blocking problem”), we further extend our construction by leveraging Defeasible Inheritance Networks (DIN) defining a new non-monotonic inference relation that combines the advantages of both (RC and DIN). To the best of our knowledge this is the first time of such an attempt.In summary, the main features of our approach are: (i) the defeasible ρdf⊥ we propose here remains syntactically a triple language by extending it with new predicate symbols with specific semantics; (ii) the logic is defined in such a way that any RDFS reasoner/store may handle the new predicates as ordinary terms if it does not want to take account of the extra non-monotonic capabilities; (iii) the defeasible entailment decision procedure is built on top of the ρdf⊥ entailment decision procedure, which in turn is an extension of the one for ρdf via some additional inference rules favouring a potential implementation; (iv) the computational complexity of deciding entailment in ρdf and ρdf⊥ are the same; and (v) defeasible entailment can be decided via a polynomial number of calls to an oracle deciding ground triple entailment in ρdf⊥ and, in particular, deciding defeasible entailment can be done in polynomial time.

Table interpretation of the temporal description logic LTLALC

Description logics are widely used to describe and represent knowledge in the Semantic Web. This is a modern and powerful mechanism that provides the possibility of extracting knowledge from already existing ones. Thanks to this, conceptual of subject areas modeling has become one of the fields of application of descriptive logics, taking into account the use of inference mechanisms. Conceptual modeling is used to create databases and knowledge bases. A key issue of the subject area modeling is the ability to monitor the dynamics of changes in the state of the subject area over time. It is necessary to describe not only the current actual state of the database (knowledge bases), but also the background. Temporal descriptive logics are used to solve this problem. They have the same set of algorithmic problems that are presented in conventional descriptive logics, but to them are added questions related to the description of knowledge in time. This refers to the form of time (continuous or discrete), time structure (moments of time, intervals, chains of intervals), time linearity (linear or branched), domain (present, past, future), the concept of “now”, the method of measurement, etc. An urgent task today is to create an algorithm for the temporal interpretation of conventional descriptive logics. That is, to show a way in which temporal descriptive logic can be applied to ordinary descriptive logic. The paper presents an algorithm for temporal interpretation of LTL into ALC. Linear, unbranched time is chosen for the description goal. It is presented in the form of a whole temporal axis with a given linear order on it. Only the future tense is considered. The algorithm contains graphic notations of LTL application in ALC: concepts, concept constructors, roles, role constructors, TBox and ABox. Numerous examples are used to illustrate the application of the algorithm.

Застосування дескриптивних логік з конкретними доменами до вирішення задач виявлення та композиції семантичних веб сервісів

This research is one of the branches of a general scientific and applied problem, namely, the problem of using and developing ontological approaches with descriptive logics (DL) apparatus to obtain the effective automated solution of complex business task based on service-oriented architecture. The base idea of the proposed method is the maximal ontologization, that is, all aspects of the task are determined by means of DL ontologies. The proposed ontology system is based on five basic types of ontologies, namely: (1) an ontology of general entities for defining the characteristics of the service’s context, (2) an ontology of the application domain to formalize and unify semantical descriptions of web services, (3) the top-level ontology of web services for the DL formalization of the definition of the web services in general, (4) the ontologies of the web services tasks, which provide a formal representation of the tasks on all stages of web services life cycle, and (5) the ontologies of specific web services. All listed ontologies are related. Such, ontologies of the last type include links to all other above-mentioned ontologies and, together with them, provide a unified formally defined semantic resource, which enables the automatic solution of web service tasks. The focus of this study is the applying descriptive logics with concrete domains to the formalization of such basic semantic web services tasks as the web services discovery and composition. In this article, the ontologies of the web services tasks are defined as an extension of the general top-level web service ontology with special complex concepts. Their elements are pairs of “web service-goal (request)”/”web service-web service”, which are compared according to the task being solved. Also, on their basis, special complex concepts are determined, which specify a set of found similarities between existing services and a goal in the discovery task, or «predecessor-follower» type responsibilities of web services to build a composite service. The proposed TBox statements are constructed using descriptive logic with concrete domains 𝓐𝓛𝓒(𝓓). For this purpose, a concrete domain is defined as a pair of sets: (1) the union of sets of possible subsets of the set of individuals of the Parameter concept and possible subsets of the set of individuals of the Context concept, and (2) a set of predicates defined on it. Such definition of the concrete domain provides possibility of using only functional roles to construct the DL statements of complex concepts DiscoveryServices and CompositionObject for determining corresponding web services tasks. Note, the defined tasks and web services ontologies cover only simplified model of the representation of web services, in particular, functional Input/Output model extended by contexts descriptions. They provide the basis for further improvement by expanding this model and involving additional characteristics of both functional and process models of representation to the specified task ontologies. This will certainly increase the accuracy of the obtained result, but is the subject of further research.

The concept and evaluating of big data quality in the semantic environment

Big data refers to large volumes, complex data sets with various autonomous sources, characterized by continuous growth. Data storage and data collection capabilities are now rapidly expanding in all fields of science and technology due to the rapid development of networks. Evaluating the quality of data is a difficult task in the context of big data, because the speed of semantic data reasoning directly depends on its quality. The appropriate strategies are necessary to evaluate and assess data quality according to the huge amount of data and its rapid generation. Managing a large volume of heterogeneous and distributed data requires defining and continuously updating metadata describing various aspects of data semantics and its quality, such as conformance to metadata schema, provenance, reliability, accuracy and other properties. The article examines the problem of evaluating the quality of big data in the semantic environment. The definition of big data and its semantics is given below and there is a short excursion on a theory of quality assessment. The model and its components which allow to form and specify metrics for quality have already been developed. This model includes such components as: quality characteristics; quality metric; quality system; quality policy. A quality model for big data that defines the main components and requirements for data evaluation has already been proposed. In particular, such evaluation components as: accessibility, relevance, popularity, compliance with the standard, consistency, etc. are highlighted. The problem of inference complexity is demonstrated in the article. Approaches to improving fast semantic inference through materialization and division of the knowledge base into two components, which are expressed by different dialects of descriptive logic, are also considered below. The materialization of big data makes it possible to significantly speed up the processing of requests for information extraction. It is demonstrated how the quality of metadata affects materialization. The proposed model of the knowledge base allows increasing the qualitative indicators of the reasoning speed.

Design Ontology Supporting Model-Based Systems Engineering Formalisms

Model-based systems engineering (MBSE) provides an important capability for managing the complexities of system development. MBSE empowers the formalism of system architectures for supporting model-based requirement elicitation, specification, design, development, testing, fielding, etc. However, the modeling languages and techniques are heterogeneous, even within the same enterprise system, which leads to difficulties for data interoperability. The discrepancies among data structures and language syntaxes make information exchange among MBSE models more difficult, resulting in considerable information deviations when connecting data flows across the enterprise. Therefore, this article presents an ontology based upon <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">graphs</i> , <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">objects</i> , <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">points</i> , <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">properties</i> , <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">roles</i> , and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">relationships</i> with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">extensions</i> (GOPPRRE), providing metamodels that support the various MBSE formalisms across lifecycle stages. In particular, knowledge graph models are developed to support unified model representations to further implement ontological data integration based on GOPPRRE throughout the entire lifecycle. The applicability of the MBSE formalism is verified using quantitative and qualitative approaches. Moreover, the GOPPRRE ontologies are used to create the MBSE formalisms in a domain-specific modeling tool, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">MetaGraph</i> , for evaluating its availability. The results demonstrate that the proposed ontology supports the formal structures and descriptive logic of the systems engineering lifecycle.

Dialectica logical principles: not only rules

Abstract Gödel’s Dialectica interpretation was designed to obtain the consistency of Peano arithmetic via a proof of consistency of Heyting arithmetic and double negation. In recent years, proof theoretic transformations (the so-called proof interpretations) based on Gödel’s Dialectica interpretation have been used systematically to extract new content from proofs and so the interpretation has found relevant applications in several areas of mathematics and computer science. Following our previous work on ‘Gödel fibrations’, we present a (hyper)doctrine characterization of the Dialectica, which corresponds exactly to the logical description of the interpretation. To show that, we derive the soundness of the interpretation of the implication connective, as expounded on by Spector and Troelstra, in the categorical model. This requires extra logical principles, going beyond intuitionistic logic, namely Markov Principle and the Independence of Premise principle, as well as some choice. We show how these principles are satisfied in the categorical setting, establishing a tight (internal language) correspondence between the logical system and the categorical framework. We make sure that this tight correspondence extends to the use of the principles above, instead of the weaker rules we had proved earlier on. This tight correspondence should come handy not only when discussing the traditional applications of the Dialectica but also when dealing with newer uses in modelling games or concurrency theory.

Conjunctive Queries: Unique Characterizations and Exact Learnability

We answer the question of which conjunctive queries are uniquely characterized by polynomially many positive and negative examples and how to construct such examples efficiently. As a consequence, we obtain a new efficient exact learning algorithm for a class of conjunctive queries. At the core of our contributions lie two new polynomial-time algorithms for constructing frontiers in the homomorphism lattice of finite structures. We also discuss implications for the unique characterizability and learnability of schema mappings and of description logic concepts.

The long twentieth century?

The paper describes the historical and intellectual foundations on which the European political system was built after the Second World War; this system pursued the goal to prevent any war in Europe, but proved unable to prevent the russian-Ukrainian war. The paper shows that this system was built not only because of the trauma of the First and Second World Wars, but also in accord- ance with the liberal attitude to war, which M. Vatter called «war with “war”»; at the same time, such a clear attitude does not refer to real wars, but to an imaginary «war of all against all». Based on the analysis of the principles and results of the research project “War and Society” under the direction of J. Baechler, the author outlines the principles of liberal Realpolitik as the implementation of the mentioned attitude in the realm of wars: it consists in their rationalization both at the level of goals and at the level of means of warfare; such a rationalization finally makes war irrational and unacceptable. From the point of view of such Realpolitik, war is only an extraordinary means of politics, and the russian-Ukrainian war is only an excess of violence, while in the opinion of the author, it is an inevitable consequence of the irrational and violent russian-Ukrainian extrapolitical conflict, whose stakes is the existence self of Ukraine. The author believes that one of the reasons for the inability of the European political system to prevent the russian-Ukrainian war is the belief that with the end of the Cold War, the “century of total war” in Europe also ended, and that the economic and cultural integration of post-communist countries into the European space makes such conflicts impossible. The author refers to the description of the own logic of wars of the 20th century, proposed in R. Aron’s book «The century of total war», and suggests considering the russian-Ukrainian war as a continuation of these wars. In the perspective pro- posed by R. Aron, the mentioned «century of total war» can be considered as a «long 20th century», which continues to this day.

DD-KARB: data-driven compliance to quality by rule based benchmarking

The problem of compliance checking and assessment is to ensure that the design or implementation of a system meets some desired properties and complies with some rules or regularities. This problem is a key issue in several human and engineering application domains such as organizational management and e-governance, software and IT industries, and software and systems quality engineering. To deal with this problem, some different approaches and methods have been proposed. In addition to the approaches such as formal methods, mathematical proofs, and logical evaluations, benchmarking can be used for compliance assessment. Naturally, a set of benchmarks can shape an applied solution to compliance assessment. In this paper we propose KARB solution system, i.e. keeping away compliance Anomalies through Rule-based Benchmarking. In fact, in our proposed method the rule-based benchmarking means evaluating the conformity of an under-compliance system to a set of rules. In this solution approach, the under-compliance system is specified symbolically (using formal and logical descriptions). Also, the desired rules are specified formally as the semantic logic in the evaluation process. After reviewing the proposed method, a case study was conducted to demonstrate and analyze the KARB solution. The IR-QUMA study (Iranian Survey on Quality in Messenger Apps) was then conducted to evaluate the quality of some messenger applications. According to the evaluation results, the hybrid DD-KARB method (with a combination of semantics-awareness and data-drivenness) is more effective than solo methods and can compute a good estimation for the messenger application user quality scores. Therefore, DD-KARB can be considered as a method for quality benchmarking in this technical context.