 | 2006 |
|---|
| 9 |       | Benno Stein,
Oliver Niggemann,
Theodor Lettmann:
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT.
Artificial Intelligence and Applications 2006: 273-278 |
| 1999 |
|---|
| 8 |  | Hans Kleine Büning,
Theodor Lettmann:
Resolution Remains Hard Under Equivalence.
Discrete Applied Mathematics 96-97: 139-148 (1999) |
| 1996 |
|---|
| 7 | | Hans Kleine Büning,
Theodor Lettmann:
Learning a Representation for Optimizable Formulas.
ALT 1996: 51-58 |
| 1993 |
|---|
| 6 | | Andreas Flögel,
Hans Kleine Büning,
Theodor Lettmann:
On the Restricted Equivalence Subclasses of Propositional Logic.
ITA 27(4): 327-340 (1993) |
| 1991 |
|---|
| 5 | | Bernd I. Dahn,
Theodor Lettmann,
Wolfgang Schönfeld:
ILFA Interface Concept
IWBS Report 193: (1991) |
| 1989 |
|---|
| 4 | | Hans Kleine Büning,
Theodor Lettmann,
Ernst W. Mayr:
Projections of Vector Addition System Reachability Sets are Semilinear.
Theor. Comput. Sci. 64(3): 343-350 (1989) |
| 1987 |
|---|
| 3 | | Hans Kleine Büning,
Theodor Lettmann:
Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.
Computation Theory and Logic 1987: 208-223 |
| 2 | | Hans Kleine Büning,
Theodor Lettmann:
Perspektiven für die Logikprogrammierung.
Wissensrepräsentation in Expertensystemen 1987: 56-78 |
| 1986 |
|---|
| 1 | | Hans Kleine Büning,
Theodor Lettmann:
Classes of First Order Formulas Under Various Satisfiability Definitions.
CADE 1986: 553-563 |
