Oliver Kullmann
Orcid: 0000-0003-3021-0095Affiliations:
- Swansea University, UK
According to our database1,
Oliver Kullmann
authored at least 61 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
2
1
2
1
1
1
1
2
1
4
4
1
4
1
1
1
1
1
1
1
2
3
1
1
1
2
1
1
1
1
2
1
2
2
1
1
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Concurr. Comput. Pract. Exp., 2024
2023
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023
2022
Proceedings of the Tenth International Symposium on Computing and Networking, 2022
2021
Proceedings of the Handbook of Satisfiability - Second Edition, 2021
Proceedings of the Handbook of Satisfiability - Second Edition, 2021
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021
2020
2019
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019
Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019
2018
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018
Proceedings of the Handbook of Parallel Constraint Reasoning., 2018
2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
2016
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016
2015
Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses.
CoRR, 2015
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015
2014
J. Autom. Reason., 2014
A framework for good SAT translations, with applications to CNF representations of XOR constraints.
CoRR, 2014
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014
Proceedings of the Language and Automata Theory and Applications, 2014
2013
Theor. Comput. Sci., 2013
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013
2012
2011
Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure.
Fundam. Informaticae, 2011
Fundam. Informaticae, 2011
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011
Proceedings of the Hardware and Software: Verification and Testing, 2011
2010
Proceedings of the Theory and Applications of Satisfiability Testing, 2010
Proceedings of the Theory and Applications of Satisfiability Testing, 2010
2009
Proceedings of the Handbook of Satisfiability, 2009
Proceedings of the Handbook of Satisfiability, 2009
2008
Proceedings of the Complexity of Constraints, 2008
2007
Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability.
Electron. Colloquium Comput. Complex., 2007
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007
2006
J. Satisf. Boolean Model. Comput., 2006
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006
Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities.
Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006
2004
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems.
Ann. Math. Artif. Intell., 2004
Proceedings of the Theory and Applications of Satisfiability Testing, 2004
2003
Discret. Appl. Math., 2003
Proceedings of the Theory and Applications of Satisfiability Testing, 2003
2002
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
Theor. Comput. Sci., 2002
2001
Electron. Notes Discret. Math., 2001
2000
Electron. Colloquium Comput. Complex., 2000
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000
1999
Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs
Electron. Colloquium Comput. Complex., 1999
1997
Das SAT-Problem: ein systematischer Ansatz für effiziente Algorithmen zum aussagenlogischen Erfüllbarkeitsproblem, ausgehend von neuen Instrumenten der "worst case"-Analyse.
PhD thesis, 1997