In this paper we investigate document ranking methods in thesaurus-based boolean retrieval systems, and propose a new thesaurus-based ranking algorithm called the Extended Relevance (E-Relevance) algorithm. The E-Relevance algorithm integrates the extended boolean model and the thesaurus-based relevance algorithm. Since the E-Relevance algorithm has all the desirable properties of the extended ...

17] E. Morreale. Recursive operators for prime implicant and irredundant normal form determination. A calculus and an algorithm for the multiple-output 2-level minimization problem. A new method for solving large Satissability problems. A new algorithm for generating prime implicants. 7] J.F. Gimpel. A method of producing a boolean function having an arbitrarily prescribed prime implicant table...

We introduce the notion of Boolean measure algebra. It can be described shortly using some standard notations and terminology. If B is any Boolean algebra, let B N denote the algebra of sequences (xn); xn 2 B: Let us write p k 2 B N the sequence such that p k (i) = 1 if i k and p k (i) = 0 if k < i: If x 2 B, denote by x 2 B N the constant sequence x = (x; x; x; : : :): We deene a Boolean measu...

Methods for modeling cellular regulatory networks as diverse as differential equations and Boolean networks co-exist, however, without much closer correspondence to each other. With the example system of the fission yeast cell cycle control network, we here discuss these two approaches with respect to each other. We find that a Boolean network model can be formulated as a specific coarse-graine...

In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive and conjunctive Boolean equation systems. Based on this we devise a mapping from Boolean equation systems with alternating fixed points to normal logic programs such that the solution of a given variable of an equation system ...

Pseudo-Boolean constraints are a special form of nite domain constraints where all variables are deened over the domain f0; 1g. To solve pseudo-Boolean constraints, specialized constraint solving algorithms have been developed. In this paper, we compare nite domain and pseudo-Boolean constraint techniques on a classical application of nite domain constraint programming, the warehouse location p...

In a previous work [9] two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the Crofton cell of the Poisson hyperplane process (see e.g. [4]). In this paper, we investigate the second-order term in this convergence when the two-dimensional Boolean model and the Poisson line pro...

The Boolean model of Wiener sausages is a random closed set that can be thought of as a random collection of parallel neighborhoods of independent Wiener paths in space. It describes e.g. the target detection area of a network of sensors moving according to the Brownian dynamics whose initial locations are chosen in the medium at random. In the paper, the capacity functional of this Boolean mod...