Mohr, Felix, et al. “Programmatic Task Network Planning.” Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.
LibreCat: /record/2857

Jakobs, Marie-Christine, et al. “Certiû01cation Matters for Service Markets.” The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 2017, pp. 7–12.
LibreCat: /record/115

Mohr, Felix, et al. “Planning with Independent Task Networks.”10.1007/978-3-319-67190-1_15__Proc. 40th Annual German Conference on Advances in Artificial Intelligence (KI 2017), 2017, pp. 193–206, doi:10.1007/978-3-319-67190-1_15.
LibreCat: /record/10206
DOI: 10.1007/978-3-319-67190-1_15

Mohr, Felix, et al. “Reducing Nondeterminism in Automated Service Composition.”10.1109/SOCA.2013.25__Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA), 2013, pp. 154–61, doi:10.1109/SOCA.2013.25.
LibreCat: /record/495
DOI: 10.1109/SOCA.2013.25

Lettmann, Theodor, et al. “Modeling Agents and Agent Systems.”10.1007/978-3-642-24016-4_9__Transactions on Computational Collective Intelligence V, Springer Berlin Heidelberg, 2011, pp. 157–81, doi:10.1007/978-3-642-24016-4_9.
LibreCat: /record/3332
DOI: 10.1007/978-3-642-24016-4_9

Stein, Benno, et al. “Speeding Up Model-Based Diagnosis by a Heuristic Approach to Solving SAT.” AIA ’06: Proceedings of the 24th IASTED International Conference on Artificial Intelligence and Applications, 2006, pp. 273--278.
LibreCat: /record/3327

Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under Equivalence.”10.1016/s0166-218x(99)00055-4__Discrete Applied Mathematics, 1999, pp. 139–48, doi:10.1016/s0166-218x(99)00055-4.
LibreCat: /record/19815
DOI: 10.1016/s0166-218x(99)00055-4

Lettmann, Theodor, and Hans Kleine Büning. Propositional Logicf: Deduction and Algorithms. Cambridge Univ. Press, 1999.
LibreCat: /record/3339

Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.”10.1007/3-540-61863-5_33__Lecture Notes in Computer Science, 1996, doi:10.1007/3-540-61863-5_33.
LibreCat: /record/19816
DOI: 10.1007/3-540-61863-5_33

Kleine Büning, Hans, and Theodor Lettmann. Aussagenlogik - Deduktion und Algorithmen. Teubner, 1994, doi:10.1007/978-3-322-84809-3.
LibreCat: /record/3333
DOI: 10.1007/978-3-322-84809-3

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