A List of 100 Theorems Today highly nontrivial mathematics is routinely being encoded in the computer, ensuring a reliability that is orders of a magnitude larger than if one had just used human minds. Such an encoding is called a formalization, and a program that checks such a formalization for correctness is called a proof assistant. Suppose you have proved a theorem and you want to make cert...

In this paper, we present a formalization for a logic programming multi-agent system in mobile environments. Such a system consists of a number of agents connected via wire or wireless communication channels, and we model the interactions between agents in our formalization. Agents communicate with each other by passing answer sets obtained by updating the information received from connected ag...

This article empirically investigates the role of organizational structure in the transformational leadership (TFL) process. We examine organizational centralization, formalization, and size as antecedents of an organization's TFL climate, and as moderators of the relationship between TFL climate and productive organizational energy (POE). Hypotheses are tested using a sample of 125 organizatio...

Distinguishing objective(OBJ) semantic from subjective(SUBJ) semantic is essential to information processing of either explicit design formalization or implicit natural language(NL) communication of projects’ implementation. We summarized our past experience of solutions for semantic knowledge management projects. An adopted hypothesis is that among the tremendous and rapid increasing informati...

In this paper we explore the use of Answer Set Programming (ASP) to formalize, and reason about, psychological knowledge. In the field of psychology, a considerable amount of knowledge is still expressed using only natural language. This lack of a formalization complicates accurate studies, comparisons, and verification of theories. We believe that ASP, a knowledge representation formalism allo...

Existing work on formalizing inheritance suuers from two signiicant drawbacks. On the one hand, the formalization is often nonlocal, in that the translation from the inheritance hierarchy into the relevant declarative language requires a complete examination of the topology of the graph being considered. On the other hand, the formalization frequently uses an inference technique or axiomatizati...

The ray-scene intersection test is the most costly process when a scene is rendered. This process may be improved using any strategy to be able to speed-up it. Generally, any strategy used is based on the building of a spatial indexing in the scene domain or in the rays domain. In this paper, an acceleration techniques formalization is proposed. This formalization allows an optimizer to be spec...

This paper presents a formalization of a subset of the BPMN 2.0 execution semantics in terms of graph rewrite rules. The formalization is supported by graph rewrite tools and implemented in one of these tools, called GrGen. The benefit of formalizing the execution semantics by means of graph rewrite rules is that there is a strong relation between the execution semantics rules that are informal...

The ray-scene intersection test is the most costly process when a scene is rendered. This process may be improved using any strategy to be able to speed-up it. Generally, any strategy used is based on the building of a spatial indexing in the scene domain or in the rays domain. However, there is no theory to formalize these techniques. In this paper, an acceleration techniques formalization is ...

The article is devoted to the scientific development of Glushkov Institute Cybernetics National Academy Sciences Ukraine on application algebraic and insertional modeling technologies created basis behavioral algebra. Technologies formalization, verification, testing software hardware specifications within model-driven method are considered. use in biological research, systems based blockchain ...