On the restricted equivalence for subclasses of propositional logic
A. Flögel, H. Kleine Büning, T. Lettmann, RAIRO - Theoretical Informatics and Applications (1993) 327–340.
LibreCat: /record/19814
DOI: 10.1051/ita/1993270403271

ILFA Interface Concept
B.I. Dahn, T. Lettmann, W. Schönfeld, ILFA Interface Concept, Wissenschaftliche Zentrum der IBM Deutschland , ´Heidelberg, 1991.
LibreCat: /record/19822

Projections of vector addition system reachability sets are semilinear
H. Kleine Büning, T. Lettmann, E.W. Mayr, Theoretical Computer Science (1989) 343–350.
LibreCat: /record/19818
DOI: 10.1016/0304-3975(89)90055-8

Perspektiven für die Logikprogrammierung
H. Kleine Büning, T. Lettmann, in: G. Rahmstorf (Ed.), Workshop Wissensrepräsentation in Expertensystemen, Berlin, Heidelberg, 1988, pp. 56–78.
LibreCat: /record/19820

Representation independent query and update operations on propositional definite Horn formulas
H.K. Büning, T. Lettmann, in: E. Börger (Ed.), Computation Theory and Logic, Berlin, Heidelberg, 1987, pp. 208–223.
LibreCat: /record/19821
DOI: 10.1007/3-540-18170-9_167

Classes of first order formulas under various satisfiability definitions
H. Kleine Büning, T. Lettmann, in: 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.
LibreCat: /record/19819
DOI: 10.1007/3-540-16780-3_119