scispace - formally typeset
Search or ask a question
Author

L. I. Lipkin

Bio: L. I. Lipkin is an academic researcher. The author has contributed to research in topics: Boolean expression & Free Boolean algebra. The author has an hindex of 1, co-authored 1 publications receiving 1 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, an upper estimate for the threshold number for Boolean functions with a predetermined number of zeros and also a lower estimate for almost all of them were obtained. But they did not consider the representation of Boolean functions by disjunctive normal forms.
Abstract: An upper estimate is obtained for the threshold number for Boolean functions with a predetermined number of zeros and also a lower estimate for almost all of them. Analogous estimates are proved for the representation of Boolean functions by disjunctive normal forms.

1 citations


Cited by
More filters
01 Jan 1994
TL;DR: This paper develops a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints, based on the generation of polyhedral cutting planes and the concept of branch-and-cut.
Abstract: In this paper, we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our approach is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case of 0-1 constraints, this can improve or replace the finite domain techniques used in existing constraint logic programming systems.

5 citations