M.J.H. Heule | TU Delft Repository

Software model synthesis using satisfiability solvers

Journal article (2013) - M.J.H. Heule (author) , SE Verwer (author)

Automated Reencoding of Boolean Formulas

Inprocessing Rules

Simulating Circuit-Level Simplifications on CNF

Concurrent Cube-and-Conquer

Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads

Efficient CNF Simplification based on Binary Implication Graphs

Reusing the Assignment Trail in CDCL Solvers

EagleUP: Solving Random 3-SAT using SLS with Unit Propagation

Conference paper (2011) - O Gableske (author) , M.J.H. Heule (author)

Between Restarts and Backjumps

Exact DFA Identification Using SAT Solvers

Conference paper (2010) - M.J.H. Heule (author) , S.E. Verwer (author)

Clause Elimination Procedures for CNF Formula

Internal Symmetry

Conference paper (2010) - M.J.H. Heule (author) , T Walsh (author)

Covered Clause Elimination

Blocked Clause Elimination

Symmetry within Solutions

Conference paper (2010) - M.J.H. Heule (author) , T Walsh (author)

Symbiosis of Search and Heuristics for Random 3-SAT

Look-Ahead Based SAT Solvers

Book chapter (2009) - M.J.H. Heule (author) , H. van Maaren (author)

Using a satisfiability solver to identify deterministic finite state automata

Conference paper (2009) - M.J.H. Heule (author) , S.E. Verwer (author)

Dynamic Symmetry Breaking by Simulating Zykov Contraction