Results 261 to 270 of about 11,341,390 (298)

Boolean-Valued Models and Their Applications

The Bulletin of Symbolic Logic, 2022
AbstractBoolean-valued models generalize classical two-valued models by allowing arbitrary complete Boolean algebras as value ranges. The goal of my dissertation is to study Boolean-valued models and explore their philosophical and mathematical applications.In Chapter 1, I build a robust theory of first-order Boolean-valued models that parallels the ...
openaire   +2 more sources

Nested Boolean Functions as Models for Quantified Boolean Formulas

2013
Nested Boolean functions or Boolean programs are an alternative to the quantified Boolean formula (QBF) characterization of polynomial space. The idea is to start with a set of Boolean functions given as propositional formulas and to define new functions as compositions or instantiations of previously defined ones.
Uwe Bubeck, Hans Kleine Büning
openaire   +2 more sources

Reduction of Boolean network models

Journal of Theoretical Biology, 2011
Boolean networks have been successfully used in modelling gene regulatory networks. However, for large networks, analysis by simulation becomes unfeasible. In this paper we propose a reduction method for Boolean networks that decreases the size of the network, while preserving important dynamical properties and topological features.
openaire   +3 more sources

On the Boolean Model of Wiener Sausages

Methodology and Computing in Applied Probability, 2007
Consider a \(d\)-dimensional Brownian path \((W_t)_{t\in[0,T]}\) started at \(0\) and its corresponding Wiener sausage of radius \(r>0\) \[ S_{r,T}=\{y\in \mathbb{R}^d: \|y-W_t\|\leq r\text{ for some }t\in[0,T]\}. \] The Boolean model is the random set \(\Xi\subset\mathbb{R}^d\) obtained as the union of Wiener sausages when each point of a homogeneous ...
Černý, Rostislav, Funken, Stefan, Spodarev, Evgueni   +2 more
openaire   +1 more source

Intensity analysis of Boolean models

Pattern Recognition, 1999
We consider the problem to estimate the intensity of a stationary, but not necessarily isotropic Boolean model Z in d-dimensional space from the observation of global and local functionals. After a short description of the recent solution in the planar case, we show that the spatial case can be solved in a similar way by using an iterated translative ...
openaire   +2 more sources

Boolean Constraints for XML Modeling

2009
The study of integrity constraints has been identified as one of the major challenges in XML database research. The main difficulty is finding a balance between the expressiveness and the existence of automated reasoning tools for different classes of constraints.
Sven Hartmann, Sebastian Link, Thu Trinh
openaire   +2 more sources

BOOLEAN MODELS AND SOME OF THEIR APPLICATIONS

Mathematics of the USSR-Sbornik, 1975
A certain class of models is considered, i.e. sets with relations specifically adapted to solve a number of problems connected with various questions of imbeddings of partially ordered sets in Boolean algebras and distributive lattices. A special place in this class is occupied by a subclass called the class of Boolean models by the author.Bibliography:
openaire   +2 more sources

On Models for Quantified Boolean Formulas

2004
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substituting the existential variables by the Boolean functions results in a true formula. We call a satisfying set of Boolean functions a model.
Hans Kleine Büning, Xishun Zhao
openaire   +1 more source

The Boolean Model and Random Sets

Computer Graphics and Image Processing, 1980
We propose to present the main theorems which govern random set theory by studying one particular random set, namely the Boolean model. After defining the Boolean model X (union of almost surely compact random sets centered at Poisson points in Rn), the probability Q(B) that a given compact set B misses X is calculated.
openaire   +1 more source

GENE ASSEMBLY MODELS AND BOOLEAN CIRCUITS

International Journal of Foundations of Computer Science, 2008
We propose two different ways to simulate Boolean circuits in the framework of ciliate computations, based on the intramolecular and on the intermolecular gene assembly models with contextual operations applied in a maximal parallel manner. In both cases, the running time and the size of resources of the simulating devices are proportional to the ...
Tseren-Onolt Ishdorj, Ion Petre
openaire   +2 more sources