Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: Oliver Kullmann

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Oliver Kullmann

download as .bib file

@article{DBLP:journals/concurrency/PantekisJKO24,
  author       = {Filippos Pantekis and
                  Phillip James and
                  Oliver Kullmann and
                  Liam O'Reilly},
  title        = {Optimized massively parallel solving of N-Queens on GPGPUs},
  journal      = {Concurr. Comput. Pract. Exp.},
  volume       = {36},
  number       = {10},
  year         = {2024},
  url          = {https://doi.org/10.1002/cpe.8004},
  doi          = {10.1002/CPE.8004},
  timestamp    = {Sat, 04 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/concurrency/PantekisJKO24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tacas/KullmannS23,
  author       = {Oliver Kullmann and
                  Ankit Shukla},
  editor       = {Sriram Sankaranarayanan and
                  Natasha Sharygina},
  title        = {Transforming Quantified Boolean Formulas Using Biclique Covers},
  booktitle    = {Tools and Algorithms for the Construction and Analysis of Systems
                  - 29th International Conference, {TACAS} 2023, Held as Part of the
                  European Joint Conferences on Theory and Practice of Software, {ETAPS}
                  2022, Paris, France, April 22-27, 2023, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {13994},
  pages        = {372--390},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-30820-8\_23},
  doi          = {10.1007/978-3-031-30820-8\_23},
  timestamp    = {Sat, 13 May 2023 01:07:18 +0200},
  biburl       = {https://dblp.org/rec/conf/tacas/KullmannS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ic-nc/PantekisJK22,
  author       = {Filippos Pantekis and
                  Phillip James and
                  Oliver Kullmann},
  title        = {Scalable N-Queens Solving on GPGPUs via Interwarp Collaborations},
  booktitle    = {Tenth International Symposium on Computing and Networking, {CANDAR}
                  2022, Himeji, Japan, November 21-24, 2022},
  pages        = {158--164},
  publisher    = {{IEEE}},
  year         = {2022},
  url          = {https://doi.org/10.1109/CANDAR57322.2022.00029},
  doi          = {10.1109/CANDAR57322.2022.00029},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ic-nc/PantekisJK22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/KullmannZ21,
  author       = {Oliver Kullmann and
                  Oleg Zaikin},
  editor       = {Chu{-}Min Li and
                  Felip Many{\`{a}}},
  title        = {Projection Heuristics for Binary Branchings Between Sum and Product},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2021 - 24th
                  International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12831},
  pages        = {299--314},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-80223-3\_21},
  doi          = {10.1007/978-3-030-80223-3\_21},
  timestamp    = {Sat, 17 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/KullmannZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/faia/Kullmann21,
  author       = {Oliver Kullmann},
  editor       = {Armin Biere and
                  Marijn Heule and
                  Hans van Maaren and
                  Toby Walsh},
  title        = {Fundaments of Branching Heuristics},
  booktitle    = {Handbook of Satisfiability - Second Edition},
  series       = {Frontiers in Artificial Intelligence and Applications},
  volume       = {336},
  pages        = {351--390},
  publisher    = {{IOS} Press},
  year         = {2021},
  url          = {https://doi.org/10.3233/FAIA200991},
  doi          = {10.3233/FAIA200991},
  timestamp    = {Fri, 06 May 2022 08:03:54 +0200},
  biburl       = {https://dblp.org/rec/series/faia/Kullmann21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/faia/BuningK21,
  author       = {Hans Kleine{ }B{\"{u}}ning and
                  Oliver Kullmann},
  editor       = {Armin Biere and
                  Marijn Heule and
                  Hans van Maaren and
                  Toby Walsh},
  title        = {Minimal Unsatisfiability and Autarkies},
  booktitle    = {Handbook of Satisfiability - Second Edition},
  series       = {Frontiers in Artificial Intelligence and Applications},
  volume       = {336},
  pages        = {571--633},
  publisher    = {{IOS} Press},
  year         = {2021},
  url          = {https://doi.org/10.3233/FAIA200997},
  doi          = {10.3233/FAIA200997},
  timestamp    = {Fri, 06 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/faia/BuningK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2003-03639,
  author       = {Hoda Abbasizanjani and
                  Oliver Kullmann},
  title        = {Classification of minimally unsatisfiable 2-CNFs},
  journal      = {CoRR},
  volume       = {abs/2003.03639},
  year         = {2020},
  url          = {https://arxiv.org/abs/2003.03639},
  eprinttype    = {arXiv},
  eprint       = {2003.03639},
  timestamp    = {Sat, 23 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2003-03639.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fmcad/KullmannS19,
  author       = {Oliver Kullmann and
                  Ankit Shukla},
  editor       = {Clark W. Barrett and
                  Jin Yang},
  title        = {Autarkies for {DQCNF}},
  booktitle    = {2019 Formal Methods in Computer Aided Design, {FMCAD} 2019, San Jose,
                  CA, USA, October 22-25, 2019},
  pages        = {179--183},
  publisher    = {{IEEE}},
  year         = {2019},
  url          = {https://doi.org/10.23919/FMCAD.2019.8894263},
  doi          = {10.23919/FMCAD.2019.8894263},
  timestamp    = {Thu, 14 Nov 2019 12:14:47 +0100},
  biburl       = {https://dblp.org/rec/conf/fmcad/KullmannS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/MenciaKIM19,
  author       = {Carlos Menc{\'{\i}}a and
                  Oliver Kullmann and
                  Alexey Ignatiev and
                  Jo{\~{a}}o Marques{-}Silva},
  editor       = {Mikol{\'{a}}s Janota and
                  In{\^{e}}s Lynce},
  title        = {On Computing the Union of MUSes},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2019 - 22nd
                  International Conference, {SAT} 2019, Lisbon, Portugal, July 9-12,
                  2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11628},
  pages        = {211--221},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-24258-9\_15},
  doi          = {10.1007/978-3-030-24258-9\_15},
  timestamp    = {Mon, 24 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sat/MenciaKIM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1907-12156,
  author       = {Oliver Kullmann and
                  Ankit Shukla},
  title        = {Introducing Autarkies for {DQCNF}},
  journal      = {CoRR},
  volume       = {abs/1907.12156},
  year         = {2019},
  url          = {http://arxiv.org/abs/1907.12156},
  eprinttype    = {arXiv},
  eprint       = {1907.12156},
  timestamp    = {Thu, 01 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1907-12156.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/AbbasizanjaniK18,
  author       = {Hoda Abbasizanjani and
                  Oliver Kullmann},
  editor       = {Olaf Beyersdorff and
                  Christoph M. Wintersteiger},
  title        = {Minimal Unsatisfiability and Minimal Strongly Connected Digraphs},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2018 - 21st
                  International Conference, {SAT} 2018, Held as Part of the Federated
                  Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10929},
  pages        = {329--345},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-94144-8\_20},
  doi          = {10.1007/978-3-319-94144-8\_20},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/AbbasizanjaniK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/sp/18/HeuleKB18,
  author       = {Marijn J. H. Heule and
                  Oliver Kullmann and
                  Armin Biere},
  editor       = {Youssef Hamadi and
                  Lakhdar Sais},
  title        = {Cube-and-Conquer for Satisfiability},
  booktitle    = {Handbook of Parallel Constraint Reasoning},
  pages        = {31--59},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-63516-3\_2},
  doi          = {10.1007/978-3-319-63516-3\_2},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/sp/18/HeuleKB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cacm/HeuleK17,
  author       = {Marijn J. H. Heule and
                  Oliver Kullmann},
  title        = {The science of brute force},
  journal      = {Commun. {ACM}},
  volume       = {60},
  number       = {8},
  pages        = {70--79},
  year         = {2017},
  url          = {https://doi.org/10.1145/3107239},
  doi          = {10.1145/3107239},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cacm/HeuleK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ijcai/HeuleKM17,
  author       = {Marijn J. H. Heule and
                  Oliver Kullmann and
                  Victor W. Marek},
  editor       = {Carles Sierra},
  title        = {Solving Very Hard Problems: Cube-and-Conquer, a Hybrid {SAT} Solving
                  Method},
  booktitle    = {Proceedings of the Twenty-Sixth International Joint Conference on
                  Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August
                  19-25, 2017},
  pages        = {4864--4868},
  publisher    = {ijcai.org},
  year         = {2017},
  url          = {https://doi.org/10.24963/ijcai.2017/683},
  doi          = {10.24963/IJCAI.2017/683},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ijcai/HeuleKM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/HeuleKM16,
  author       = {Marijn J. H. Heule and
                  Oliver Kullmann and
                  Victor W. Marek},
  editor       = {Nadia Creignou and
                  Daniel Le Berre},
  title        = {Solving and Verifying the Boolean Pythagorean Triples Problem via
                  Cube-and-Conquer},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2016 - 19th
                  International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9710},
  pages        = {228--245},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-40970-2\_15},
  doi          = {10.1007/978-3-319-40970-2\_15},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/HeuleKM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/KullmannZ16,
  author       = {Oliver Kullmann and
                  Xishun Zhao},
  title        = {Unsatisfiable hitting clause-sets with three more clauses than variables},
  journal      = {CoRR},
  volume       = {abs/1604.01288},
  year         = {2016},
  url          = {http://arxiv.org/abs/1604.01288},
  eprinttype    = {arXiv},
  eprint       = {1604.01288},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KullmannZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/HeuleKM16,
  author       = {Marijn J. H. Heule and
                  Oliver Kullmann and
                  Victor W. Marek},
  title        = {Solving and Verifying the boolean Pythagorean Triples problem via
                  Cube-and-Conquer},
  journal      = {CoRR},
  volume       = {abs/1605.00723},
  year         = {2016},
  url          = {http://arxiv.org/abs/1605.00723},
  eprinttype    = {arXiv},
  eprint       = {1605.00723},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HeuleKM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Kullmann16,
  author       = {Oliver Kullmann},
  title        = {Minimal unsatisfiability and deficiency: recent developments},
  journal      = {CoRR},
  volume       = {abs/1610.08575},
  year         = {2016},
  url          = {http://arxiv.org/abs/1610.08575},
  eprinttype    = {arXiv},
  eprint       = {1610.08575},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Kullmann16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/KullmannM15,
  author       = {Oliver Kullmann and
                  Jo{\~{a}}o Marques{-}Silva},
  editor       = {Marijn Heule and
                  Sean A. Weaver},
  title        = {Computing Maximal Autarkies with Few and Simple Oracle Queries},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2015 - 18th
                  International Conference, Austin, TX, USA, September 24-27, 2015,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9340},
  pages        = {138--155},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-24318-4\_11},
  doi          = {10.1007/978-3-319-24318-4\_11},
  timestamp    = {Mon, 24 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sat/KullmannM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/KullmannZ15,
  author       = {Oliver Kullmann and
                  Xishun Zhao},
  title        = {Parameters for minimal unsatisfiability: Smarandache primitive numbers
                  and full clauses},
  journal      = {CoRR},
  volume       = {abs/1505.02318},
  year         = {2015},
  url          = {http://arxiv.org/abs/1505.02318},
  eprinttype    = {arXiv},
  eprint       = {1505.02318},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KullmannZ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/KullmannM15,
  author       = {Oliver Kullmann and
                  Jo{\~{a}}o Marques{-}Silva},
  title        = {Computing maximal autarkies with few and simple oracle queries},
  journal      = {CoRR},
  volume       = {abs/1505.02371},
  year         = {2015},
  url          = {http://arxiv.org/abs/1505.02371},
  eprinttype    = {arXiv},
  eprint       = {1505.02371},
  timestamp    = {Mon, 24 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/KullmannM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/AhmedKS14,
  author       = {Tanbir Ahmed and
                  Oliver Kullmann and
                  Hunter S. Snevily},
  title        = {On the van der Waerden numbers w(2; 3, t)},
  journal      = {Discret. Appl. Math.},
  volume       = {174},
  pages        = {27--51},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.dam.2014.05.007},
  doi          = {10.1016/J.DAM.2014.05.007},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AhmedKS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jar/GwynneK14,
  author       = {Matthew Gwynne and
                  Oliver Kullmann},
  title        = {Generalising Unit-Refutation Completeness and {SLUR} via Nested Input
                  Resolution},
  journal      = {J. Autom. Reason.},
  volume       = {52},
  number       = {1},
  pages        = {31--65},
  year         = {2014},
  url          = {https://doi.org/10.1007/s10817-013-9275-8},
  doi          = {10.1007/S10817-013-9275-8},
  timestamp    = {Wed, 02 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jar/GwynneK14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/lata/GwynneK14,
  author       = {Matthew Gwynne and
                  Oliver Kullmann},
  editor       = {Adrian{-}Horia Dediu and
                  Carlos Mart{\'{\i}}n{-}Vide and
                  Jos{\'{e}} Luis Sierra{-}Rodr{\'{\i}}guez and
                  Bianca Truthe},
  title        = {On {SAT} Representations of {XOR} Constraints},
  booktitle    = {Language and Automata Theory and Applications - 8th International
                  Conference, {LATA} 2014, Madrid, Spain, March 10-14, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8370},
  pages        = {409--420},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-04921-2\_33},
  doi          = {10.1007/978-3-319-04921-2\_33},
  timestamp    = {Sun, 02 Oct 2022 16:11:11 +0200},
  biburl       = {https://dblp.org/rec/conf/lata/GwynneK14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/BeyersdorffK14,
  author       = {Olaf Beyersdorff and
                  Oliver Kullmann},
  editor       = {Carsten Sinz and
                  Uwe Egly},
  title        = {Unified Characterisations of Resolution Hardness Measures},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2014 - 17th
                  International Conference, Held as Part of the Vienna Summer of Logic,
                  {VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8561},
  pages        = {170--187},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-09284-3\_13},
  doi          = {10.1007/978-3-319-09284-3\_13},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/BeyersdorffK14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/GwynneK14,
  author       = {Matthew Gwynne and
                  Oliver Kullmann},
  title        = {A framework for good {SAT} translations, with applications to {CNF}
                  representations of {XOR} constraints},
  journal      = {CoRR},
  volume       = {abs/1406.7398},
  year         = {2014},
  url          = {http://arxiv.org/abs/1406.7398},
  eprinttype    = {arXiv},
  eprint       = {1406.7398},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/GwynneK14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/KullmannZ14,
  author       = {Oliver Kullmann and
                  Xishun Zhao},
  title        = {Bounds for variables with few occurrences in conjunctive normal forms},
  journal      = {CoRR},
  volume       = {abs/1408.0629},
  year         = {2014},
  url          = {http://arxiv.org/abs/1408.0629},
  eprinttype    = {arXiv},
  eprint       = {1408.0629},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KullmannZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KullmannZ13,
  author       = {Oliver Kullmann and
                  Xishun Zhao},
  title        = {On Davis-Putnam reductions for minimally unsatisfiable clause-sets},
  journal      = {Theor. Comput. Sci.},
  volume       = {492},
  pages        = {70--87},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.04.020},
  doi          = {10.1016/J.TCS.2013.04.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KullmannZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sofsem/GwynneK13,
  author       = {Matthew Gwynne and
                  Oliver Kullmann},
  editor       = {Peter van Emde Boas and
                  Frans C. A. Groen and
                  Giuseppe F. Italiano and
                  Jerzy R. Nawrocki and
                  Harald Sack},
  title        = {Generalising and Unifying {SLUR} and Unit-Refutation Completeness},
  booktitle    = {{SOFSEM} 2013: Theory and Practice of Computer Science, 39th International
                  Conference on Current Trends in Theory and Practice of Computer Science,
                  {\v{S}}pindler{\r{u}}v Ml{\'{y}}n, Czech Republic, January 26-31,
                  2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7741},
  pages        = {220--232},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-35843-2\_20},
  doi          = {10.1007/978-3-642-35843-2\_20},
  timestamp    = {Mon, 28 Aug 2023 21:17:48 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/GwynneK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1302-4421,
  author       = {Matthew Gwynne and
                  Oliver Kullmann},
  title        = {Towards a theory of good {SAT} representations},
  journal      = {CoRR},
  volume       = {abs/1302.4421},
  year         = {2013},
  url          = {http://arxiv.org/abs/1302.4421},
  eprinttype    = {arXiv},
  eprint       = {1302.4421},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1302-4421.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/GwynneK13,
  author       = {Matthew Gwynne and
                  Oliver Kullmann},
  title        = {On {SAT} representations of {XOR} constraints},
  journal      = {CoRR},
  volume       = {abs/1309.3060},
  year         = {2013},
  url          = {http://arxiv.org/abs/1309.3060},
  eprinttype    = {arXiv},
  eprint       = {1309.3060},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/GwynneK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/GwynneK13a,
  author       = {Matthew Gwynne and
                  Oliver Kullmann},
  title        = {Trading inference effort versus size in {CNF} Knowledge Compilation},
  journal      = {CoRR},
  volume       = {abs/1310.5746},
  year         = {2013},
  url          = {http://arxiv.org/abs/1310.5746},
  eprinttype    = {arXiv},
  eprint       = {1310.5746},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/GwynneK13a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Kullmann13,
  author       = {Oliver Kullmann},
  title        = {Hardness measures and resolution lower bounds},
  journal      = {CoRR},
  volume       = {abs/1310.7627},
  year         = {2013},
  url          = {http://arxiv.org/abs/1310.7627},
  eprinttype    = {arXiv},
  eprint       = {1310.7627},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Kullmann13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/KullmannZ12,
  author       = {Oliver Kullmann and
                  Xishun Zhao},
  editor       = {Alessandro Cimatti and
                  Roberto Sebastiani},
  title        = {On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
                  International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7317},
  pages        = {270--283},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31612-8\_21},
  doi          = {10.1007/978-3-642-31612-8\_21},
  timestamp    = {Sun, 02 Jun 2019 21:24:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/KullmannZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1202-2600,
  author       = {Oliver Kullmann and
                  Xishun Zhao},
  title        = {On Davis-Putnam reductions for minimally unsatisfiable clause-sets},
  journal      = {CoRR},
  volume       = {abs/1202.2600},
  year         = {2012},
  url          = {http://arxiv.org/abs/1202.2600},
  eprinttype    = {arXiv},
  eprint       = {1202.2600},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1202-2600.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1204-6529,
  author       = {Matthew Gwynne and
                  Oliver Kullmann},
  title        = {Generalising unit-refutation completeness and {SLUR} via nested input
                  resolution},
  journal      = {CoRR},
  volume       = {abs/1204.6529},
  year         = {2012},
  url          = {http://arxiv.org/abs/1204.6529},
  eprinttype    = {arXiv},
  eprint       = {1204.6529},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1204-6529.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dagstuhl-reports/CreignouGKV12,
  author       = {Nadia Creignou and
                  Nicola Galesi and
                  Oliver Kullmann and
                  Heribert Vollmer},
  title        = {{SAT} Interactions (Dagstuhl Seminar 12471)},
  journal      = {Dagstuhl Reports},
  volume       = {2},
  number       = {11},
  pages        = {87--101},
  year         = {2012},
  url          = {https://doi.org/10.4230/DagRep.2.11.87},
  doi          = {10.4230/DAGREP.2.11.87},
  timestamp    = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dagstuhl-reports/CreignouGKV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/fuin/Kullmann11,
  author       = {Oliver Kullmann},
  title        = {Constraint Satisfaction Problems in Clausal Form {I:} Autarkies and
                  Deficiency},
  journal      = {Fundam. Informaticae},
  volume       = {109},
  number       = {1},
  pages        = {27--81},
  year         = {2011},
  url          = {https://doi.org/10.3233/FI-2011-428},
  doi          = {10.3233/FI-2011-428},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fuin/Kullmann11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/fuin/Kullmann11a,
  author       = {Oliver Kullmann},
  title        = {Constraint Satisfaction Problems in Clausal Form {II:} Minimal Unsatisfiability
                  and Conflict Structure},
  journal      = {Fundam. Informaticae},
  volume       = {109},
  number       = {1},
  pages        = {83--119},
  year         = {2011},
  url          = {https://doi.org/10.3233/FI-2011-429},
  doi          = {10.3233/FI-2011-429},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fuin/Kullmann11a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/hvc/HeuleKWB11,
  author       = {Marijn Heule and
                  Oliver Kullmann and
                  Siert Wieringa and
                  Armin Biere},
  editor       = {Kerstin Eder and
                  Jo{\~{a}}o Louren{\c{c}}o and
                  Onn Shehory},
  title        = {Cube and Conquer: Guiding {CDCL} {SAT} Solvers by Lookaheads},
  booktitle    = {Hardware and Software: Verification and Testing - 7th International
                  Haifa Verification Conference, {HVC} 2011, Haifa, Israel, December
                  6-8, 2011, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7261},
  pages        = {50--65},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-34188-5\_8},
  doi          = {10.1007/978-3-642-34188-5\_8},
  timestamp    = {Fri, 27 Mar 2020 08:58:09 +0100},
  biburl       = {https://dblp.org/rec/conf/hvc/HeuleKWB11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/KullmannZ11,
  author       = {Oliver Kullmann and
                  Xishun Zhao},
  editor       = {Karem A. Sakallah and
                  Laurent Simon},
  title        = {On Variables with Few Occurrences in Conjunctive Normal Forms},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2011 - 14th
                  International Conference, {SAT} 2011, Ann Arbor, MI, USA, June 19-22,
                  2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6695},
  pages        = {33--46},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-21581-0\_5},
  doi          = {10.1007/978-3-642-21581-0\_5},
  timestamp    = {Tue, 14 May 2019 10:00:41 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/KullmannZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1102-5433,
  author       = {Tanbir Ahmed and
                  Oliver Kullmann and
                  Hunter S. Snevily},
  title        = {On the van der Waerden numbers w(2;3,t)},
  journal      = {CoRR},
  volume       = {abs/1102.5433},
  year         = {2011},
  url          = {http://arxiv.org/abs/1102.5433},
  eprinttype    = {arXiv},
  eprint       = {1102.5433},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1102-5433.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1103-3693,
  author       = {Oliver Kullmann},
  title        = {Constraint satisfaction problems in clausal form},
  journal      = {CoRR},
  volume       = {abs/1103.3693},
  year         = {2011},
  url          = {http://arxiv.org/abs/1103.3693},
  eprinttype    = {arXiv},
  eprint       = {1103.3693},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1103-3693.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/PeschieraPTBKL10,
  author       = {Claudia Peschiera and
                  Luca Pulina and
                  Armando Tacchella and
                  Uwe Bubeck and
                  Oliver Kullmann and
                  In{\^{e}}s Lynce},
  editor       = {Ofer Strichman and
                  Stefan Szeider},
  title        = {The Seventh {QBF} Solvers Evaluation (QBFEVAL'10)},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th
                  International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6175},
  pages        = {237--250},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14186-7\_20},
  doi          = {10.1007/978-3-642-14186-7\_20},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/PeschieraPTBKL10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/Kullmann10,
  author       = {Oliver Kullmann},
  editor       = {Ofer Strichman and
                  Stefan Szeider},
  title        = {Green-Tao Numbers and {SAT}},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th
                  International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6175},
  pages        = {352--362},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14186-7\_32},
  doi          = {10.1007/978-3-642-14186-7\_32},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/Kullmann10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1004-0653,
  author       = {Oliver Kullmann},
  title        = {Exact Ramsey Theory: Green-Tao numbers and {SAT}},
  journal      = {CoRR},
  volume       = {abs/1004.0653},
  year         = {2010},
  url          = {http://arxiv.org/abs/1004.0653},
  eprinttype    = {arXiv},
  eprint       = {1004.0653},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1004-0653.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1010-5756,
  author       = {Oliver Kullmann and
                  Xishun Zhao},
  title        = {On variables with few occurrences in conjunctive normal forms},
  journal      = {CoRR},
  volume       = {abs/1010.5756},
  year         = {2010},
  url          = {http://arxiv.org/abs/1010.5756},
  eprinttype    = {arXiv},
  eprint       = {1010.5756},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1010-5756.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/faia/Kullmann09,
  author       = {Oliver Kullmann},
  editor       = {Armin Biere and
                  Marijn Heule and
                  Hans van Maaren and
                  Toby Walsh},
  title        = {Fundaments of Branching Heuristics},
  booktitle    = {Handbook of Satisfiability},
  series       = {Frontiers in Artificial Intelligence and Applications},
  volume       = {185},
  pages        = {205--244},
  publisher    = {{IOS} Press},
  year         = {2009},
  url          = {https://doi.org/10.3233/978-1-58603-929-5-205},
  doi          = {10.3233/978-1-58603-929-5-205},
  timestamp    = {Fri, 06 May 2022 08:00:40 +0200},
  biburl       = {https://dblp.org/rec/series/faia/Kullmann09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/faia/BuningK09,
  author       = {Hans Kleine{ }B{\"{u}}ning and
                  Oliver Kullmann},
  editor       = {Armin Biere and
                  Marijn Heule and
                  Hans van Maaren and
                  Toby Walsh},
  title        = {Minimal Unsatisfiability and Autarkies},
  booktitle    = {Handbook of Satisfiability},
  series       = {Frontiers in Artificial Intelligence and Applications},
  volume       = {185},
  pages        = {339--401},
  publisher    = {{IOS} Press},
  year         = {2009},
  url          = {https://doi.org/10.3233/978-1-58603-929-5-339},
  doi          = {10.3233/978-1-58603-929-5-339},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/faia/BuningK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/sat/2009,
  editor       = {Oliver Kullmann},
  title        = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
                  International Conference, {SAT} 2009, Swansea, UK, June 30 - July
                  3, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5584},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02777-2},
  doi          = {10.1007/978-3-642-02777-2},
  isbn         = {978-3-642-02776-5},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/2009.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dagstuhl/Kullmann08,
  author       = {Oliver Kullmann},
  editor       = {Nadia Creignou and
                  Phokion G. Kolaitis and
                  Heribert Vollmer},
  title        = {Present and Future of Practical {SAT} Solving},
  booktitle    = {Complexity of Constraints - An Overview of Current Research Themes
                  [Result of a Dagstuhl Seminar]},
  series       = {Lecture Notes in Computer Science},
  volume       = {5250},
  pages        = {283--319},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92800-3\_11},
  doi          = {10.1007/978-3-540-92800-3\_11},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/Kullmann08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/Kullmann07,
  author       = {Oliver Kullmann},
  editor       = {Jo{\~{a}}o Marques{-}Silva and
                  Karem A. Sakallah},
  title        = {Polynomial Time {SAT} Decision for Complementation-Invariant Clause-Sets,
                  and Sign-non-Singular Matrices},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2007, 10th
                  International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4501},
  pages        = {314--327},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-72788-0\_30},
  doi          = {10.1007/978-3-540-72788-0\_30},
  timestamp    = {Mon, 24 Feb 2020 19:23:27 +0100},
  biburl       = {https://dblp.org/rec/conf/sat/Kullmann07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/Kullmann07,
  author       = {Oliver Kullmann},
  title        = {Constraint satisfaction problems in clausal form: Autarkies and minimal
                  unsatisfiability},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR07-055}},
  year         = {2007},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-055/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR07-055},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/Kullmann07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/Kullmann06,
  author       = {Oliver Kullmann},
  title        = {The {SAT} 2005 Solver Competition on Random Instances},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {61--102},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190017},
  doi          = {10.3233/SAT190017},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/Kullmann06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/KullmannLM06,
  author       = {Oliver Kullmann and
                  In{\^{e}}s Lynce and
                  Jo{\~{a}}o Marques{-}Silva},
  editor       = {Armin Biere and
                  Carla P. Gomes},
  title        = {Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable
                  Sub-clause-sets and the Lean Kernel},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2006, 9th
                  International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4121},
  pages        = {22--35},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11814948\_4},
  doi          = {10.1007/11814948\_4},
  timestamp    = {Mon, 24 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sat/KullmannLM06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dagstuhl/Kullmann06,
  author       = {Oliver Kullmann},
  editor       = {Nadia Creignou and
                  Phokion G. Kolaitis and
                  Heribert Vollmer},
  title        = {Constraint satisfaction problems in clausal form: Autarkies, minimal
                  unsatisfiability, and applications to hypergraph inequalities},
  booktitle    = {Complexity of Constraints, 01.10. - 06.10.2006},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {06401},
  publisher    = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
                  (IBFI), Schloss Dagstuhl, Germany},
  year         = {2006},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2006/803},
  timestamp    = {Thu, 10 Jun 2021 13:02:06 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/Kullmann06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amai/Kullmann04,
  author       = {Oliver Kullmann},
  title        = {Upper and Lower Bounds on the Complexity of Generalised Resolution
                  and Generalised Constraint Satisfaction Problems},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {40},
  number       = {3-4},
  pages        = {303--352},
  year         = {2004},
  url          = {https://doi.org/10.1023/B:AMAI.0000012871.08577.0b},
  doi          = {10.1023/B:AMAI.0000012871.08577.0B},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Kullmann04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/GalesiK04,
  author       = {Nicola Galesi and
                  Oliver Kullmann},
  title        = {Polynomial Time {SAT} Decision, Hypergraph Transversals and the Hermitian
                  Rank},
  booktitle    = {{SAT} 2004 - The Seventh International Conference on Theory and Applications
                  of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada,
                  Online Proceedings},
  year         = {2004},
  url          = {http://www.satisfiability.org/SAT04/programme/42.pdf},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sat/GalesiK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/GalesiK04a,
  author       = {Nicola Galesi and
                  Oliver Kullmann},
  editor       = {Holger H. Hoos and
                  David G. Mitchell},
  title        = {Polynomial Time {SAT} Decision, Hypergraph Transversals and the Hermitian
                  Rank},
  booktitle    = {Theory and Applications of Satisfiability Testing, 7th International
                  Conference, {SAT} 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {3542},
  pages        = {89--104},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/11527695\_8},
  doi          = {10.1007/11527695\_8},
  timestamp    = {Tue, 14 May 2019 10:00:41 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/GalesiK04a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Kullmann03,
  author       = {Oliver Kullmann},
  title        = {Lean clause-sets: generalizations of minimally unsatisfiable clause-sets},
  journal      = {Discret. Appl. Math.},
  volume       = {130},
  number       = {2},
  pages        = {209--249},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0166-218X(02)00406-7},
  doi          = {10.1016/S0166-218X(02)00406-7},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Kullmann03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/Kullmann03,
  author       = {Oliver Kullmann},
  editor       = {Enrico Giunchiglia and
                  Armando Tacchella},
  title        = {The Combinatorics of Conflicts between Clauses},
  booktitle    = {Theory and Applications of Satisfiability Testing, 6th International
                  Conference, {SAT} 2003. Santa Margherita Ligure, Italy, May 5-8, 2003
                  Selected Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {2919},
  pages        = {426--440},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/978-3-540-24605-3\_32},
  doi          = {10.1007/978-3-540-24605-3\_32},
  timestamp    = {Tue, 14 May 2019 10:00:41 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/Kullmann03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FleischnerKS02,
  author       = {Herbert Fleischner and
                  Oliver Kullmann and
                  Stefan Szeider},
  title        = {Polynomial-time recognition of minimal unsatisfiable formulas with
                  fixed clause-variable difference},
  journal      = {Theor. Comput. Sci.},
  volume       = {289},
  number       = {1},
  pages        = {503--516},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0304-3975(01)00337-1},
  doi          = {10.1016/S0304-3975(01)00337-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FleischnerKS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/endm/Kullmann01,
  author       = {Oliver Kullmann},
  title        = {On the use of autarkies for satisfiability decision},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {9},
  pages        = {231--253},
  year         = {2001},
  url          = {https://doi.org/10.1016/S1571-0653(04)00325-7},
  doi          = {10.1016/S1571-0653(04)00325-7},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/Kullmann01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Kullmann00,
  author       = {Oliver Kullmann},
  title        = {Investigations on autark assignments},
  journal      = {Discret. Appl. Math.},
  volume       = {107},
  number       = {1-3},
  pages        = {99--137},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00262-6},
  doi          = {10.1016/S0166-218X(00)00262-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Kullmann00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/amai/Kullmann00,
  author       = {Oliver Kullmann},
  title        = {An improved version of width restricted resolution},
  booktitle    = {International Symposium on Artificial Intelligence and Mathematics,
                  AI{\&}M 2000, Fort Lauderdale, Florida, USA, January 5-7, 2000},
  year         = {2000},
  url          = {http://rutcor.rutgers.edu/\%7Eamai/aimath00/regular/kullmann.ps},
  timestamp    = {Tue, 08 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/amai/Kullmann00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Kullmann00,
  author       = {Oliver Kullmann},
  title        = {An Application of Matroid Theory to the {SAT} Problem},
  booktitle    = {Proceedings of the 15th Annual {IEEE} Conference on Computational
                  Complexity, Florence, Italy, July 4-7, 2000},
  pages        = {116},
  publisher    = {{IEEE} Computer Society},
  year         = {2000},
  url          = {https://doi.org/10.1109/CCC.2000.856741},
  doi          = {10.1109/CCC.2000.856741},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Kullmann00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR00-018,
  author       = {Oliver Kullmann},
  title        = {An application of matroid theory to the {SAT} problem},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR00-018}},
  year         = {2000},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-018/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR00-018},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR00-018.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Kullmann99,
  author       = {Oliver Kullmann},
  title        = {On a Generalization of Extended Resolution},
  journal      = {Discret. Appl. Math.},
  volume       = {96-97},
  pages        = {149--176},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0166-218X(99)00037-2},
  doi          = {10.1016/S0166-218X(99)00037-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Kullmann99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Kullmann99,
  author       = {Oliver Kullmann},
  title        = {New Methods for 3-SAT Decision and Worst-case Analysis},
  journal      = {Theor. Comput. Sci.},
  volume       = {223},
  number       = {1-2},
  pages        = {1--72},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0304-3975(98)00017-6},
  doi          = {10.1016/S0304-3975(98)00017-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Kullmann99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR99-041,
  author       = {Oliver Kullmann},
  title        = {Investigating a general hierarchy of polynomially decidable classes
                  of CNF's based on short tree-like resolution proofs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR99-041}},
  year         = {1999},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-041/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR99-041},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR99-041.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/dnb/Kullmann97,
  author       = {Oliver Kullmann},
  title        = {Das SAT-Problem: ein systematischer Ansatz f{\"{u}}r effiziente
                  Algorithmen zum aussagenlogischen Erf{\"{u}}llbarkeitsproblem,
                  ausgehend von neuen Instrumenten der "worst case"-Analyse},
  school       = {Goethe University Frankfurt am Main},
  year         = {1997},
  url          = {https://d-nb.info/954409205},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/dnb/Kullmann97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.