#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2001

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Eugene Goldberg, Yakov Novikov
- Discrete Applied Mathematics
- 2002

We describe a SAT-solver, BerkMin, that inherits suchfeatures of GRASP, SATO, and Chaff as clause recording,fast BCP, restarts, and conflict clause "aging". At thesame time BerkMin introduces a new decision makingprocedure and a new method of clause databasemanagement. We experimentally compare BerkMin withChaff, the leader among SAT-solvers used in the… (More)

- Eugene Goldberg, Yakov Novikov
- DATE
- 2003

As SAT-algorithms become more and more complex, there is little chance of writing a SAT-solver that is free of bugs. So it is of great importance to be able to verify the information returned by a SAT-solver. If the CNF formula to be tested is satisfiable, solution verification is trivial and can be easily done by the user. However, in the case of… (More)

- Yakov Novikov
- DATE
- 2003

We propose a method for local search of Boolean relatio s relating variables of a CNF formula. The method is to branch on small subsets of the set of CNF variables and to analyze results of unit propagation. By taking into account variable value assignments deduced during the unit propagation procedure the method is able to justify any relation represented… (More)

- Liudmila D. Cheremisinova, Yakov Novikov
- Automatic Control and Computer Sciences
- 2010

The verification problem for the case of the description of a functional indeterminacy set by a system of partially specified Boolean functions is considered. The formal approach based on the reduction of the verification problem to a satisfiability test of the conjunctive normal form is suggested. Three approaches to the solution of the verification… (More)

The theory of hierarchical Boolean satisfiability (SAT) solving proposed in this paper is based on a strict axiomatic system and introduces a new important notion of implicativity. The theory makes evident that increasing implicativity is the core of SAT-solving. We provide a theoretical basis for increasing the implicativity of a given SAT instance and for… (More)

- Eugene Goldberg, Yakov Novikov
- SAT
- 2003

- Emmanuel Zarpas, Marco Roveri, +5 authors Monica Farkash
- 2004

- Liudmila D. Cheremisinova, Yakov Novikov
- EWDTS
- 2010

- Yakov Novikov
- 2003

We introduce the notion of a common specification (CS) that is the key to understanding the complexity of equivalence checking. A CS S of functionally equivalent Boolean circuits N1 and N2 is a circuit of multi-valued blocks where N1 and N2 can be obtained from this CS by encoding the values of multi-valued variables of S. We show that the performance of an… (More)

- Yakov Novikov, Eugene Goldberg
- DATE
- 2001

In the paper, we consider the problem of checking whether cubes from a set S are implicants of a DNF formula D, at the same time minimizing the overall time taken by the checks. An obvious but inefficient way of solving the problem is to perform all the checks independently. In the paper, we consider a different approach. The key idea is that when checking… (More)