Oliver Kullmann

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 15

Top Venues

Goethe University Frankfurt am Main (PHD)

Education History

Goethe University Frankfurt am Main

PHD

Publications

Filippos Pantekis, Phillip James, Oliver Kullmann, Liam O'Reilly
Optimized massively parallel solving of N-Queens on GPGPUs. Concurr. Comput. Pract. Exp. 36 (10) (2024)
Oliver Kullmann, Ankit Shukla
Transforming Quantified Boolean Formulas Using Biclique Covers. TACAS (2) (2023)
Filippos Pantekis, Phillip James, Oliver Kullmann
Scalable N-Queens Solving on GPGPUs via Interwarp Collaborations. CANDAR (2022)
Oliver Kullmann, Oleg Zaikin
Projection Heuristics for Binary Branchings Between Sum and Product. SAT (2021)
Hoda Abbasizanjani, Oliver Kullmann
Classification of minimally unsatisfiable 2-CNFs. CoRR (2020)
Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, João Marques-Silva
On Computing the Union of MUSes. SAT (2019)
Oliver Kullmann, Ankit Shukla
Autarkies for DQCNF. FMCAD (2019)
Oliver Kullmann, Ankit Shukla
Introducing Autarkies for DQCNF. CoRR (2019)
Hoda Abbasizanjani, Oliver Kullmann
Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. SAT (2018)
Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek
Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method. IJCAI (2017)
Marijn J. H. Heule, Oliver Kullmann
The science of brute force. Commun. ACM 60 (8) (2017)
Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek
Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer. CoRR (2016)
Oliver Kullmann
Minimal unsatisfiability and deficiency: recent developments. CoRR (2016)
Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek
Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. SAT (2016)
Oliver Kullmann, Xishun Zhao
Unsatisfiable hitting clause-sets with three more clauses than variables. CoRR (2016)
Oliver Kullmann, Xishun Zhao
Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses. CoRR (2015)
Oliver Kullmann, João Marques-Silva
Computing maximal autarkies with few and simple oracle queries. CoRR (2015)
Oliver Kullmann, João Marques-Silva
Computing Maximal Autarkies with Few and Simple Oracle Queries. SAT (2015)
Matthew Gwynne, Oliver Kullmann
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution. J. Autom. Reason. 52 (1) (2014)
Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily
On the van der Waerden numbers w(2; 3, t). Discret. Appl. Math. 174 (2014)
Olaf Beyersdorff, Oliver Kullmann
Unified Characterisations of Resolution Hardness Measures. SAT (2014)
Oliver Kullmann, Xishun Zhao
Bounds for variables with few occurrences in conjunctive normal forms. CoRR (2014)
Matthew Gwynne, Oliver Kullmann
On SAT Representations of XOR Constraints. LATA (2014)
Matthew Gwynne, Oliver Kullmann
A framework for good SAT translations, with applications to CNF representations of XOR constraints. CoRR (2014)
Matthew Gwynne, Oliver Kullmann
Towards a theory of good SAT representations CoRR (2013)
Oliver Kullmann, Xishun Zhao
On Davis-Putnam reductions for minimally unsatisfiable clause-sets. Theor. Comput. Sci. 492 (2013)
Matthew Gwynne, Oliver Kullmann
Generalising and Unifying SLUR and Unit-Refutation Completeness. SOFSEM (2013)
Oliver Kullmann
Hardness measures and resolution lower bounds. CoRR (2013)
Matthew Gwynne, Oliver Kullmann
Trading inference effort versus size in CNF Knowledge Compilation. CoRR (2013)
Matthew Gwynne, Oliver Kullmann
On SAT representations of XOR constraints. CoRR (2013)
Matthew Gwynne, Oliver Kullmann
Generalising unit-refutation completeness and SLUR via nested input resolution CoRR (2012)
Oliver Kullmann, Xishun Zhao
On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets. SAT (2012)
Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer
SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2 (11) (2012)
Oliver Kullmann, Xishun Zhao
On Davis-Putnam reductions for minimally unsatisfiable clause-sets CoRR (2012)
Oliver Kullmann
Constraint satisfaction problems in clausal form CoRR (2011)
Marijn Heule, Oliver Kullmann, Siert Wieringa, Armin Biere
Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads. Haifa Verification Conference (2011)
Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily
On the van der Waerden numbers w(2;3,t) CoRR (2011)
Oliver Kullmann
Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure. Fundam. Informaticae 109 (1) (2011)
Oliver Kullmann
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency. Fundam. Informaticae 109 (1) (2011)
Oliver Kullmann, Xishun Zhao
On Variables with Few Occurrences in Conjunctive Normal Forms. SAT (2011)
Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce
The Seventh QBF Solvers Evaluation (QBFEVAL'10). SAT (2010)
Oliver Kullmann
Exact Ramsey Theory: Green-Tao numbers and SAT CoRR (2010)
Oliver Kullmann
Green-Tao Numbers and SAT. SAT (2010)
Oliver Kullmann, Xishun Zhao
On variables with few occurrences in conjunctive normal forms CoRR (2010)
Oliver Kullmann
Present and Future of Practical SAT Solving. Complexity of Constraints (2008)
Oliver Kullmann
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. SAT (2007)
Oliver Kullmann
Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. Electron. Colloquium Comput. Complex. 14 (055) (2007)
Oliver Kullmann
The SAT 2005 Solver Competition on Random Instances. J. Satisf. Boolean Model. Comput. 2 (1-4) (2006)
Oliver Kullmann, Inês Lynce, João Marques-Silva
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. SAT (2006)
Oliver Kullmann
Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. Complexity of Constraints (2006)
Nicola Galesi, Oliver Kullmann
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT (Selected Papers (2004)
Nicola Galesi, Oliver Kullmann
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT (2004)
Oliver Kullmann
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. Ann. Math. Artif. Intell. 40 (3-4) (2004)
Oliver Kullmann
The Combinatorics of Conflicts between Clauses. SAT (2003)
Oliver Kullmann
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. Discret. Appl. Math. 130 (2) (2003)
Herbert Fleischner, Oliver Kullmann, Stefan Szeider
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theor. Comput. Sci. 289 (1) (2002)
Oliver Kullmann
On the use of autarkies for satisfiability decision. Electron. Notes Discret. Math. 9 (2001)
Oliver Kullmann
An application of matroid theory to the SAT problem Electron. Colloquium Comput. Complex. 7 (18) (2000)
Oliver Kullmann
Investigations on autark assignments. Discret. Appl. Math. 107 (1-3) (2000)
Oliver Kullmann
An improved version of width restricted resolution. AI&M (2000)
Oliver Kullmann
An Application of Matroid Theory to the SAT Problem. Computational Complexity Conference (2000)
Oliver Kullmann
On a Generalization of Extended Resolution. Discret. Appl. Math. (1999)
Oliver Kullmann
Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs Electron. Colloquium Comput. Complex. (41) (1999)
Oliver Kullmann
New Methods for 3-SAT Decision and Worst-case Analysis. Theor. Comput. Sci. 223 (1-2) (1999)

Oliver Kullmann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Oliver Kullmann