Statistical model in retrieval has been shown to perform well empirically. Extended Boolean model has been widely used in business system for its easiness to be complemented and not bad results. In this paper, a statistical model and modified Boolean model and natural language processing techniques, shallow query understanding techniques are used and results show that even with very limited tra...

1. General remarks Boolean valued analysis is a branch of functional analysis which uses a special model-theoretic technique that is embodied in the Boolean valued models of set theory. The term was coined by G. Takeuti. The invention of Boolean valued models was not connected with the theory of Boolean algebras but rather has revealed a gemstone among the diverse applications of the latter. It...

The quantified boolean formula (QBF) problem is a powerful generalization of the boolean satisfiability (SAT) problem where variables can be both universally and existentially quantified. Inspired by the fruitfulness of the established model for generating random SAT instances, we define and study a general model for generating random QBF instances. We exhibit experimental results showing that ...

BOOLEAN NETWORKS (OR networks of switches) are extremely simple mathematical models of biochemical signaling networks. Under certain circumstances, Boolean networks, despite their simplicity, are capable of predicting dynamical activation patterns of gene regulatory networks in living cells. For example, the temporal sequence of cell cycle activation patterns in yeasts S. pombe and S. cerevisia...

We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To precisely capture this relationship, we introduce the notion of a preferred stable model of a logic program, and define a mapping that associates a normal logic program with a boolean equation system such that the solution to the equation system can be “read off” ...