default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOliver Kullmann
Person information
- affiliation: Swansea University, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]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)- 2023
- [c25]Oliver Kullmann, Ankit Shukla:
Transforming Quantified Boolean Formulas Using Biclique Covers. TACAS (2) 2023: 372-390 - 2022
- [c24]Filippos Pantekis, Phillip James, Oliver Kullmann:
Scalable N-Queens Solving on GPGPUs via Interwarp Collaborations. CANDAR 2022: 158-164 - 2021
- [c23]Oliver Kullmann, Oleg Zaikin:
Projection Heuristics for Binary Branchings Between Sum and Product. SAT 2021: 299-314 - [p5]Oliver Kullmann:
Fundaments of Branching Heuristics. Handbook of Satisfiability 2021: 351-390 - [p4]Hans Kleine Büning, Oliver Kullmann:
Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability 2021: 571-633 - 2020
- [i24]Hoda Abbasizanjani, Oliver Kullmann:
Classification of minimally unsatisfiable 2-CNFs. CoRR abs/2003.03639 (2020)
2010 – 2019
- 2019
- [c22]Oliver Kullmann, Ankit Shukla:
Autarkies for DQCNF. FMCAD 2019: 179-183 - [c21]Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, João Marques-Silva:
On Computing the Union of MUSes. SAT 2019: 211-221 - [i23]Oliver Kullmann, Ankit Shukla:
Introducing Autarkies for DQCNF. CoRR abs/1907.12156 (2019) - 2018
- [c20]Hoda Abbasizanjani, Oliver Kullmann:
Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. SAT 2018: 329-345 - [p3]Marijn J. H. Heule, Oliver Kullmann, Armin Biere:
Cube-and-Conquer for Satisfiability. Handbook of Parallel Constraint Reasoning 2018: 31-59 - 2017
- [j14]Marijn J. H. Heule, Oliver Kullmann:
The science of brute force. Commun. ACM 60(8): 70-79 (2017) - [c19]Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek:
Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method. IJCAI 2017: 4864-4868 - 2016
- [c18]Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek:
Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. SAT 2016: 228-245 - [i22]Oliver Kullmann, Xishun Zhao:
Unsatisfiable hitting clause-sets with three more clauses than variables. CoRR abs/1604.01288 (2016) - [i21]Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek:
Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer. CoRR abs/1605.00723 (2016) - [i20]Oliver Kullmann:
Minimal unsatisfiability and deficiency: recent developments. CoRR abs/1610.08575 (2016) - 2015
- [c17]Oliver Kullmann, João Marques-Silva:
Computing Maximal Autarkies with Few and Simple Oracle Queries. SAT 2015: 138-155 - [i19]Oliver Kullmann, Xishun Zhao:
Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses. CoRR abs/1505.02318 (2015) - [i18]Oliver Kullmann, João Marques-Silva:
Computing maximal autarkies with few and simple oracle queries. CoRR abs/1505.02371 (2015) - 2014
- [j13]Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily:
On the van der Waerden numbers w(2; 3, t). Discret. Appl. Math. 174: 27-51 (2014) - [j12]Matthew Gwynne, Oliver Kullmann:
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution. J. Autom. Reason. 52(1): 31-65 (2014) - [c16]Matthew Gwynne, Oliver Kullmann:
On SAT Representations of XOR Constraints. LATA 2014: 409-420 - [c15]Olaf Beyersdorff, Oliver Kullmann:
Unified Characterisations of Resolution Hardness Measures. SAT 2014: 170-187 - [i17]Matthew Gwynne, Oliver Kullmann:
A framework for good SAT translations, with applications to CNF representations of XOR constraints. CoRR abs/1406.7398 (2014) - [i16]Oliver Kullmann, Xishun Zhao:
Bounds for variables with few occurrences in conjunctive normal forms. CoRR abs/1408.0629 (2014) - 2013
- [j11]Oliver Kullmann, Xishun Zhao:
On Davis-Putnam reductions for minimally unsatisfiable clause-sets. Theor. Comput. Sci. 492: 70-87 (2013) - [c14]Matthew Gwynne, Oliver Kullmann:
Generalising and Unifying SLUR and Unit-Refutation Completeness. SOFSEM 2013: 220-232 - [i15]Matthew Gwynne, Oliver Kullmann:
Towards a theory of good SAT representations. CoRR abs/1302.4421 (2013) - [i14]Matthew Gwynne, Oliver Kullmann:
On SAT representations of XOR constraints. CoRR abs/1309.3060 (2013) - [i13]Matthew Gwynne, Oliver Kullmann:
Trading inference effort versus size in CNF Knowledge Compilation. CoRR abs/1310.5746 (2013) - [i12]Oliver Kullmann:
Hardness measures and resolution lower bounds. CoRR abs/1310.7627 (2013) - 2012
- [c13]Oliver Kullmann, Xishun Zhao:
On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets. SAT 2012: 270-283 - [i11]Oliver Kullmann, Xishun Zhao:
On Davis-Putnam reductions for minimally unsatisfiable clause-sets. CoRR abs/1202.2600 (2012) - [i10]Matthew Gwynne, Oliver Kullmann:
Generalising unit-refutation completeness and SLUR via nested input resolution. CoRR abs/1204.6529 (2012) - [i9]Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer:
SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2(11): 87-101 (2012) - 2011
- [j10]Oliver Kullmann:
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency. Fundam. Informaticae 109(1): 27-81 (2011) - [j9]Oliver Kullmann:
Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure. Fundam. Informaticae 109(1): 83-119 (2011) - [c12]Marijn Heule, Oliver Kullmann, Siert Wieringa, Armin Biere:
Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads. Haifa Verification Conference 2011: 50-65 - [c11]Oliver Kullmann, Xishun Zhao:
On Variables with Few Occurrences in Conjunctive Normal Forms. SAT 2011: 33-46 - [i8]Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily:
On the van der Waerden numbers w(2;3,t). CoRR abs/1102.5433 (2011) - [i7]Oliver Kullmann:
Constraint satisfaction problems in clausal form. CoRR abs/1103.3693 (2011) - 2010
- [c10]Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce:
The Seventh QBF Solvers Evaluation (QBFEVAL'10). SAT 2010: 237-250 - [c9]Oliver Kullmann:
Green-Tao Numbers and SAT. SAT 2010: 352-362 - [i6]Oliver Kullmann:
Exact Ramsey Theory: Green-Tao numbers and SAT. CoRR abs/1004.0653 (2010) - [i5]Oliver Kullmann, Xishun Zhao:
On variables with few occurrences in conjunctive normal forms. CoRR abs/1010.5756 (2010)
2000 – 2009
- 2009
- [p2]Oliver Kullmann:
Fundaments of Branching Heuristics. Handbook of Satisfiability 2009: 205-244 - [p1]Hans Kleine Büning, Oliver Kullmann:
Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability 2009: 339-401 - [e1]Oliver Kullmann:
Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. Lecture Notes in Computer Science 5584, Springer 2009, ISBN 978-3-642-02776-5 [contents] - 2008
- [c8]Oliver Kullmann:
Present and Future of Practical SAT Solving. Complexity of Constraints 2008: 283-319 - 2007
- [c7]Oliver Kullmann:
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. SAT 2007: 314-327 - [i4]Oliver Kullmann:
Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j8]Oliver Kullmann:
The SAT 2005 Solver Competition on Random Instances. J. Satisf. Boolean Model. Comput. 2(1-4): 61-102 (2006) - [c6]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: 22-35 - [i3]Oliver Kullmann:
Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. Complexity of Constraints 2006 - 2004
- [j7]Oliver Kullmann:
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. Ann. Math. Artif. Intell. 40(3-4): 303-352 (2004) - [c5]Nicola Galesi, Oliver Kullmann:
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT 2004 - [c4]Nicola Galesi, Oliver Kullmann:
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT (Selected Papers 2004: 89-104 - 2003
- [j6]Oliver Kullmann:
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. Discret. Appl. Math. 130(2): 209-249 (2003) - [c3]Oliver Kullmann:
The Combinatorics of Conflicts between Clauses. SAT 2003: 426-440 - 2002
- [j5]Herbert Fleischner, Oliver Kullmann, Stefan Szeider:
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theor. Comput. Sci. 289(1): 503-516 (2002) - 2001
- [j4]Oliver Kullmann:
On the use of autarkies for satisfiability decision. Electron. Notes Discret. Math. 9: 231-253 (2001) - 2000
- [j3]Oliver Kullmann:
Investigations on autark assignments. Discret. Appl. Math. 107(1-3): 99-137 (2000) - [c2]Oliver Kullmann:
An improved version of width restricted resolution. AI&M 2000 - [c1]Oliver Kullmann:
An Application of Matroid Theory to the SAT Problem. CCC 2000: 116- - [i2]Oliver Kullmann:
An application of matroid theory to the SAT problem. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j2]Oliver Kullmann:
On a Generalization of Extended Resolution. Discret. Appl. Math. 96-97: 149-176 (1999) - [j1]Oliver Kullmann:
New Methods for 3-SAT Decision and Worst-case Analysis. Theor. Comput. Sci. 223(1-2): 1-72 (1999) - [i1]Oliver Kullmann:
Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs. Electron. Colloquium Comput. Complex. TR99 (1999) - 1997
- [b1]Oliver Kullmann:
Das SAT-Problem: ein systematischer Ansatz für effiziente Algorithmen zum aussagenlogischen Erfüllbarkeitsproblem, ausgehend von neuen Instrumenten der "worst case"-Analyse. Goethe University Frankfurt am Main, 1997
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
