Flögel, A., et al. “On the Restricted Equivalence for Subclasses of Propositional Logic.”10.1051/ita/1993270403271__RAIRO - Theoretical Informatics and Applications, 1993, pp. 327–40, doi:10.1051/ita/1993270403271.
LibreCat: /record/19814
DOI: 10.1051/ita/1993270403271

Dahn, Bernd I., et al. ILFA Interface Concept. Vol. 193, Wissenschaftliche Zentrum der IBM Deutschland , 1991.
LibreCat: /record/19822

Kleine Büning, Hans, et al. “Projections of Vector Addition System Reachability Sets Are Semilinear.”10.1016/0304-3975(89)90055-8__Theoretical Computer Science, 1989, pp. 343–50, doi:10.1016/0304-3975(89)90055-8.
LibreCat: /record/19818
DOI: 10.1016/0304-3975(89)90055-8

Kleine Büning, Hans, and Theodor Lettmann. “Perspektiven Für Die Logikprogrammierung.” Workshop Wissensrepräsentation in Expertensystemen, edited by G. Rahmstorf, 1988, pp. 56–78.
LibreCat: /record/19820

Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.”10.1007/3-540-18170-9_167__Computation Theory and Logic, edited by Egon Börger, 1987, pp. 208–23, doi:10.1007/3-540-18170-9_167.
LibreCat: /record/19821
DOI: 10.1007/3-540-18170-9_167

Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.”10.1007/3-540-16780-3_119__8th International Conference on Automated Deduction, 1986, doi:10.1007/3-540-16780-3_119.
LibreCat: /record/19819
DOI: 10.1007/3-540-16780-3_119