#### Filter Results:

- Full text PDF available (27)

#### Publication Year

2000

2016

- This year (0)
- Last 5 years (12)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Niklas Eén, Niklas Sörensson
- SAT
- 2003

- Niklas Eén, Niklas Sörensson
- JSAT
- 2006

In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be handled by a standard SAT-solver. We show that by applying a proper mix of translation techniques, a SAT-solver can perform on a par with the best existing native pseudo-boolean… (More)

- Niklas Eén, Armin Biere
- SAT
- 2005

Preprocessing SAT instances can reduce their size considerably. We combine variable elimination with subsumption and selfsubsuming resolution, and show that these techniques not only shrink the formula further than previous preprocessing efforts based on variable elimination, but also decrease runtime of SAT solvers substantially for typical industrial SAT… (More)

- Niklas Eén, Niklas Sörensson
- Electr. Notes Theor. Comput. Sci.
- 2003

- Niklas Eén, Alan Mishchenko, Robert K. Brayton
- FMCAD
- 2011

Last spring, in March 2010, Aaron Bradley published the first truly new bit-level symbolic model checking algorithm since Ken McMillan’s interpolation based model checking procedure introduced in 2003. Our experience with the algorithm suggests that it is stronger than interpolation on industrial problems, and that it is an important algorithm to study… (More)

- Parosh Aziz Abdulla, Per Bjesse, Niklas Eén
- TACAS
- 2000

In this report we present an implementation of a symbolic reachability analyzer, FIXIT, based on SAT-methods. The problem of reachability is to determine for a given transition system, whether a set of bad states is reachable from a set of initial states. We call our approach symbolic, as we use formulas to represent set of states. The representation… (More)

- Alan Mishchenko, Satrajit Chatterjee, Robert K. Brayton, Niklas Eén
- 2006 IEEE/ACM International Conference on…
- 2006

The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulation and BDD/SAT sweeping on the input side (i.e. proving equivalence of some internal nodes in a topological order), interleaved with attempts to run SAT on the output (i.e.… (More)

- Niklas Eén, Alan Mishchenko, Niklas Sörensson
- SAT
- 2007

SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the SAT solver technology, for example, perfecting heuristics for variable ordering, and (2) by inventing new ways of constructing simpler SAT problems, either using domain specific… (More)

We study the effectiveness of neural sequence models for premise selection in automated theorem proving, one of the main bottlenecks in the formalization of mathematics. We propose a two stage approach for this task that yields good results for the premise selection task on the Mizar corpus while avoiding the handengineered features of existing… (More)

Satisfiability solving, the problem of deciding whether the variables of a propositional formula can be assigned in such a way that the formula evaluates to true, is one of the classic problems in computer science. It is of theoretical interest because it is the canonical NP-complete problem. It is of practical interest because modern SAT-solvers can be… (More)