16 Publications

Mark all

[16]
2018 | Conference Paper | LibreCat-ID: 2857
Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever. “Programmatic Task Network Planning.” In Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, 31–39. AAAI, 2018.
LibreCat | Files available | Download (ext.)
 
[15]
2017 | Conference Paper | LibreCat-ID: 10206
Mohr, Felix, Theodor Lettmann, and Eyke Hüllermeier. “Planning with Independent Task Networks.” In Proc. 40th Annual German Conference on Advances in Artificial Intelligence (KI 2017), 193–206, 2017. https://doi.org/10.1007/978-3-319-67190-1_15.
LibreCat | Files available | DOI
 
[14]
2017 | Conference Paper | LibreCat-ID: 115
Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann. “Certification Matters for Service Markets.” In The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.
LibreCat | Files available
 
[13]
2013 | Conference Paper | LibreCat-ID: 495
Mohr, Felix, Theodor Lettmann, and Hans Kleine Büning. “Reducing Nondeterminism in Automated Service Composition.” In Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA), 154–61, 2013. https://doi.org/10.1109/SOCA.2013.25.
LibreCat | Files available | DOI
 
[12]
2011 | Journal Article | LibreCat-ID: 3332
Lettmann, Theodor, Michael Baumann, Markus Eberling, and Thomas Kemmerich. “Modeling Agents and Agent Systems.” Transactions on Computational Collective Intelligence V, 2011, 157–81. https://doi.org/10.1007/978-3-642-24016-4_9.
LibreCat | DOI
 
[11]
2006 | Conference Paper | LibreCat-ID: 3327
Stein, Benno, Oliver Niggemann, and Theodor Lettmann. “Speeding Up Model-Based Diagnosis by a Heuristic Approach to Solving SAT.” In AIA ’06: Proceedings of the 24th IASTED International Conference on Artificial Intelligence and Applications, 273--278, 2006.
LibreCat
 
[10]
1999 | Book | LibreCat-ID: 3339
Lettmann, Theodor, and Hans Kleine Büning. Propositional Logic : Deduction and Algorithms. Cambridge Tracts in Theoretical Computer Science. Cambridge Univ. Press, 1999.
LibreCat
 
[9]
1999 | Journal Article | LibreCat-ID: 19815
Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under Equivalence.” Discrete Applied Mathematics, 1999, 139–48. https://doi.org/10.1016/s0166-218x(99)00055-4.
LibreCat | DOI
 
[8]
1996 | Book Chapter | LibreCat-ID: 19816
Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1996. https://doi.org/10.1007/3-540-61863-5_33.
LibreCat | DOI
 
[7]
1994 | Book | LibreCat-ID: 3333
Kleine Büning, Hans, and Theodor Lettmann. Aussagenlogik - Deduktion und Algorithmen. Leitfäden und Monographien der Informatik. Teubner, 1994. https://doi.org/10.1007/978-3-322-84809-3.
LibreCat | DOI
 
[6]
1993 | Journal Article | LibreCat-ID: 19814
Flögel, A., H. Kleine Büning, and Theodor Lettmann. “On the Restricted Equivalence for Subclasses of Propositional Logic.” RAIRO - Theoretical Informatics and Applications, 1993, 327–40. https://doi.org/10.1051/ita/1993270403271.
LibreCat | DOI
 
[5]
1991 | Report | LibreCat-ID: 19822
Dahn, Bernd I., Theodor Lettmann, and Wolfgang Schönfeld. ILFA Interface Concept. Vol. 193. IWBS Report. ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland , 1991.
LibreCat
 
[4]
1989 | Journal Article | LibreCat-ID: 19818
Kleine Büning, Hans, Theodor Lettmann, and Ernst W. Mayr. “Projections of Vector Addition System Reachability Sets Are Semilinear.” Theoretical Computer Science, 1989, 343–50. https://doi.org/10.1016/0304-3975(89)90055-8.
LibreCat | DOI
 
[3]
1988 | Conference Paper | LibreCat-ID: 19820
Kleine Büning, Hans, and Theodor Lettmann. “Perspektiven Für Die Logikprogrammierung.” In Workshop Wissensrepräsentation in Expertensystemen, edited by G. Rahmstorf, 56–78. Berlin, Heidelberg, 1988.
LibreCat
 
[2]
1987 | Book Chapter | LibreCat-ID: 19821
Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.” In Computation Theory and Logic, edited by Egon Börger, 208–23. Berlin, Heidelberg, 1987. https://doi.org/10.1007/3-540-18170-9_167.
LibreCat | DOI
 
[1]
1986 | Book Chapter | LibreCat-ID: 19819
Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.” In 8th International Conference on Automated Deduction. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16780-3_119.
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

16 Publications

Mark all

[16]
2018 | Conference Paper | LibreCat-ID: 2857
Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever. “Programmatic Task Network Planning.” In Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, 31–39. AAAI, 2018.
LibreCat | Files available | Download (ext.)
 
[15]
2017 | Conference Paper | LibreCat-ID: 10206
Mohr, Felix, Theodor Lettmann, and Eyke Hüllermeier. “Planning with Independent Task Networks.” In Proc. 40th Annual German Conference on Advances in Artificial Intelligence (KI 2017), 193–206, 2017. https://doi.org/10.1007/978-3-319-67190-1_15.
LibreCat | Files available | DOI
 
[14]
2017 | Conference Paper | LibreCat-ID: 115
Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann. “Certification Matters for Service Markets.” In The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.
LibreCat | Files available
 
[13]
2013 | Conference Paper | LibreCat-ID: 495
Mohr, Felix, Theodor Lettmann, and Hans Kleine Büning. “Reducing Nondeterminism in Automated Service Composition.” In Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA), 154–61, 2013. https://doi.org/10.1109/SOCA.2013.25.
LibreCat | Files available | DOI
 
[12]
2011 | Journal Article | LibreCat-ID: 3332
Lettmann, Theodor, Michael Baumann, Markus Eberling, and Thomas Kemmerich. “Modeling Agents and Agent Systems.” Transactions on Computational Collective Intelligence V, 2011, 157–81. https://doi.org/10.1007/978-3-642-24016-4_9.
LibreCat | DOI
 
[11]
2006 | Conference Paper | LibreCat-ID: 3327
Stein, Benno, Oliver Niggemann, and Theodor Lettmann. “Speeding Up Model-Based Diagnosis by a Heuristic Approach to Solving SAT.” In AIA ’06: Proceedings of the 24th IASTED International Conference on Artificial Intelligence and Applications, 273--278, 2006.
LibreCat
 
[10]
1999 | Book | LibreCat-ID: 3339
Lettmann, Theodor, and Hans Kleine Büning. Propositional Logic : Deduction and Algorithms. Cambridge Tracts in Theoretical Computer Science. Cambridge Univ. Press, 1999.
LibreCat
 
[9]
1999 | Journal Article | LibreCat-ID: 19815
Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under Equivalence.” Discrete Applied Mathematics, 1999, 139–48. https://doi.org/10.1016/s0166-218x(99)00055-4.
LibreCat | DOI
 
[8]
1996 | Book Chapter | LibreCat-ID: 19816
Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1996. https://doi.org/10.1007/3-540-61863-5_33.
LibreCat | DOI
 
[7]
1994 | Book | LibreCat-ID: 3333
Kleine Büning, Hans, and Theodor Lettmann. Aussagenlogik - Deduktion und Algorithmen. Leitfäden und Monographien der Informatik. Teubner, 1994. https://doi.org/10.1007/978-3-322-84809-3.
LibreCat | DOI
 
[6]
1993 | Journal Article | LibreCat-ID: 19814
Flögel, A., H. Kleine Büning, and Theodor Lettmann. “On the Restricted Equivalence for Subclasses of Propositional Logic.” RAIRO - Theoretical Informatics and Applications, 1993, 327–40. https://doi.org/10.1051/ita/1993270403271.
LibreCat | DOI
 
[5]
1991 | Report | LibreCat-ID: 19822
Dahn, Bernd I., Theodor Lettmann, and Wolfgang Schönfeld. ILFA Interface Concept. Vol. 193. IWBS Report. ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland , 1991.
LibreCat
 
[4]
1989 | Journal Article | LibreCat-ID: 19818
Kleine Büning, Hans, Theodor Lettmann, and Ernst W. Mayr. “Projections of Vector Addition System Reachability Sets Are Semilinear.” Theoretical Computer Science, 1989, 343–50. https://doi.org/10.1016/0304-3975(89)90055-8.
LibreCat | DOI
 
[3]
1988 | Conference Paper | LibreCat-ID: 19820
Kleine Büning, Hans, and Theodor Lettmann. “Perspektiven Für Die Logikprogrammierung.” In Workshop Wissensrepräsentation in Expertensystemen, edited by G. Rahmstorf, 56–78. Berlin, Heidelberg, 1988.
LibreCat
 
[2]
1987 | Book Chapter | LibreCat-ID: 19821
Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.” In Computation Theory and Logic, edited by Egon Börger, 208–23. Berlin, Heidelberg, 1987. https://doi.org/10.1007/3-540-18170-9_167.
LibreCat | DOI
 
[1]
1986 | Book Chapter | LibreCat-ID: 19819
Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.” In 8th International Conference on Automated Deduction. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16780-3_119.
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed