It is known that implications in powerset-based closure systems correspond to Horn approximations in propositional logic frameworks. Here we focus on the problem of implications between injective partial orders. We set up the definitions that allow one to apply standard constructions of implications, and formally characterize the propositional theory obtained. We describe also some experimental...

Church’s Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence α into an infinite sequence β such that a requirement on (α, β), expressed in monadic second-order logic, is satisfied. We explain how three fundamental techniques of automata theory play together in a solution of Church’s Problem: Determinization (starting from the ...

The inversion method proposed by Glück and Kawabe uses grammar programs as intermediate results that comprise sequences of operations (data generation, matching, etc.). The determinization method used in the inversion method fails for a grammar program of which the collection of item sets causes a conflict even if there exists a deterministic program equivalent to the grammar program. In this p...

A principle is proposed that organizes verbs in the lexicon according to their meaning and the number of arguments they require. This principle, which we call the Paradigmatic Structure, acts as a filter for the permanent lexicon, letting all verb stems into the lexicon but only some morphological derivatives. The effects of the Paradigmatic Structure are observed in blocking, in which some but...

The stochastic shortest path problem (SSP) is a highly expressive model for probabilistic planning. The computational hardness of SSPs has sparked interest in determinization-based planners that can quickly solve large problems. However, existing methods employ a simplistic approach to determinization. In particular, they ignore the possibility of tailoring the determinization to the specific c...

The two determinization procedures of Safra and MullerSchupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.

0

in this paper we study properties of symbols such that these belong to class of symbols sitting insidesm ρ,φ that we shall introduce as the following. so for because hypoelliptic pseudodifferential operatorsplays a key role in quantum mechanics we will investigate some properties of m−hypoelliptic pseudodifferential operators for which define base on this class of symbols. also we consider maxi...

Preconcepts are basic units of knowledge that form the basis formal concepts in concept analysis (FCA). This paper investigates relations among different kinds preconcepts, such as protoconcepts, meet and join-semiconcepts concepts. The first contribution this paper, is to present a fuzzy powerset lattice gradation, coincides with preconcept at its 1-cut. second more significant contribution, i...