|
Search the dblp DataBase
Theodor Lettmann:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Benno Stein, Oliver Niggemann, Theodor Lettmann
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT. [Citation Graph (0, 0)][DBLP] Artificial Intelligence and Applications, 2006, pp:273-278 [Conf]
- Hans Kleine Büning, Theodor Lettmann
Learning a Representation for Optimizable Formulas. [Citation Graph (0, 0)][DBLP] ALT, 1996, pp:51-58 [Conf]
- Hans Kleine Büning, Theodor Lettmann
Representation Independent Query and Update Operations on Propositional Definite Horn Formulas. [Citation Graph (0, 0)][DBLP] Computation Theory and Logic, 1987, pp:208-223 [Conf]
- Hans Kleine Büning, Theodor Lettmann
Classes of First Order Formulas Under Various Satisfiability Definitions. [Citation Graph (0, 0)][DBLP] CADE, 1986, pp:553-563 [Conf]
- Hans Kleine Büning, Theodor Lettmann
Perspektiven für die Logikprogrammierung. [Citation Graph (0, 0)][DBLP] Wissensrepräsentation in Expertensystemen, 1987, pp:56-78 [Conf]
- Hans Kleine Büning, Theodor Lettmann
Resolution Remains Hard Under Equivalence. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:139-148 [Journal]
- Andreas Flögel, Hans Kleine Büning, Theodor Lettmann
On the Restricted Equivalence Subclasses of Propositional Logic. [Citation Graph (0, 0)][DBLP] ITA, 1993, v:27, n:4, pp:327-340 [Journal]
- Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr
Projections of Vector Addition System Reachability Sets are Semilinear. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1989, v:64, n:3, pp:343-350 [Journal]
Search in 0.001secs, Finished in 0.002secs
|