@inproceedings{3327,
  author       = {{Stein, Benno and Niggemann, Oliver and Lettmann, Theodor}},
  booktitle    = {{AIA '06: Proceedings of the 24th IASTED International Conference on Artificial Intelligence and Applications}},
  pages        = {{273----278}},
  title        = {{{Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT}}},
  year         = {{2006}},
}

@article{19815,
  author       = {{Kleine Büning, Hans and Lettmann, Theodor}},
  issn         = {{0166-218X}},
  journal      = {{Discrete Applied Mathematics}},
  pages        = {{139--148}},
  title        = {{{Resolution remains hard under equivalence}}},
  doi          = {{10.1016/s0166-218x(99)00055-4}},
  year         = {{1999}},
}

@book{3339,
  author       = {{Lettmann, Theodor and Kleine Büning, Hans}},
  isbn         = {{0521630177}},
  publisher    = {{Cambridge Univ. Press}},
  title        = {{{Propositional Logic : Deduction and Algorithms}}},
  year         = {{1999}},
}

@inbook{19816,
  author       = {{Kleine Büning, Hans and Lettmann, Theodor}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540618638}},
  issn         = {{0302-9743}},
  title        = {{{Learning a representation for optimizable formulas}}},
  doi          = {{10.1007/3-540-61863-5_33}},
  year         = {{1996}},
}

@book{3333,
  author       = {{Kleine Büning, Hans and Lettmann, Theodor}},
  isbn         = {{978-3-519-02133-9}},
  publisher    = {{Teubner}},
  title        = {{{Aussagenlogik - Deduktion und Algorithmen}}},
  doi          = {{10.1007/978-3-322-84809-3}},
  year         = {{1994}},
}

@article{19814,
  author       = {{Flögel, A. and Kleine Büning, H. and Lettmann, Theodor}},
  issn         = {{0988-3754}},
  journal      = {{RAIRO - Theoretical Informatics and Applications}},
  pages        = {{327--340}},
  title        = {{{On the restricted equivalence for subclasses of propositional logic}}},
  doi          = {{10.1051/ita/1993270403271}},
  year         = {{1993}},
}

@techreport{19822,
  author       = {{Dahn, Bernd I. and Lettmann, Theodor and Schönfeld, Wolfgang}},
  publisher    = {{Wissenschaftliche Zentrum der IBM Deutschland }},
  title        = {{{ILFA Interface Concept}}},
  volume       = {{193}},
  year         = {{1991}},
}

@article{19818,
  author       = {{Kleine Büning, Hans and Lettmann, Theodor and Mayr, Ernst W.}},
  issn         = {{0304-3975}},
  journal      = {{Theoretical Computer Science}},
  pages        = {{343--350}},
  title        = {{{Projections of vector addition system reachability sets are semilinear}}},
  doi          = {{10.1016/0304-3975(89)90055-8}},
  year         = {{1989}},
}

@inproceedings{19820,
  author       = {{Kleine Büning, Hans and Lettmann, Theodor}},
  booktitle    = {{Workshop Wissensrepräsentation in Expertensystemen}},
  editor       = {{Rahmstorf, G.}},
  isbn         = {{9783540192169}},
  issn         = {{0343-3005}},
  pages        = {{56--78}},
  title        = {{{Perspektiven für die Logikprogrammierung}}},
  year         = {{1988}},
}

@inbook{19821,
  author       = {{Büning, Hans Kleine and Lettmann, Theodor}},
  booktitle    = {{Computation Theory and Logic}},
  editor       = {{Börger, Egon}},
  isbn         = {{9783540181705}},
  issn         = {{0302-9743}},
  pages        = {{208--223}},
  title        = {{{Representation independent query and update operations on propositional definite Horn formulas}}},
  doi          = {{10.1007/3-540-18170-9_167}},
  year         = {{1987}},
}

@inbook{19819,
  author       = {{Kleine Büning, H. and Lettmann, Theodor}},
  booktitle    = {{8th International Conference on Automated Deduction}},
  isbn         = {{9783540167808}},
  issn         = {{0302-9743}},
  title        = {{{Classes of first order formulas under various satisfiability definitions}}},
  doi          = {{10.1007/3-540-16780-3_119}},
  year         = {{1986}},
}