Folgen
Marijn Heule
Marijn Heule
Associate Professor of Computer Science, Carnegie Mellon University
Bestätigte E-Mail-Adresse bei cs.cmu.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
A Biere, MJH Heule, H van Maaren, T Walsh
IOS Press, 2009
29092009
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
3212016
DRAT-trim: Efficient checking and trimming using expressive clausal proofs
N Wetzler, MJH Heule, WA Hunt Jr
International Conference on Theory and Applications of Satisfiability …, 2014
3162014
Inprocessing rules
M Järvisalo, MJH Heule, A Biere
Conference on Automated Deduction (CADE), 355-370, 2012
2912012
Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads
MJH Heule, O Kullmann, S Wieringa, A Biere
Haifa Verification Conference 2011, 2012
2392012
Blocked clause elimination
M Järvisalo, A Biere, MJH Heule
Tools and Algorithms for the Construction and Analysis of Systems, 129-144, 2010
1892010
Trimming while checking clausal proofs
MJH Heule, WA Hunt, N Wetzler
2013 Formal Methods in Computer-Aided Design, 181-188, 2013
1742013
Exact DFA identification using SAT solvers
MJH Heule, S Verwer
Grammatical Inference: Theoretical Results and Applications: 10th …, 2010
1632010
Schur number five
M Heule
Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018
1522018
Efficient certified RAT verification
L Cruz-Filipe, MJH Heule, WA Hunt, M Kaufmann, P Schneider-Kamp
Automated Deduction–CADE 26: 26th International Conference on Automated …, 2017
1352017
SAT competition 2016: Recent developments
T Balyo, M Heule, M Jarvisalo
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
1232017
The science of brute force
MJH Heule, O Kullmann
Communications of the ACM 60 (8), 70-79, 2017
1222017
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
1222005
Verifying refutations with extended resolution
MJH Heule, WA Hunt Jr, N Wetzler
International Conference on Automated Deduction, 345-359, 2013
1162013
Automated reencoding of boolean formulas
N Manthey, MJH Heule, A Biere
Haifa Verification Conference, 102-117, 2012
1132012
The sat competition 2014
A Belov, D Diepold, M Heule, M Järvisalo
Proc. SAT COMPETITION, 45, 2014
111*2014
Clause Elimination Procedures for CNF Formulas.
MJH Heule, M Järvisalo, A Biere
LPAR (Yogyakarta) 6397, 357-371, 2010
1092010
Look-ahead based SAT solvers
MJH Heule, H van Maaren
Handbook of satisfiability, 155-184, 2009
1042009
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
972015
Efficient CNF simplification based on binary implication graphs
MJH Heule, M Järvisalo, A Biere
International Conference on Theory and Applications of Satisfiability …, 2011
952011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20