F. Mohr, T. Lettmann, E. Hüllermeier, M.D. Wever.
Programmatic Task Network Planning
Proc. Automated Planning and Scheduling 2018

M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann.
Certification Matters for Service Markets
Proc. Advanced Service Computing 2017

F. Mohr, T. Lettmann, H. Kleine Büning.
Reducing Nondeterminism in Service Composition
Proc. SOCA 2013

T. Lettmann, M. Baumann, M. Eberling, T. Kemmerich.
Modeling Agents and Agent Systems
Trans. Computational Collective Intelligence 2011

B. Stein, O. Niggemann, T. Lettmann.
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
Proc. Artificial Intelligence and Applications 2006

T. Lettmann, B. Stein.
An Extensible Synthesis Framework
Proc. Workshop Planen und Konfigurieren 2004

H. Kleine Büning, T. Lettmann.
Resolution Remains Hard Under Equivalence
Discrete Applied Mathematics 1999

H. Kleine Büning, T. Lettmann.
Propositional Logic : Deduction and Algorithms
Cambridge University Press 1996

H. Kleine Büning, T. Lettmann.
Learning a Representation for Optimizable Formulas
Proc. ALT 1996

H. Kleine Büning, T. Lettmann.
Aussagenlogik - Deduktion und Algorithmen
Teubner Verlag 1994

A. Flögel, H. Kleine Büning, T. Lettmann.
On the Restricted Equivalence Subclasses of Propositional Logic
ITA 1993

B.I. Dahn, T. Lettmann, W. Schönfeld.
ILFA Interface Concept
IWBS Report 1991

H. Kleine Büning, T. Lettmann, E.W. Mayr.
Projections of Vector Addition System Reachability Sets are Semilinear
Theor. Comput. Sci. 1989

H. Kleine Büning, T. Lettmann.
First-Order Formulas in Conjunctive Quantificational Form
Math. Log. Q. 1988

H. Kleine Büning, T. Lettmann.
Representation Independent Query and Update Operations on Propositional Definite Horn Formulas
Computation Theory and Logic 1987

H. Kleine Büning, T. Lettmann.
Perspektiven für die Logikprogrammierung
Proc. Wissensrepräsentation in Expertensystemen 1987

H. Kleine Büning, T. Lettmann.
Classes of First Order Formulas Under Various Satisfiability Definitions
Proc. CADE 1986