Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory

To conclude these preliminaries, we recall known fast algorithms for three polynomial matrix subroutines used in our determinant algorithm: multiplication with unbalanced

In this paper we consider a new method of minimization of Boolean functions with n variables in polynomial set-theoretical format (PSTF), based on a procedure of split- ting

The complexity of the corresponding concept satisfiability problems without theories, which are equivalent to the satisfiability problems for the corresponding fragments of

With in mind applications in automated proof checking with verifiers based on the set-theoretic formalism, in this paper we identified the maximal polyno- mial and the

A fragmentation process is a Markov process which describes how an object with given total mass evolves as it breaks into several fragments randomly as time passes. Notice there may

We relate the hybrid composition language HCL(L) to positive quantifier free FO-queries over L, and its fragment without variable sharing in compositions HCL − (L) to unions of

Similarly to the game of chess, statistics games are determined: either Anke or Boris has a winning strategy [2].. 1 Correctness of

Characterizing complexity classes over the reals requires both con- vergence within a given time or space bound on inductive data (a finite approximation of the real number)