Marijn Heule

Dikutip oleh

	Semua	Sejak 2020
Kutipan	9262	4872
indeks-h	43	33
indeks-i10	115	85

1200

600

300

900

20082009201020112012201320142015201620172018201920202021202220232024202543 68 138 180 262 361 449 399 481 548 573 730 789 816 844 1060 1190 162

Akses publik

Lihat semua

90 artikel

0 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Armin BiereProfessor of Computer Science, University of FreiburgEmail yang diverifikasi di informatik.uni-freiburg.de
Matti JärvisaloProfessor of Computer Science, University of HelsinkiEmail yang diverifikasi di helsinki.fi
Benjamin Kiesl-ReiterAmazon Web ServicesEmail yang diverifikasi di amazon.de
Martina SeidlUniv.-Prof., JKU LinzEmail yang diverifikasi di jku.at
Warren A. Hunt, JrProfessor of Computer Science, University of TexasEmail yang diverifikasi di cs.utexas.edu
Oliver KullmannSwansea UniversityEmail yang diverifikasi di Swansea.ac.uk
Nathan WetzlerUniversity of Texas at AustinEmail yang diverifikasi di cs.utexas.edu
Martin SudaCzech Technical University in PragueEmail yang diverifikasi di cvut.cz
Randal BryantCarnegie Mellon UniversityEmail yang diverifikasi di cs.cmu.edu
Tomas BalyoFiluta AIEmail yang diverifikasi di filuta.ai
Anton BelovSynopsys Inc.Email yang diverifikasi di belov-mcdowell.com
Ruben MartinsCarnegie Mellon UniversityEmail yang diverifikasi di cs.cmu.edu
Victor MarekProfessor of Computer Science, University of KentuckyEmail yang diverifikasi di cs.uky.edu
John F. MackeyTeaching Professor of Computer Science and Mathematics, Carnegie Mellon UniversityEmail yang diverifikasi di andrew.cmu.edu
Bernardo SubercaseauxCarnegie Mellon UniversityEmail yang diverifikasi di andrew.cmu.edu
Toby WalshProfessor, UNSW and CSIRO Data61Email yang diverifikasi di cse.unsw.edu.au
Sicco VerwerDelft University of TechnologyEmail yang diverifikasi di tudelft.nl
Manuel KauersJohannes Kepler University, Linz, AustriaEmail yang diverifikasi di kauers.de
Siert WieringaEmail yang diverifikasi di siert.nl
Norbert MantheyTU DresdenEmail yang diverifikasi di tu-dresden.de

Ikuti

Marijn Heule

Associate Professor of Computer Science, Carnegie Mellon University

Email yang diverifikasi di cs.cmu.edu - Beranda

Automated Reasoning Formal Verification Parallel Computing SAT


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications A Biere, MJH Heule, H van Maaren, T Walsh IOS Press, 2009	2970	2009
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	331	2016
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	328	2014
Inprocessing rules M Järvisalo, MJH Heule, A Biere Conference on Automated Deduction (CADE), 355-370, 2012	299	2012
Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads MJH Heule, O Kullmann, S Wieringa, A Biere Haifa Verification Conference 2011, 2012	241	2012
Blocked clause elimination M Järvisalo, A Biere, MJH Heule Tools and Algorithms for the Construction and Analysis of Systems, 129-144, 2010	191	2010
Trimming while checking clausal proofs MJH Heule, WA Hunt, N Wetzler 2013 Formal Methods in Computer-Aided Design, 181-188, 2013	177	2013
Exact DFA identification using SAT solvers MJH Heule, S Verwer Grammatical Inference: Theoretical Results and Applications: 10th …, 2010	163	2010
Schur number five M Heule Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018	155	2018
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	144	2017
The science of brute force MJH Heule, O Kullmann Communications of the ACM 60 (8), 70-79, 2017	128	2017
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	124	2005
SAT competition 2016: Recent developments T Balyo, M Heule, M Jarvisalo Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017	123	2017
Verifying refutations with extended resolution MJH Heule, WA Hunt Jr, N Wetzler International Conference on Automated Deduction, 345-359, 2013	123	2013
Automated reencoding of boolean formulas N Manthey, MJH Heule, A Biere Haifa Verification Conference, 102-117, 2012	112	2012
Clause Elimination Procedures for CNF Formulas. MJH Heule, M Järvisalo, A Biere LPAR (Yogyakarta) 6397, 357-371, 2010	109	2010
The sat competition 2014 A Belov, D Diepold, M Heule, M Järvisalo Proc. SAT COMPETITION, 45, 2014	108*	2014
Look-ahead based SAT solvers MJH Heule, H van Maaren Handbook of satisfiability, 155-184, 2009	102	2009
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	98	2015
Efficient CNF simplification based on binary implication graphs MJH Heule, M Järvisalo, A Biere International Conference on Theory and Applications of Satisfiability …, 2011	95	2011

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama