BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Portugal
1 × Spain
1 × United Kingdom
2 × Canada
2 × Italy
5 × USA
Collaborated with:
∅ X.Zhao N.Galesi J.Marques-Silva M.Gwynne O.Beyersdorff I.Lynce C.Peschiera L.Pulina A.Tacchella U.Bubeck
Talks about:
sat (6) claus (5) decis (4) polynomi (3) conjunct (3) normal (3) time (3) form (3) set (3) hypergraph (2)

Person: Oliver Kullmann

DBLP DBLP: Kullmann:Oliver

Facilitated 1 volumes:

SAT 2009Ed

Contributed to:

SAT 20152015
LATA 20142014
SAT 20142014
SAT 20122012
SAT 20112011
SAT 20102010
SAT 20072007
SAT 20062006
SAT 20042004
SAT 20042005
SAT 20032003
SAT 20022002
SAT 20012001

Wrote 14 papers:

SAT-2015-KullmannM #query
Computing Maximal Autarkies with Few and Simple Oracle Queries (OK, JMS), pp. 138–155.
LATA-2014-GwynneK #constraints #on the #satisfiability
On SAT Representations of XOR Constraints (MG, OK), pp. 409–420.
SAT-2014-BeyersdorffK #metric
Unified Characterisations of Resolution Hardness Measures (OB, OK), pp. 170–187.
SAT-2012-KullmannZ #on the #reduction #satisfiability
On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (OK, XZ), pp. 270–283.
SAT-2011-KullmannZ #normalisation #on the
On Variables with Few Occurrences in Conjunctive Normal Forms (OK, XZ), pp. 33–46.
SAT-2010-Kullmann #satisfiability
Green-Tao Numbers and SAT (OK), pp. 352–362.
SAT-2010-PeschieraPTBKL #evaluation
The Seventh QBF Solvers Evaluation (QBFEVAL’10) (CP, LP, AT, UB, OK, IL), pp. 237–250.
SAT-2007-Kullmann #invariant #matrix #polynomial #satisfiability
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices (OK), pp. 314–327.
SAT-2006-KullmannLM #agile #categorisation #kernel #normalisation #satisfiability
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel (OK, IL, JMS), pp. 22–35.
SAT-2004-GalesiK #polynomial #rank #satisfiability
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank (NG, OK), pp. 76–85.
SAT-J-2004-GalesiK05 #polynomial #rank #satisfiability
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank (NG, OK), pp. 89–104.
SAT-2003-Kullmann #combinator
The Combinatorics of Conflicts between Clauses (OK), pp. 426–440.
SAT-2002-Kullmann #adaptation #branch #database #encryption #normalisation #random #satisfiability #standard #towards #using
Towards an adaptive density based branching rule for SAT solvers, using a database for mixed random conjunctive normal forms built upon the Advanced Encryption Standard (AES) (OK), p. 8.
SAT-2001-Kullmann #on the #satisfiability #using
On the use of autarkies for satisfiability decision (OK), pp. 231–253.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.