Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

446 Publications


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

1991 | Report | LibreCat-ID: 19822
Dahn, B. I., Lettmann, T., & Schönfeld, W. (1991). ILFA Interface Concept (Vol. 193). ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland .
LibreCat
 

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

1988 | Conference Paper | LibreCat-ID: 19820
Kleine Büning, H., & Lettmann, T. (1988). Perspektiven für die Logikprogrammierung. In G. Rahmstorf (Ed.), Workshop Wissensrepräsentation in Expertensystemen (pp. 56–78). Berlin, Heidelberg.
LibreCat
 

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

1986 | Book Chapter | LibreCat-ID: 19819
Kleine Büning, H., & Lettmann, T. (1986). Classes of first order formulas under various satisfiability definitions. In 8th International Conference on Automated Deduction. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_119
LibreCat | DOI
 

Filters and Search Terms

department=355

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed