All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

60 058 (0,486s)

Result

On Boolean subrings of rings

We characterize all Boolean subrings of a given ring whose elements are of a finite order. The characterization depends on the order of elements and the characteristic of the ring....

BA - Obecná matematika

  • 2014
  • C
Result

On Random Orderings of Variables for Parity Ordered Binary decision Diagrams.

It is proved that for every Boolean function, the expected size of its representation using Parity OBDD with a random ordering of the variables and the size of such a representation for the worst ordering are polynomialy re...

BA - Obecná matematika

  • 2000
  • Jx
Result

Free Boolean algebras over unions of two well orderings

Given a partially ordered set P there exists the most general Boolean algebra (F) over cap (P) which contains P as a generating set, called the free Boolean algebra over P. We study free Boolean algebras over poset...

BA - Obecná matematika

  • 2009
  • Jx
Result

Between Path-Consistency and Higher Order Consistencies in Boolean Satisfiability

The task of enforcing certain level of consistency in Boolean satisfiability problem (SAT problem) is addressed in this paper. A recently developed concept of modified variant of path-consistency (PC) is recalled and experimentally evaluated...

JD - Využití počítačů, robotika a její aplikace

  • 2011
  • O
Result

Boolean-Like and Frequentistic Semantics for First-Order Predicate Calculus without Functions.

A nonstandard evaluation of the classical first-ordered predicate language without functions is proposed and investigated. This evaluation meets the properties of probability and possibility measures with respect to nonstandard operations wi...

BA - Obecná matematika

  • 2001
  • Jx
Result

Boolean and distributive ordered sets: characterization and representation by sets

BA - Obecná matematika

  • 1995
  • Jx
Result

Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms

Each clone C on a fixed base set A induces a quasi-order on the set of all of Boolean functions by hypergraphs and hypergraph homomorphisms, it is shown that a clone C on {0, 1} has the property that the corresponding C-minor partia...

BA - Obecná matematika

  • 2010
  • Jx
Result

Ordered prime spectra of bounded DRl-monoids

Ordered prime spectra of Boolean products of bounded commutative DRl-monoids are described by means of their decompositions of the prime spectra of the components....

BA - Obecná matematika

  • 2000
  • Jx
Result

Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure

In order to facilitate automated reasoning about large Boolean combinations of non-linear arithmetic constraints involving transcendental functions, we provide a tight integration of recent SAT solving techniques with interval-based...

BA - Obecná matematika

  • 2007
  • Jx
Result

Boolean deductive systems of bounded commutative residuated l-monoids

Bounded commutative residuated lattice ordered monoids (Rl-monoids) generalize, among others, BL-algebras (i.e. algebras of the basic fuzzy logic) and Heyting algebras. In the paper, properties of implicative, Boolean and MV deducti...

BA - Obecná matematika

  • 2005
  • D
  • 1 - 10 out of 60 058