Marijn J. H. Heule

Research Fellow
Department of Computer Sciences
The University of Texas at Austin

office:	GDC building, room 7.714
email:	firstname at cs dot utexas dot edu
homepage:	http://www.cs.utexas.edu/~marijn
citations:	google scholar citations

Classes

- Practical Satisfiability Solving

Publications

2012

Norbert Manthey and Marijn J. H. Heule and Armin Biere (2012). Automated Reencoding of Boolean Formulas. In Proceedings of Haifa Verification Conference 2012.

Peter van der Tak and Marijn J. H. Heule and Armin Biere (2012). Concurrent Cube-and-Conquer. In Pragmatics of SAT.

Peter van der Tak and Marijn J. H. Heule and Armin Biere (2012). Concurrent Cube-and-Conquer: Poster Presentation. In Theory and Applications of Satisfiability Testing – SAT 2012, pp. 475-476. Lecture Notes in Computer Science 7317, Springer.

Matti Järvisalo and Marijn J. H. Heule and Armin Biere (2012). Inprocessing Rules. In 6th International Joint Conference, IJCAR, pp. 355-370. Lecture Notes in Computer Science 7364, Springer.

Matti Järvisalo and Armin Biere and Marijn J. H. Heule (2012). Simulating Circuit-Level Simplifications on CNF. Journal of Automated Reasoning 49(4):583-619.

Marijn J. H. Heule and Oliver Kullmann and Siert Wieringa and Armin Biere (2012). Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads. In Haifa Verification Conference 2011, pp. 50-65. Lecture Notes in Computer Science 7261, Springer.

2011

Peter van der Tak and Antonio Ramos and Marijn J.H. Heule (2011). Reusing the Assignment Trail in CDCL Solvers. Journal on Satisfiability, Boolean Modeling and Computation 7:133-138.

Oliver Gableske and Marijn J.H. Heule (2011). EagleUP: Solving Random 3-SAT using SLS with Unit Propagation. In Pragmatics of SAT 2011.

Oliver Gableske and Marijn J.H. Heule (2011). EagleUP: Solving Random 3-SAT using SLS with Unit Propagation. In SAT 2011, pp. 367-368. Lecture Notes in Computer Science 6695, Springer.

Antonio Ramos and Peter van der Tak and Marijn J.H. Heule (2011). Between Restarts and Backjumps. In K.A. Sakallah and L. Simon (Eds.), SAT 2011, pp. 216-229. Lecture Notes in Computer Science, Springer.

Marijn J.H. Heule and Matti Jarvisalo and Armin Biere (2011). Efficient CNF Simplification based on Binary Implication Graphs. In K.A. Sakallah and L. Simon (Eds.), SAT 2011, pp. 201-215. Lecture Notes in Computer Science 6695, Springer.

2010

Shai Haim and Marijn Heule (2010). Towards Ultra Rapid Restarts. Technical Report, UNSW and TU Delft.

Marijn J.H. Heule and Matti Järvisalo and Armin Biere (2010). Covered Clause Elimination. In Short paper proceedings of LPAR-17, 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Yogyakarta, Indonesia, October 10th - 15th, 2010. EasyChair Proceedings.

Marijn J.H. Heule and Matti Jarvisalo and Armin Biere (2010). Blocked Clause Elimination and its Extentions. Technical Report, Proceedings of Guangzhou Symposium on Satisfiability In Logic-Based Modeling.

Sid Mijnders and Boris de Wilde and Marijn J. H. Heule (2010). Symbiosis of Search and Heuristics for Random 3-SAT. In David Mitchell and Eugenia Ternovska (Eds.), Proceedings of the Third International Workshop on Logic and Search (LaSh 2010).

Marijn J.H. Heule and Toby Walsh (2010). Internal Symmetry. In Pierre Flener and Justin Pearson (Eds.), The 10th International Workshop on Symmetry in Constraint Satisfaction Problems (SymCon'10), pp. 19-33.

Marijn J.H. Heule and Matti Järvisalo and Armin Biere (2010). Clause Elimination Procedures for CNF Formula. In C. Fermüller and A. Voronkov (Eds.), LPAR-17, pp. 357–371. Springer.

Marijn J.H. Heule and Sicco Verwer (2010). Exact DFA Identification Using SAT Solvers. In José M. Sempere and Pedro García (Eds.), Grammatical Inference: Theoretical Results and Applications 10th International Colloquium, ICGI 2010, pp. 66-79. Lecture Notes in Computer Science 6339, Springer.

Marijn J.H. Heule and Toby Walsh (2010). Symmetry within Solutions. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI '10), pp. 77-82. AAAI Press.

Matti Jarvisalo and Armin Biere and Marijn J.H. Heule (2010). Blocked Clause Elimination. In J. Esparza and R. Majumdar (Eds.), TACAS '10, pp. 129–144. Lecture Notes in Computer Science 6015, Springer.

2009

Marijn J. H. Heule and Sicco Verwer (2009). Using a satisfiability solver to identify deterministic finite state automata. In Toon Calders and Karl Tuyls and Mykola Pechenizkiy (Eds.), BNAIC 2009, pp. 91-98, October 29-30, 2009, Eindhoven. BNAIC.

Bas Schaafsma and Marijn J.H. Heule and Hans van Maaren (2009). Dynamic Symmetry Breaking by Simulating Zykov Contraction. In Oliver Kullmann (Eds.), Theory and Applications of Satisfiability Testing -- SAT 2009, pp. 223-236, June 30 - July 3, 2009, Swansea. LNCS 5584, Springer.

Marijn J.H. Heule and Hans van Maaren (2009). In Armin Biere and Marijn J.H. Heule and Hans van Maaren and Toby Walsh (Eds.) Look-Ahead Based SAT Solvers, Ch. 5, pp. 155-184. IOS Press.

Armin Biere and Marijn J.H. Heule and Hans van Maaren and Toby Walsh (2009). Handbook of Satisfiability, IOS Press.

2008

Marijn J.H. Heule (2008). SmArT solving: Tools and techniques for satisfiability solvers. PhD Thesis, TU Delft.

Marijn J.H. Heule (2008). Solving edge-matching problems with satisfiability solvers. In Proceedings of the Second International Workshop on Logic and Search (LaSh 2008), pp. 88-102. University of Leuven.

Marijn J.H. Heule and Hans van Maaren (2008). Whose side are you on? Finding solutions in a biased search-tree. Journal on Satisfiability, Boolean Modeling and Computation 4:117-148.

Marijn J.H. Heule and Hans van Maaren (2008). Parallel SAT Solving using Bit-level Operations. Journal on Satisfiability, Boolean Modeling and Computation 4:99-116.

Henriette Bier and Adriaan de Jong and Gijs van der Hoorn and Niels Brouwers and Marijn J.H. Heule and Hans van Maaren (2008). In T.G. Wyeld and S. Kenderdine and M. Docherty (Eds.) Prototypes for Automated Architectural 3D-Layout, pp. 203-214. Springer Berlin / Heidelberg.

Hans van Maaren and Linda van Norden and Marijn J.H. Heule (2008). Sums of squares based approximation algorithms for MAX-SAT. Discrete Applied Mathematics 156(10):1754-1779.

2007

Henriette Bier and Adriaan de Jong and Gijs van der Hoorn and Niels Brouwers and Marijn J.H. Heule and Hans van Maaren (2007). Prototypes for Automated Architectural 3D-Layout. In Proceedings of the 13th International Conference on Virtual Systems and Multimedia.

Marijn J.H. Heule and Hans van Maaren (2007). From Idempotent Generalized Boolean Assignments to Multi-bit Search. In Joao Marques-Silva and Karem A. Sakallah (Eds.), Theory and Applications of Satisfiability Testing - SAT 2007, pp. 134-147. Lecture Notes in Computer Science 4501, Springer.

Marijn J.H. Heule and Hans van Maaren (2007). Effective Incorporation of Double Look-Ahead Procedures. In Joao Marques-Silva and Karem A. Sakallah (Eds.), Theory and Applications of Satisfiability Testing - SAT 2007, pp. 258-271. Lecture Notes in Computer Science 4501, Springer.

Marijn J.H. Heule and Leon J.M. Rothkrantz (2007). Solving Games: Dependance of applicable solving procedures. Science of Computer Programming 67(1):105-124.

P.R. Herwig and Marijn J.H. Heule and P.M. van Lambalgen and H. van Maaren (2007). A New Method to Construct Lower Bounds for Van der Waerden Numbers. The Electronic Journal of Combinatorics 14:1-18.

2006

Marijn J.H. Heule and Hans van Maaren (2006). Whose side are you on? Finding solutions in a biased search-tree. Technical Report, Proceedings of Guangzhou Symposium on Satisfiability In Logic-Based Modeling.

Marijn J.H. Heule and Hans van Maaren (2006). March_dl: Adding Adaptive Heuristics and a New Branching Strategy. Journal on Satisfiability, Boolean Modeling and Computation 2:47-59.

2005

Marijn J. H. Heule, Joris E. van Zwieten, Mark Dufour and Hans van Maaren (2005). March_eq: Implementing Additional Reasoning into an Efficient Lookahead Sat Solver. In Holger H. Hoos and David G. Mitchell (Eds.), SAT 2004, pp. 345--359. Lecture Notes in Computer Science 3542, Springer.

Marijn J.H. Heule and Hans van Maaren (2005). Aligning CNF- and Equivalence- Reasoning. In Holger H. Hoos and David G. Mitchell (Eds.), SAT 2004, pp. 145--156. Lecture Notes in Computer Science 3542, Springer.

Marijn J. H. Heule and Hans van Maaren (2005). Observed Lower Bounds for Random 3-Sat Phase Transition Density using Linear Programming. In Fahiem Bacchus and Toby Walsh (Eds.), SAT 2005, pp. 122--134. Lecture Notes in Computer Science 3569, Springer.

Send updates to: firstname at cs dot utexas dot edu

What Starts Here