16 Publications

Mark all

[16]
2018 | Conference Paper | LibreCat-ID: 2857
F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task Network Planning,” in Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, Delft, Netherlands, 2018, pp. 31–39.
LibreCat | Files available | Download (ext.)
 
[15]
2017 | Conference Paper | LibreCat-ID: 10206
F. Mohr, T. Lettmann, and E. Hüllermeier, “Planning with Independent Task Networks,” in Proc. 40th Annual German Conference on Advances in Artificial Intelligence (KI 2017), 2017, pp. 193–206.
LibreCat | Files available | DOI
 
[14]
2017 | Conference Paper | LibreCat-ID: 115
M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters for Service Markets,” in The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.
LibreCat | Files available
 
[13]
2013 | Conference Paper | LibreCat-ID: 495
F. Mohr, T. Lettmann, and H. Kleine Büning, “Reducing Nondeterminism in Automated Service Composition,” in Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA), 2013, pp. 154–161.
LibreCat | Files available | DOI
 
[12]
2011 | Journal Article | LibreCat-ID: 3332
T. Lettmann, M. Baumann, M. Eberling, and T. Kemmerich, “Modeling Agents and Agent Systems,” Transactions on Computational Collective Intelligence V, pp. 157–181, 2011.
LibreCat | DOI
 
[11]
2006 | Conference Paper | LibreCat-ID: 3327
B. Stein, O. Niggemann, and T. 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, 2006, pp. 273--278.
LibreCat
 
[10]
1999 | Book | LibreCat-ID: 3339
T. Lettmann and H. Kleine Büning, Propositional Logic : Deduction and Algorithms. Cambridge Univ. Press, 1999.
LibreCat
 
[9]
1999 | Journal Article | LibreCat-ID: 19815
H. Kleine Büning and T. Lettmann, “Resolution remains hard under equivalence,” Discrete Applied Mathematics, pp. 139–148, 1999.
LibreCat | DOI
 
[8]
1996 | Book Chapter | LibreCat-ID: 19816
H. Kleine Büning and T. Lettmann, “Learning a representation for optimizable formulas,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996.
LibreCat | DOI
 
[7]
1994 | Book | LibreCat-ID: 3333
H. Kleine Büning and T. Lettmann, Aussagenlogik - Deduktion und Algorithmen. Teubner, 1994.
LibreCat | DOI
 
[6]
1993 | Journal Article | LibreCat-ID: 19814
A. Flögel, H. Kleine Büning, and T. Lettmann, “On the restricted equivalence for subclasses of propositional logic,” RAIRO - Theoretical Informatics and Applications, pp. 327–340, 1993.
LibreCat | DOI
 
[5]
1991 | Report | LibreCat-ID: 19822
B. I. Dahn, T. Lettmann, and W. Schönfeld, ILFA Interface Concept, vol. 193. ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland , 1991.
LibreCat
 
[4]
1989 | Journal Article | LibreCat-ID: 19818
H. Kleine Büning, T. Lettmann, and E. W. Mayr, “Projections of vector addition system reachability sets are semilinear,” Theoretical Computer Science, pp. 343–350, 1989.
LibreCat | DOI
 
[3]
1988 | Conference Paper | LibreCat-ID: 19820
H. Kleine Büning and T. Lettmann, “Perspektiven für die Logikprogrammierung,” in Workshop Wissensrepräsentation in Expertensystemen, 1988, pp. 56–78.
LibreCat
 
[2]
1987 | Book Chapter | LibreCat-ID: 19821
H. K. Büning and T. Lettmann, “Representation independent query and update operations on propositional definite Horn formulas,” in Computation Theory and Logic, E. Börger, Ed. Berlin, Heidelberg, 1987, pp. 208–223.
LibreCat | DOI
 
[1]
1986 | Book Chapter | LibreCat-ID: 19819
H. Kleine Büning and T. Lettmann, “Classes of first order formulas under various satisfiability definitions,” in 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

16 Publications

Mark all

[16]
2018 | Conference Paper | LibreCat-ID: 2857
F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task Network Planning,” in Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, Delft, Netherlands, 2018, pp. 31–39.
LibreCat | Files available | Download (ext.)
 
[15]
2017 | Conference Paper | LibreCat-ID: 10206
F. Mohr, T. Lettmann, and E. Hüllermeier, “Planning with Independent Task Networks,” in Proc. 40th Annual German Conference on Advances in Artificial Intelligence (KI 2017), 2017, pp. 193–206.
LibreCat | Files available | DOI
 
[14]
2017 | Conference Paper | LibreCat-ID: 115
M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters for Service Markets,” in The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.
LibreCat | Files available
 
[13]
2013 | Conference Paper | LibreCat-ID: 495
F. Mohr, T. Lettmann, and H. Kleine Büning, “Reducing Nondeterminism in Automated Service Composition,” in Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA), 2013, pp. 154–161.
LibreCat | Files available | DOI
 
[12]
2011 | Journal Article | LibreCat-ID: 3332
T. Lettmann, M. Baumann, M. Eberling, and T. Kemmerich, “Modeling Agents and Agent Systems,” Transactions on Computational Collective Intelligence V, pp. 157–181, 2011.
LibreCat | DOI
 
[11]
2006 | Conference Paper | LibreCat-ID: 3327
B. Stein, O. Niggemann, and T. 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, 2006, pp. 273--278.
LibreCat
 
[10]
1999 | Book | LibreCat-ID: 3339
T. Lettmann and H. Kleine Büning, Propositional Logic : Deduction and Algorithms. Cambridge Univ. Press, 1999.
LibreCat
 
[9]
1999 | Journal Article | LibreCat-ID: 19815
H. Kleine Büning and T. Lettmann, “Resolution remains hard under equivalence,” Discrete Applied Mathematics, pp. 139–148, 1999.
LibreCat | DOI
 
[8]
1996 | Book Chapter | LibreCat-ID: 19816
H. Kleine Büning and T. Lettmann, “Learning a representation for optimizable formulas,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996.
LibreCat | DOI
 
[7]
1994 | Book | LibreCat-ID: 3333
H. Kleine Büning and T. Lettmann, Aussagenlogik - Deduktion und Algorithmen. Teubner, 1994.
LibreCat | DOI
 
[6]
1993 | Journal Article | LibreCat-ID: 19814
A. Flögel, H. Kleine Büning, and T. Lettmann, “On the restricted equivalence for subclasses of propositional logic,” RAIRO - Theoretical Informatics and Applications, pp. 327–340, 1993.
LibreCat | DOI
 
[5]
1991 | Report | LibreCat-ID: 19822
B. I. Dahn, T. Lettmann, and W. Schönfeld, ILFA Interface Concept, vol. 193. ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland , 1991.
LibreCat
 
[4]
1989 | Journal Article | LibreCat-ID: 19818
H. Kleine Büning, T. Lettmann, and E. W. Mayr, “Projections of vector addition system reachability sets are semilinear,” Theoretical Computer Science, pp. 343–350, 1989.
LibreCat | DOI
 
[3]
1988 | Conference Paper | LibreCat-ID: 19820
H. Kleine Büning and T. Lettmann, “Perspektiven für die Logikprogrammierung,” in Workshop Wissensrepräsentation in Expertensystemen, 1988, pp. 56–78.
LibreCat
 
[2]
1987 | Book Chapter | LibreCat-ID: 19821
H. K. Büning and T. Lettmann, “Representation independent query and update operations on propositional definite Horn formulas,” in Computation Theory and Logic, E. Börger, Ed. Berlin, Heidelberg, 1987, pp. 208–223.
LibreCat | DOI
 
[1]
1986 | Book Chapter | LibreCat-ID: 19819
H. Kleine Büning and T. Lettmann, “Classes of first order formulas under various satisfiability definitions,” in 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed