16 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed

16 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed