Marijn Heule
Marijn Heule
Associate Professor of Computer Science, Carnegie Mellon University
Verified email at cs.cmu.edu - Homepage
Title
Cited by
Cited by
Year
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
A Biere, MJH Heule, H van Maaren, T Walsh
IOS Press, 2009
18152009
Inprocessing rules
M Järvisalo, MJH Heule, A Biere
Conference on Automated Deduction (CADE), 355-370, 2012
1762012
Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads
MJH Heule, O Kullmann, S Wieringa, A Biere
Haifa Verification Conference 2011, 2012
1392012
Solving and verifying the boolean pythagorean triples problem via cube-and-conquer
MJH Heule, O Kullmann, VW Marek
International Conference on Theory and Applications of Satisfiability …, 2016
1352016
Blocked clause elimination
M Järvisalo, A Biere, MJH Heule
Tools and Algorithms for the Construction and Analysis of Systems, 129-144, 2010
1332010
DRAT-trim: Efficient checking and trimming using expressive clausal proofs
N Wetzler, MJH Heule, WA Hunt
International Conference on Theory and Applications of Satisfiability …, 2014
1322014
March_eq: Implementing additional reasoning into an efficient look-ahead SAT solver
M Heule, M Dufour, J Van Zwieten, H Van Maaren
Theory and Applications of Satisfiability Testing, 345–359, 2005
1052005
Exact DFA identification using SAT solvers
MJH Heule, S Verwer
International Colloquium on Grammatical Inference, 66-79, 2010
922010
Trimming while checking clausal proofs
MJH Heule, WA Hunt, N Wetzler
2013 Formal Methods in Computer-Aided Design, 181-188, 2013
822013
Clause Elimination Procedures for CNF Formulas.
MJH Heule, M Järvisalo, A Biere
LPAR (Yogyakarta) 6397, 357-371, 2010
812010
Automated reencoding of boolean formulas
N Manthey, MJH Heule, A Biere
Haifa Verification Conference, 102-117, 2012
682012
Efficient CNF simplification based on binary implication graphs
MJH Heule, M Järvisalo, A Biere
International Conference on Theory and Applications of Satisfiability …, 2011
672011
Clause elimination for SAT and QSAT
MJH Heule, M Järvisalo, F Lonsing, M Seidl, A Biere
Journal of Artificial Intelligence Research 53, 127-168, 2015
632015
Look-Ahead Based SAT Solvers.
M Heule, H van Maaren
Handbook of satisfiability 185, 155-184, 2009
602009
A new method to construct lower bounds for van der Waerden numbers
PR Herwig, MJH Heule, PM van Lambalgen, H van Maaren
the electronic journal of combinatorics 14 (1), R6, 2007
602007
SAT competition 2016: Recent developments
T Balyo, MJH Heule, M Jarvisalo
Thirty-First AAAI Conference on Artificial Intelligence, 2017
572017
March_dl: Adding adaptive heuristics and a new branching strategy
MJH Heule, H Van Maaren
Journal on Satisfiability, Boolean Modeling and Computation 2 (1-4), 47-59, 2006
562006
Aligning CNF-and equivalence-reasoning
MJH Heule, H Van Maaren
Theory and Applications of Satisfiability Testing, 145-156, 2005
532005
Verifying refutations with extended resolution
MJH Heule, WA Hunt, N Wetzler
International Conference on Automated Deduction, 345-359, 2013
522013
Simulating circuit-level simplifications on CNF
M Järvisalo, A Biere, MJH Heule
Journal of Automated Reasoning 49 (4), 583-619, 2012
502012
The system can't perform the operation now. Try again later.
Articles 1–20