Conference Covered Clause Elimination 2013 • EPiC series in computing • 13:41-34 Heule M, Järvisalo M, Biere A
Chapter Guided merging of sequence diagrams 2013 • Lecture Notes in Computer Science • 7745 LNCS:164-183 Widl M, Biere A, Brosch P, Egly U, Heule M, Kappel G, Seidl M, Tompits H
Chapter Mechanical Verification of SAT Refutations with Extended Resolution 2013 • Lecture Notes in Computer Science • 7998:229-244 Wetzler N, Heule MJH, Hunt WAJ
Chapter Revisiting hyper binary resolution 2013 • Lecture Notes in Computer Science • 7874 LNCS:77-93 Heule MJH, Järvisalo M, Biere A
Journal Article Software model synthesis using satisfiability solvers 2013 • Empirical Software Engineering • 18(4):825-856 Heule MJH, Verwer S
Journal Article Symmetry in Gardens of Eden 2013 • Electronic Journal of Combinatorics • 20(3): Hartman C, Heule MJH, Kwekkeboom K, Noels A
Conference Trimming while Checking Clausal Proofs 2013 • 2013 FORMAL METHODS IN COMPUTER-AIDED DESIGN (FMCAD) • 181-188 Heule MJH, Hunt WAJ, Wetzler N
Chapter Verifying refutations with extended resolution 2013 • Lecture Notes in Computer Science • 7898 LNAI:345-359 Heule MJH, Hunt WA, Wetzler N
Chapter Concurrent Cube-and-Conquer 2012 • Lecture Notes in Computer Science • 7317:475-476 van der Tak P, Heule MJH, Biere A
Conference Concurrent cube-and-conquer (Poster presentation) 2012 • Lecture Notes in Computer Science • 7317 LNCS:475-476 Van Der Tak P, Heule MJH, Biere A
Chapter Cube and conquer: Guiding CDCL SAT solvers by lookaheads 2012 • Lecture Notes in Computer Science • 7261 LNCS:50-65 Heule MJH, Kullmann O, Wieringa S, Biere A
Chapter Inprocessing rules 2012 • Lecture Notes in Computer Science • 7364 LNAI:355-370 Järvisalo M, Heule MJH, Biere A
Journal Article Simulating Circuit-Level Simplifications on CNF 2012 • Journal of Automated Reasoning • 49(4):583-619 Jarvisalo M, Biere A, Heule MJH
Chapter Between Restarts and Backjumps 2011 • Lecture Notes in Computer Science • 6695:216-229 Ramos A, van der Tak P, Heule MJH
Chapter EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation 2011 • Lecture Notes in Computer Science • 6695:367-368 Gableske O, Heule MJH
Chapter Efficient CNF Simplification Based on Binary Implication Graphs 2011 • Lecture Notes in Computer Science • 6695:201-215 Heule MJH, Jarvisalo M, Biere A
Journal Article Introduction to Mathematics of Satisfiability, Victor W. Marek, Chapman & Hall/CRC, 2009. Hardback, ISBN-13: 978-143980167-3, $89.95. 2011 • Theory and Practice of Logic Programming • 11(1):126-130 Heule M
Chapter Blocked Clause Elimination 2010 • Lecture Notes in Computer Science • 6015:129-+ Jarvisalo M, Biere A, Heule M
Chapter Clause Elimination Procedures for CNF Formulas 2010 • Lecture Notes in Computer Science • 6397:357-+ Heule M, Jarvisalo M, Biere A
Chapter Exact DFA Identification Using SAT Solvers 2010 • Lecture Notes in Computer Science • 6339:66-79 Heule MJH, Verwer S
Conference Symmetry within Solutions 2010 • Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010 • 77-82 Heule M, Walsh T
Conference Symmetry within Solutions 2010 • Proceedings of the ... AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence • 77-82 Heule M, Walsh T
Chapter Dynamic Symmetry Breaking by Simulating Zykov Contraction 2009 • Lecture Notes in Computer Science • 5584:223-236 Schaafsma B, Heule MJH, van Maaren H
Book Handbook of Satisfiability: Preface 2009 • Frontiers in Artificial Intelligence and Applications • 185(1): Biere A, Heule M, Maaren HV, Walsh T
Journal Article Look-Ahead Based SAT Solvers 2009 • Frontiers in Artificial Intelligence and Applications • 185:155-184 Heule MJH, van Maaren H
