| An extensible SAT-solver N Eén, N Sörensson International conference on theory and applications of satisfiability …, 2003 | 4347 | 2003 |
| Effective preprocessing in SAT through variable and clause elimination N Eén, A Biere International conference on theory and applications of satisfiability …, 2005 | 945 | 2005 |
| Translating pseudo-boolean constraints into SAT N Eén, N Sörensson Journal on Satisfiability, Boolean Modeling and Computation 2 (1-4), 1-26, 2006 | 857 | 2006 |
| Temporal induction by incremental SAT solving N Eén, N Sörensson Electronic Notes in Theoretical Computer Science 89 (4), 543-560, 2003 | 560 | 2003 |
| Efficient implementation of property directed reachability N Eén, A Mishchenko, R Brayton 2011 Formal Methods in Computer-Aided Design (FMCAD), 125-134, 2011 | 420 | 2011 |
| Minisat v1. 13-a sat solver with conflict-clause minimization N Sorensson, N Een SAT 2005 (53), 1-2, 2005 | 303 | 2005 |
| Symbolic reachability analysis based on SAT-solvers PA Abdulla, P Bjesse, N Eén International Conference on Tools and Algorithms for the Construction and …, 2000 | 281 | 2000 |
| Minisat-a SAT solver with conflict-clause minimization N Een Proc. Theory and Applications of Satisfiability Testing (SAT 05), 2005 | 276 | 2005 |
| Improvements to combinational equivalence checking A Mishchenko, S Chatterjee, R Brayton, N Een Proceedings of the 2006 IEEE/ACM international conference on Computer-aided …, 2006 | 213 | 2006 |
| Deepmath-deep sequence models for premise selection G Irving, C Szegedy, AA Alemi, N Eén, F Chollet, J Urban Advances in neural information processing systems 29, 2016 | 160 | 2016 |
| Applying logic synthesis for speeding up SAT N Eén, A Mishchenko, N Sörensson Theory and Applications of Satisfiability Testing–SAT 2007: 10th …, 2007 | 114 | 2007 |
| DeepMath-deep sequence models for premise selection AA Alemi, F Chollet, N Een, G Irving, C Szegedy, J Urban arXiv preprint arXiv:1606.04442, 2016 | 110 | 2016 |
| The minisat page N Eén http://minisat. se/, 2006 | 103 | 2006 |
| MiniSat N Een, N Sörensson | 85 | 2007 |
| A single-instance incremental SAT formulation of proof-and counterexample-based abstraction N Eén, A Mishchenko, N Amla Formal Methods in Computer Aided Design, 181-188, 2010 | 61 | 2010 |
| Minisat 2.1 and minisat++ 1.0-sat race 2008 editions N Sörensson, N Eén SAT, 31, 2009 | 59 | 2009 |
| SAT-solving in practice K Claessen, N Een, M Sheeran, N Sorensson 2008 9th International Workshop on Discrete Event Systems, 61-67, 2008 | 52 | 2008 |
| Mapping into LUT structures S Ray, A Mishchenko, N Een, R Brayton, S Jang, C Chen 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE …, 2012 | 50 | 2012 |
| SAT-solving in practice, with a tutorial example from supervisory control K Claessen, N Een, M Sheeran, N Sörensson, A Voronov, K Åkesson Discrete Event Dynamic Systems 19, 495-524, 2009 | 42 | 2009 |
| Minisat v2. 0 (beta) N Een, N Sörensson Solver description, SAT race 2006, 2006 | 26 | 2006 |
Armin BiereProfessor of Computer Science, University of Freiburg在 informatik.uni-freiburg.de 的电子邮件经过验证
