In [6] J. Laird has shown that an infinitary sequential extension of PCF has a fully abstract model in his category of locally boolean domains (introduced in [8]). In this paper we introduce an extension SPCF∞ of his language by recursive types and show that it is universal for its model in locally boolean domains. Finally we consider an infinitary target language CPS∞ for (the) CPS translation...

In this paper we consider the complexity of learning monotone DNF formulae and Boolean circuits in an exact learning model called the teaching assistant model. This model, introduced in one of our earlier works, uses teaching assistant classes for classifying learning problems. Teaching assistant classes are a learning-theoretic analog of complexity classes. We show that monotone DNFs are learn...

This paper proposes a model that predicts the complexity of Boolean functions with only XOR/XNOR min-terms using back propagation neural networks (BPNNs) applied to Binary Decision Diagrams (BDDs). The BPNN model (BPNNM) is developed through the training process of experimental data already obtained for XOR/XNOR-based Boolean functions. The outcome of this model is a unique matrix for the compl...

MOTIVATION Linking the topology of a complex network to its long-term behavior is a basic problem in network theory, which has been on the focus of many recent research publications. To obtain a suitable Boolean model for a biological system, one must analyze the initial model and compare it with other experimental evidence, and if necessary, make adjustments by changing the topology of the wir...

As a computational model to be simulated in a DNA computing context, Boolean circuits are especially interesting because of their parallelism. Simulations in concrete biochemical computing settings have been given by [OR96] and [AD97]. In this paper, we show how to simulate Boolean circuits by finite splicing systems, an abstract model of enzymatic recombination ([Hea87], [Gat94], [Pǎu96a]). We...

Iterated games are well-known in the game theory literature. We study iterated Boolean games. These are games in which players repeatedly choose truth values for Boolean variables they have control over. Our model of iterated Boolean games assumes that players have goals given by formulae of Linear Temporal Logic (LTL), a formalism for expressing properties of state sequences. In order to model...

Model checking is an algorithmic approach for automatically verifying whether a hardware or software system functions correctly. Typically, computation is carried over Boolean algebras using binary decision diagrams (BDDs) or satisfiability (SAT) solvers. In this paper we show that computation for model checking can also be carried over the dual Boolean rings of the Boolean algebras by means of...

The Use of genetic algorithms in the Information retrieval (IR) area, especially in optimizing a user query in Arabic data collections is presented in this paper. Very little research has been carried out on Arabic text collections. Boolean model have been used in this research. To optimize the query using GA we used different fitness functions, different mutation strategies to find which is th...

Boolean operations and feature-based modeling are closely linked domains. For example, several, sometimes many Boolean operations are involved during a feature instantiation or modification. So Boolean combinations are tools used “inside” feature-based modeling and it is interesting to study the way to make these operations faster or less numerous by using the fact that they are applying to fea...

In this paper we provide a mean-field Boolean network model for a signal transduction network of a generic fibroblast cell. The network consists of several main signaling pathways, including the receptor tyrosine kinase, the G-protein coupled receptor, and the Integrin signaling pathway. The network consists of 130 nodes, each representing a signaling molecule (mainly proteins). Nodes are gover...