Travelled to:1 × China
1 × Italy
1 × United Kingdom
Collaborated with:M.Kaufmann C.Sinz ∅ C.Zielke P.Seitz
Talks about:sat (3) backdoor (2) subclass (1) conflict (1) pattern (1) analysi (1) solver (1) explor (1) comput (1) renam (1)
Person: Stephan Kottler
DBLP: Kottler:Stephan
Contributed to:
201220102008Wrote 5 papers:
- SAT-2012-KottlerZSK #analysis #named #satisfiability
- CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers — (SK, CZ, PS, MK), pp. 449–455.
- SAT-2010-Kottler #satisfiability
- SAT Solving with Reference Points (SK), pp. 143–157.
- SAT-2008-KottlerKS
- Computation of Renameable Horn Backdoors (SK, MK, CS), pp. 154–160.
- SAT-2008-KottlerKS08a #bound #np-hard #satisfiability #subclass #using
- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors (SK, MK, CS), pp. 161–167.