- Polynomial time SAT decision, hypergraph transversals and the Hermitian rank
- Upper and lower bounds on the complexity of generalised resolution and generalised
- Algorithms for SAT/TAUT decision based on various O. Kullmann \Lambda and H. Luckhardt
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Hierarchies of polytime SAT decidable and recognisable
- Algorithmic chances for generalized satisfiability
- Combinatorial Optimisation and the SAT problem
- New links between combinatorial theory and the satisfiability
- An improved version of width restricted Oliver Kullmann \Lambda
- Lean clause-sets: Generalizations of minimally unsatis able clause-sets
- Autarky systems: Some perspectives on SAT and
- Towards an adaptive density based branching rule for SAT solvers, using a database for mixed random conjunctive normal forms built
- First report on an adaptive density based branching rule for DLL-like SAT solvers, using a
- Tree resolution for CNFs derived from first order
- On the use of autarkies for satis ability decision Oliver Kullmann
- New links between combinatorial theory and the satis ability
- Generalized Propositional Resolution as the Logic of
- New methods for 3SAT decision and worstcase analysis O. Kullmann \Lambda
- Speci cation of OKsolver, version 1.2, standard options
- On some Connections between Linear Algebra and the Combinatorics of Clause-sets
- Heuristics for SAT algorithms: Searching for some foundations Oliver Kullmann \Lambda
- Deciding propositional tautologies: Algorithms and their O. Kullmann \Lambda and H. Luckhardt
- Some new links between combinatorial theory and the
- On a generalization of Extended Resolution O. Kullmann \Lambda
- Some new links between combinatorial theory and the
- Generalized resolution and generalized constraint
- Journal on Satisfiability, Boolean Modeling and Computation 2 (2006) 61-102 The SAT 2005 solver competition on random instances
- Some new links between combinatorial theory and the
- The Combinatorics of Conflicts between Clauses Oliver Kullmann
- Polynomial time SAT decision, hypergraph transversals and the Hermitian rank
- First report on an adaptive density based branching rule for DLL-like SAT solvers, using a
- Generalized Satis ability Oliver Kullmann
- On the structure of minimally unsatisfiable clausesets
- An application of matroid theory to the SAT problem
- First report on an adaptive density based branching rule for DLL-like SAT solvers, using a
- Polynomial--Time Recognition of Minimal Unsatisfiable Formulas with
- Investigations on autark assignments Oliver Kullmann \Lambda
- The random formula generator OKgenerator, the Advanced
- Lean clausesets: Generalisations of minimally
- The Combinatorics of Conflicts between Clauses Oliver Kullmann
- Polynomial time SAT decision, hypergraph transversals and the Hermitian rank
- Using linear algebra and graph theory for satisfiability decision
- Using (hyper)graph decomposition for satisfiability decision
- Generic SAT Oliver Kullmann
- New links between combinatorial theory and the satisfiability
- Towards an adaptive density based branching rule for SAT solvers, using a database for mixed random conjunctive normal forms built
- The random formula generator OKgenerator, the Advanced
- Using linear algebra and graph theory for satis ability decision
- An application of matroid theory to the SAT problem
- Using linear algebra and graph theory for satisfiability decision
- An application of matroid theory to the SAT problem
- Upper and lower bounds on the complexity of generalised resolution and generalised
- An application of matroid theory to the SAT problem
- ThI Institute for Theoretical Computer Science
- CS 232 Algorithms and Week 1, Thursday, 4/10/2007
- CS 232 Algorithms and Week 11, Thursday, 14/12/2006
- Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads
- CS 232 Algorithms and Week 1, Thursday, 2/10/2008
- Articles of the Association Name, Registered Office, Business Year
- CS 232 Algorithms and Week 1, Monday, 14/1/2008
- CS 232 Algorithms and Week 7, Thursday, 15/11/2007
- CS 232 Algorithms and Week 4, Thursday, 23/10/2008
- Categories: Special morphisms
- Towards a better understanding of
- Curriculum Vitae Oliver Kullmann
- Curriculum Vitae Oliver Kullmann
- CS 232 Algorithms and Week 10, Thursday, 6/12/2007
- Swansea University Department of Computer Science
- CS 342 Constraint Satisfaction Problems and Applications
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 1, Wednesday, 4/10/2006
- CS 232 Algorithms and Week 9, Wednesday, 28/11/2007
- CS 232 Algorithms and Week 5, Thursday, 1/11/2007
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 9, Thursday, 27/11/2008
- CS 232 Algorithms and Week 2, Thursday, 11/10/2007
- CS 232 Algorithms and Week 5, Wednesday, 1/11/2006
- CS 232 Algorithms and Week 11, Wednesday,
- CS 232 Algorithms and Week 9, Thursday, 29/11/2007
- CS 232 Algorithms and Week 6, Thursday, 8/11/2007
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 4, Thursday, 26/10/2006
- CS 232 Algorithms and Week 3, Thursday, 19/10/2006
- CS 342 Constraint Satisfaction Problems and Applications
- Introduction puzzles and
- CS 232 Algorithms and Week 1, Wednesday, 1/10/2008
- CS 232 Algorithms and Week 6, Wednesday, 5/11/2008
- Swansea University Department of Computer Science
- CS 342 Constraint Satisfaction Problems and Applications
- Representations of Oliver Kullmann
- CS 232 Algorithms and Week 3, Thursday, 18/10/2007
- CS 232 Algorithms and Week 2, Thursday, 12/10/2006
- CS 232 Algorithms and Week 4, Thursday, 25/10/2007
- CS 232 Algorithms and Week 11, Wednesday,
- Call for Papers 12th International Conference on
- numbers and SAT Oliver Kullmann
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 6, Wednesday, 7/11/2007
- numbers and SAT Oliver Kullmann
- Satisfiability Testing in the Railway Industry
- CS 232 Algorithms and Week 8, Thursday, 20/11/2008
- CS 232 Algorithms and Week 8, Wednesday, 22/11/2006
- Call for Participation June 30 -July 3, 2009, Swansea
- CS 232 Algorithms and Week 8, Wednesday, 19/11/2008
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 3, Thursday, 16/10/2008
- CS 342 Constraint Satisfaction Problems and Applications
- CS 342 Constraint Satisfaction Problems and Applications
- INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING (SAT'09)
- CS 232 Algorithms and Week 09, Friday, 28/11/2008
- University of Wales Swansea Department of Computer Science
- CS 232 Algorithms and Week 2, Wednesday, 10/10/2007
- CS 232 Algorithms and Week 3, Wednesday, 17/10/2007
- CS 342 Constraint Satisfaction Problems and Applications
- CS 342 Constraint Satisfaction Problems and Applications
- Curriculum Vitae Oliver Kullmann
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 1, Monday, 14/1/2008
- CS 232 Algorithms and Week 5, Thursday, 2/11/2006
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 10, Thursday, 4/12/2008
- CS 232 Algorithms and Week 3, Wednesday, 15/10/2008
- CS 232 Algorithms and Week 5, Thursday, 30/10/2008
- CS 232 Algorithms and Week 10, Wednesday, 5/12/2007
- CS 232 Algorithms and Week 8, Thursday, 23/11/2006
- "p01c07heu" --2008/11/16 --15:59 --page 205 --#1 Handbook of Satisfiability
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 10, Wednesday, 3/12/2008
- CS 232 Algorithms and Week 9, Wednesday, 26/11/2008
- University of Wales Swansea Department of Computer Science
- CS 232 Algorithms and Week 1, Wednesday, 3/10/2007
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 6, Thursday, 9/11/2006
- CS 232 Algorithms and Week 6, Thursday, 6/11/2008
- SWANSEA UNIVERSITY REPORT SERIES
- CS 232 Algorithms and Week 8, Thursday, 22/11/2007
- Swansea University Department of Computer Science
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 4, Wednesday, 24/10/2007
- Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces
- CS 232 Algorithms and Week 4, Wednesday, 22/10/2008
- CS 342 Constraint Satisfaction Problems and Applications
- "p01c11mus" --2008/11/16 --15:59 --page 339 --#1 Handbook of Satisfiability
- CS 232 Algorithms and Week 11, Wednesday,
- CS 342 Constraint Satisfaction Problems and Applications
- CS 342 Constraint Satisfaction Problems and Applications
- Adrian Balint Michael Henn Oliver Gableske
- CS 232 Algorithms and Week 1, Thursday, 5/10/2006
- CS 232 Algorithms and Week 09, Monday, 27/11/2006
- CS 232 Algorithms and Week 7, Wednesday, 12/11/2008
- CS 232 Algorithms and Week 7, Thursday, 16/11/2006
- CS 232 Algorithms and Week 10, Wednesday, 6/12/2006
- Swansea University Department of Computer Science
- CS 232 Algorithms and Week 9, Wednesday, 29/11/2006
- CS 232 Algorithms and Week 7, Wednesday, 14/11/2007
- CS 232 Algorithms and Week 8, Wednesday, 21/11/2007
- University of Wales Swansea Department of Computer Science
- Minimizing Learned Clauses Niklas Sorensson 1
- CS 232 Algorithms and Week 09, Monday, 26/11/2007
- CS 232 Algorithms and Week 4, Wednesday, 25/10/2006
- CS 232 Algorithms and Week 9, Thursday, 30/11/2006
- CS 232 Algorithms and Week 3, Wednesday, 18/10/2006
- CS 232 Algorithms and Week 2, Wednesday, 11/10/2006
- University of Wales Swansea Department of Computer Science
- CS 342 Constraint Satisfaction Problems and Applications
- CS 232 Algorithms and Week 6, Wednesday, 8/11/2006
- CS 232 Algorithms and Week 2, Thursday, 9/10/2008
- CS 232 Algorithms and Week 10, Thursday, 7/12/2006
- The adjoint functor Oliver Kullmann
- CS 232 Algorithms and Week 5, Wednesday, 29/10/2008
- CS 232 Algorithms and Week 5, Wednesday, 31/11/2007
- CS 232 Algorithms and Week 7, Wednesday, 15/11/2006
- CS 232 Algorithms and Week 2, Wednesday, 8/10/2008
- CS 232 Algorithms and Week 7, Thursday, 13/11/2008
- Cube and Conquer Guiding CDCL SAT Solvers by Lookaheads
- variable-degrees LEAN and MU
