16 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

16 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed