| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Oliver Kullmann, Xishun Zhao |
On Davis-Putnam reductions for minimally unsatisfiable clause-sets  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Matthew Gwynne, Oliver Kullmann |
Generalising unit-refutation completeness and SLUR via nested input resolution |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Oliver Kullmann |
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
Constraint satisfaction problems in clausal form |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily |
On the van der Waerden numbers w(2;3,t) |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Oliver Kullmann, Xishun Zhao |
On Variables with Few Occurrences in Conjunctive Normal Forms. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann, Xishun Zhao |
On variables with few occurrences in conjunctive normal forms |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oliver Kullmann |
Exact Ramsey Theory: Green-Tao numbers and SAT |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce |
The Seventh QBF Solvers Evaluation (QBFEVAL'10). |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
Green-Tao Numbers and SAT. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
Fundaments of Branching Heuristics. |
Handbook of Satisfiability |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kleine Büning, Oliver Kullmann |
Minimal Unsatisfiability and Autarkies. |
Handbook of Satisfiability |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann (eds.) |
Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
Present and Future of Practical SAT Solving. |
Complexity of Constraints |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Oliver Kullmann |
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
The SAT 2005 Solver Competition on Random Instances. |
JSAT |
2006 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. |
Complexity of Constraints |
2006 |
DBLP BibTeX RDF |
|
| 1 | Oliver Kullmann |
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. |
Ann. Math. Artif. Intell. |
2004 |
DBLP DOI BibTeX RDF |
satisfiability problem (SAT), systems with partial instantiation, generalised resolution, lower bounds for resolution, upper bounds for SAT algorithms, automatisation of proof systems, generalised input resolution, generalised width restricted resolution, induced width of constraint satisfaction problems, constraint satisfaction problems, propositional logic, polynomial time hierarchies |
| 1 | Nicola Galesi, Oliver Kullmann |
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. |
SAT |
2004 |
DBLP BibTeX RDF |
|
| 1 | Nicola Galesi, Oliver Kullmann |
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
The Combinatorics of Conflicts between Clauses. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Herbert Fleischner, Oliver Kullmann, Stefan Szeider |
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
On the use of autarkies for satisfiability decision. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
An application of matroid theory to the SAT problem |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Oliver Kullmann |
Investigations on autark assignments. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
An Application of Matroid Theory to the SAT Problem. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
An improved version of width restricted resolution. |
AMAI |
2000 |
DBLP BibTeX RDF |
|
| 1 | Oliver Kullmann |
Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Oliver Kullmann |
New Methods for 3-SAT Decision and Worst-case Analysis. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann |
On a Generalization of Extended Resolution. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")