The first-order theory of ordering constraints over feature trees.
The Formalization of Decision-Free Petri Net
In this article we formalize the definition of Decision-Free Petri Net (DFPN) presented in [19]. Then we formalize the concept of directed path and directed circuit nets in Petri nets to prove properties of DFPN. We also present the definition of firing transitions and transition sequences with natural numbers marking that always check whether transition is enabled or not and after firing it only removes the available tokens (i.e., it does not remove from zero number of tokens). At the end of this...
The formation of a tree leaf
In this article, we build a mathematical model to understand the formation of a tree leaf. Our model is based on the idea that a leaf tends to maximize internal efficiency by developing an efficient transport system for transporting water and nutrients. The meaning of “the efficient transport system” may vary as the type of the tree leave varies. In this article, we will demonstrate that tree leaves have different shapes and venation patterns mainly because they have adopted different efficient...
The formulation of the problem of program segmentation in the terms of pseudoboolean programming
The Fourier Analysis of Bezier Curves
The Furthest-Site Geodesic Voronoi Diagram.
The geometry of configuration spaces for closed chains in two and three dimensions.
The globals of pseudovarieties of ordered semigroups containing and an application to a problem proposed by Pin
Given a basis of pseudoidentities for a pseudovariety of ordered semigroups containing the 5-element aperiodic Brandt semigroup , under the natural order, it is shown that the same basis, over the most general graph over which it can be read, defines the global. This is used to show that the global of the pseudovariety of level of Straubing-Thérien’s concatenation hierarchy has infinite vertex rank.
The globals of pseudovarieties of ordered semigroups containing B2 and an application to a problem proposed by Pin
Given a basis of pseudoidentities for a pseudovariety of ordered semigroups containing the 5-element aperiodic Brandt semigroup B2, under the natural order, it is shown that the same basis, over the most general graph over which it can be read, defines the global. This is used to show that the global of the pseudovariety of level 3/2 of Straubing-Thérien's concatenation hierarchy has infinite vertex rank.
The Gödel Completeness Theorem for Uncountable Languages
This article is the second in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [15] for uncountably large languages. We follow the proof given in [16]. The present article contains the techniques required to expand a theory such that the expanded theory contains witnesses and is negation faithful. Then the completeness theorem follows immediately.
The greedy algorithm as a combinatorial principle.
The growth functions of finitely generated semigroups.
The GUHA method and the three-valued logic
The Hamilton circuit problem on grids
The height of -binary search trees.
The HeKatE methodology. Hybrid engineering of intelligent systems
This paper describes a new approach, the HeKatE methodology, to the design and development of complex rule-based systems for control and decision support. The main paradigm for rule representation, namely, eXtended Tabular Trees (XTT), ensures high density and transparency of visual knowledge representation. Contrary to traditional, flat rule-based systems, the XTT approach is focused on groups of similar rules rather than on single rules. Such groups form decision tables which are connected into...
The helping hierarchy
Schöning [14] introduced a notion of helping and suggested the study of the class of the languages that can be helped by oracles in a given class . Later, Ko [12], in order to study the connections between helping and “witness searching”, introduced the notion of self-helping for languages. We extend this notion to classes of languages and show that there exists a self-helping class that we call which contains all the self-helping classes. We introduce the Helping hierarchy whose levels are...
The Helping Hierarchy
Schöning [14] introduced a notion of helping and suggested the study of the class of the languages that can be helped by oracles in a given class . Later, Ko [12], in order to study the connections between helping and "witness searching" , introduced the notion of self-helping for languages. We extend this notion to classes of languages and show that there exists a self-helping class that we call SH which contains all the self-helping classes. We introduce the Helping hierarchy whose levels...
The hyperrings of order 3.
The implementation of the example-based machine translation technique for Norwegian-to-Polish automatic translation system