--- _id: '2857' author: - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' citation: ama: 'Mohr F, Lettmann T, Hüllermeier E, Wever MD. Programmatic Task Network Planning. In: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning. AAAI; 2018:31-39.' apa: '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.' bibtex: '@inproceedings{Mohr_Lettmann_Hüllermeier_Wever_2018, title={Programmatic Task Network Planning}, booktitle={Proceedings of the 1st ICAPS Workshop on Hierarchical Planning}, publisher={AAAI}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier, Eyke and Wever, Marcel Dominik}, year={2018}, pages={31–39} }' chicago: 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. ieee: 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. mla: Mohr, Felix, et al. “Programmatic Task Network Planning.” Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39. short: '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.' conference: end_date: 2018-06-29 location: Delft, Netherlands name: 28th International Conference on Automated Planning and Scheduling start_date: 2018-06-24 date_created: 2018-05-24T09:00:20Z date_updated: 2022-01-06T06:58:08Z ddc: - '000' department: - _id: '355' file: - access_level: closed content_type: application/pdf creator: wever date_created: 2018-11-06T15:18:26Z date_updated: 2018-11-06T15:18:26Z file_id: '5384' file_name: Mohr18ProgrammaticPlanning.pdf file_size: 349958 relation: main_file success: 1 file_date_updated: 2018-11-06T15:18:26Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf oa: '1' page: 31-39 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '10' name: SFB 901 - Subproject B2 publication: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning publisher: AAAI status: public title: Programmatic Task Network Planning type: conference user_id: '315' year: '2018' ... --- _id: '115' abstract: - lang: eng text: 'Whenever customers have to decide between different instances of the same product, they are interested in buying the best product. In contrast, companies are interested in reducing the construction effort (and usually as a consequence thereof, the quality) to gain profit. The described setting is widely known as opposed preferences in quality of the product and also applies to the context of service-oriented computing. In general, service-oriented computing emphasizes the construction of large software systems out of existing services, where services are small and self-contained pieces of software that adhere to a specified interface. Several implementations of the same interface are considered as several instances of the same service. Thereby, customers are interested in buying the best service implementation for their service composition wrt. to metrics, such as costs, energy, memory consumption, or execution time. One way to ensure the service quality is to employ certificates, which can come in different kinds: Technical certificates proving correctness can be automatically constructed by the service provider and again be automatically checked by the user. Digital certificates allow proof of the integrity of a product. Other certificates might be rolled out if service providers follow a good software construction principle, which is checked in annual audits. Whereas all of these certificates are handled differently in service markets, what they have in common is that they influence the buying decisions of customers. In this paper, we review state-of-the-art developments in certification with respect to service-oriented computing. We not only discuss how certificates are constructed and handled in service-oriented computing but also review the effects of certificates on the market from an economic perspective.' author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Julia full_name: Krämer, Julia last_name: Krämer - first_name: Dirk full_name: van Straaten, Dirk id: '10311' last_name: van Straaten - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: 'Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION). ; 2017:7-12.' apa: 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). bibtex: '@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification Matters for Service Markets}, booktitle={The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12} }' chicago: 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. ieee: 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. mla: Jakobs, Marie-Christine, et al. “Certification 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. short: '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.' date_created: 2017-10-17T12:41:14Z date_updated: 2022-01-06T06:51:02Z ddc: - '040' department: - _id: '77' - _id: '355' - _id: '179' editor: - first_name: Thomas Prinz full_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz last_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:04:12Z date_updated: 2018-03-21T13:04:12Z file_id: '1564' file_name: 115-JakobsKraemerVanStraatenLettmann2017.pdf file_size: 133531 relation: main_file success: 1 file_date_updated: 2018-03-21T13:04:12Z has_accepted_license: '1' language: - iso: eng page: 7-12 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '11' name: SFB 901 - Subproject B3 - _id: '12' name: SFB 901 - Subproject B4 - _id: '8' name: SFB 901 - Subproject A4 - _id: '2' name: SFB 901 - Project Area A - _id: '3' name: SFB 901 - Project Area B publication: The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION) status: public title: Certification Matters for Service Markets type: conference user_id: '477' year: '2017' ... --- _id: '10206' author: - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Mohr F, Lettmann T, Hüllermeier E. Planning with Independent Task Networks. In: Proc. 40th Annual German Conference on Advances in Artificial Intelligence (KI 2017). ; 2017:193-206. doi:10.1007/978-3-319-67190-1_15' apa: 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 bibtex: '@inproceedings{Mohr_Lettmann_Hüllermeier_2017, title={Planning with Independent Task Networks}, DOI={10.1007/978-3-319-67190-1_15}, booktitle={Proc. 40th Annual German Conference on Advances in Artificial Intelligence (KI 2017)}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier, Eyke}, year={2017}, pages={193–206} }' chicago: 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. ieee: 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. mla: Mohr, Felix, et al. “Planning with Independent Task Networks.” 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. short: 'F. Mohr, T. Lettmann, E. Hüllermeier, in: Proc. 40th Annual German Conference on Advances in Artificial Intelligence (KI 2017), 2017, pp. 193–206.' date_created: 2019-06-07T15:24:16Z date_updated: 2022-01-06T06:50:31Z ddc: - '000' department: - _id: '7' - _id: '34' - _id: '355' doi: 10.1007/978-3-319-67190-1_15 file: - access_level: open_access content_type: application/pdf creator: lettmann date_created: 2020-02-28T12:50:18Z date_updated: 2020-02-28T12:50:18Z file_id: '16157' file_name: ki17.pdf file_size: 374421 relation: main_file file_date_updated: 2020-02-28T12:50:18Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 193-206 publication: Proc. 40th Annual German Conference on Advances in Artificial Intelligence (KI 2017) status: public title: Planning with Independent Task Networks type: conference user_id: '315' year: '2017' ... --- _id: '495' abstract: - lang: eng text: Automated service composition has been studied as a subject of state based planning for a decade. A great deal of service composition tasks can only be solved if concrete output values of the services are considered in the composition process. However, the fact that those values are not known before runtime leads to nondeterministic planning problems, which have proven to be notoriously difficult in practical automated service composition applications. Even though this problem is frequently recognized, it has still received remarkably few attention and remains unsolved.This paper shows how nondeterminism in automated service composition can be reduced. We introduce context rules as a means to derive semantic knowledge from output values of services. These rules enable us to replace nondeterministic composition operations by less nondeterministic or even completely deterministic ones. We show the validity of our solutions not only theoretically but also have evaluated them practically through implementation. author: - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 - first_name: Hans full_name: Kleine Büning, Hans last_name: Kleine Büning citation: ama: 'Mohr F, Lettmann T, Kleine Büning H. Reducing Nondeterminism in Automated Service Composition. In: Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA). ; 2013:154-161. doi:10.1109/SOCA.2013.25' apa: 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 bibtex: '@inproceedings{Mohr_Lettmann_Kleine Büning_2013, title={Reducing Nondeterminism in Automated Service Composition}, DOI={10.1109/SOCA.2013.25}, booktitle={Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA)}, author={Mohr, Felix and Lettmann, Theodor and Kleine Büning, Hans}, year={2013}, pages={154–161} }' chicago: 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. ieee: 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. mla: Mohr, Felix, et al. “Reducing Nondeterminism in Automated Service Composition.” Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA), 2013, pp. 154–61, doi:10.1109/SOCA.2013.25. short: '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.' date_created: 2017-10-17T12:42:28Z date_updated: 2022-01-06T07:01:30Z ddc: - '040' department: - _id: '355' doi: 10.1109/SOCA.2013.25 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T13:43:08Z date_updated: 2018-03-15T13:43:08Z file_id: '1314' file_name: 495-paper52_mohr.pdf file_size: 603822 relation: main_file success: 1 file_date_updated: 2018-03-15T13:43:08Z has_accepted_license: '1' language: - iso: eng page: 154-161 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA) status: public title: Reducing Nondeterminism in Automated Service Composition type: conference user_id: '477' year: '2013' ... --- _id: '3332' author: - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 - first_name: Michael full_name: Baumann, Michael last_name: Baumann - first_name: Markus full_name: Eberling, Markus last_name: Eberling - first_name: Thomas full_name: Kemmerich, Thomas last_name: Kemmerich citation: ama: Lettmann T, Baumann M, Eberling M, Kemmerich T. Modeling Agents and Agent Systems. Transactions on Computational Collective Intelligence V. 2011:157-181. doi:10.1007/978-3-642-24016-4_9 apa: 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 bibtex: '@article{Lettmann_Baumann_Eberling_Kemmerich_2011, title={Modeling Agents and Agent Systems}, DOI={10.1007/978-3-642-24016-4_9}, journal={Transactions on Computational Collective Intelligence V}, publisher={Springer Berlin Heidelberg}, author={Lettmann, Theodor and Baumann, Michael and Eberling, Markus and Kemmerich, Thomas}, year={2011}, pages={157–181} }' chicago: 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. ieee: T. Lettmann, M. Baumann, M. Eberling, and T. Kemmerich, “Modeling Agents and Agent Systems,” Transactions on Computational Collective Intelligence V, pp. 157–181, 2011. mla: Lettmann, Theodor, et al. “Modeling Agents and Agent Systems.” Transactions on Computational Collective Intelligence V, Springer Berlin Heidelberg, 2011, pp. 157–81, doi:10.1007/978-3-642-24016-4_9. short: T. Lettmann, M. Baumann, M. Eberling, T. Kemmerich, Transactions on Computational Collective Intelligence V (2011) 157–181. date_created: 2018-06-25T09:22:18Z date_updated: 2022-01-06T06:59:10Z doi: 10.1007/978-3-642-24016-4_9 language: - iso: eng page: 157-181 publication: Transactions on Computational Collective Intelligence V publication_identifier: isbn: - '9783642240157' - '9783642240164' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: Modeling Agents and Agent Systems type: journal_article user_id: '315' year: '2011' ... --- _id: '3327' author: - first_name: Benno full_name: Stein, Benno last_name: Stein - first_name: Oliver full_name: Niggemann, Oliver last_name: Niggemann - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: 'Stein B, Niggemann O, Lettmann T. 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:273--278.' apa: '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).' bibtex: '@inproceedings{Stein_Niggemann_Lettmann_2006, title={Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT}, booktitle={AIA ’06: Proceedings of the 24th IASTED International Conference on Artificial Intelligence and Applications}, author={Stein, Benno and Niggemann, Oliver and Lettmann, Theodor}, year={2006}, pages={273--278} }' chicago: '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.' ieee: '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.' mla: '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.' short: '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.' date_created: 2018-06-25T09:06:39Z date_updated: 2022-01-06T06:59:10Z language: - iso: eng page: 273--278 publication: 'AIA ''06: Proceedings of the 24th IASTED International Conference on Artificial Intelligence and Applications' status: public title: Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT type: conference user_id: '315' year: '2006' ... --- _id: '19815' author: - first_name: Hans full_name: Kleine Büning, Hans last_name: Kleine Büning - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: Kleine Büning H, Lettmann T. Resolution remains hard under equivalence. Discrete Applied Mathematics. 1999:139-148. doi:10.1016/s0166-218x(99)00055-4 apa: 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 bibtex: '@article{Kleine Büning_Lettmann_1999, title={Resolution remains hard under equivalence}, DOI={10.1016/s0166-218x(99)00055-4}, journal={Discrete Applied Mathematics}, author={Kleine Büning, Hans and Lettmann, Theodor}, year={1999}, pages={139–148} }' chicago: 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. ieee: H. Kleine Büning and T. Lettmann, “Resolution remains hard under equivalence,” Discrete Applied Mathematics, pp. 139–148, 1999. mla: Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under Equivalence.” Discrete Applied Mathematics, 1999, pp. 139–48, doi:10.1016/s0166-218x(99)00055-4. short: H. Kleine Büning, T. Lettmann, Discrete Applied Mathematics (1999) 139–148. date_created: 2020-10-01T08:13:12Z date_updated: 2022-01-06T06:54:13Z department: - _id: '34' - _id: '355' - _id: '7' doi: 10.1016/s0166-218x(99)00055-4 language: - iso: eng page: 139-148 publication: Discrete Applied Mathematics publication_identifier: issn: - 0166-218X publication_status: published status: public title: Resolution remains hard under equivalence type: journal_article user_id: '315' year: '1999' ... --- _id: '3339' author: - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 - first_name: Hans full_name: Kleine Büning, Hans last_name: Kleine Büning citation: ama: 'Lettmann T, Kleine Büning H. Propositional Logic : Deduction and Algorithms. Cambridge Univ. Press; 1999.' apa: 'Lettmann, T., & Kleine Büning, H. (1999). Propositional Logic : Deduction and Algorithms. Cambridge Univ. Press.' bibtex: '@book{Lettmann_Kleine Büning_1999, series={Cambridge tracts in theoretical computer science}, title={Propositional Logic : Deduction and Algorithms}, publisher={Cambridge Univ. Press}, author={Lettmann, Theodor and Kleine Büning, Hans}, year={1999}, collection={Cambridge tracts in theoretical computer science} }' chicago: 'Lettmann, Theodor, and Hans Kleine Büning. Propositional Logic : Deduction and Algorithms. Cambridge Tracts in Theoretical Computer Science. Cambridge Univ. Press, 1999.' ieee: 'T. Lettmann and H. Kleine Büning, Propositional Logic : Deduction and Algorithms. Cambridge Univ. Press, 1999.' mla: 'Lettmann, Theodor, and Hans Kleine Büning. Propositional Logic : Deduction and Algorithms. Cambridge Univ. Press, 1999.' short: 'T. Lettmann, H. Kleine Büning, Propositional Logic : Deduction and Algorithms, Cambridge Univ. Press, 1999.' date_created: 2018-06-25T10:08:43Z date_updated: 2022-01-06T06:59:10Z language: - iso: eng publication_identifier: isbn: - '0521630177' publication_status: published publisher: Cambridge Univ. Press series_title: Cambridge tracts in theoretical computer science status: public title: 'Propositional Logic : Deduction and Algorithms' type: book user_id: '315' year: '1999' ... --- _id: '19816' author: - first_name: Hans full_name: Kleine Büning, Hans last_name: Kleine Büning - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: 'Kleine Büning H, Lettmann T. Learning a representation for optimizable formulas. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1996. doi:10.1007/3-540-61863-5_33' apa: 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 bibtex: '@inbook{Kleine Büning_Lettmann_1996, place={Berlin, Heidelberg}, title={Learning a representation for optimizable formulas}, DOI={10.1007/3-540-61863-5_33}, booktitle={Lecture Notes in Computer Science}, author={Kleine Büning, Hans and Lettmann, Theodor}, year={1996} }' chicago: 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. ieee: H. Kleine Büning and T. Lettmann, “Learning a representation for optimizable formulas,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996. mla: Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.” Lecture Notes in Computer Science, 1996, doi:10.1007/3-540-61863-5_33. short: 'H. Kleine Büning, T. Lettmann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996.' date_created: 2020-10-01T08:15:08Z date_updated: 2022-01-06T06:54:13Z department: - _id: '34' - _id: '355' - _id: '7' doi: 10.1007/3-540-61863-5_33 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540618638' - '9783540707196' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Learning a representation for optimizable formulas type: book_chapter user_id: '315' year: '1996' ... --- _id: '3333' author: - first_name: Hans full_name: Kleine Büning, Hans last_name: Kleine Büning - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: Kleine Büning H, Lettmann T. Aussagenlogik - Deduktion und Algorithmen. Teubner; 1994. doi:10.1007/978-3-322-84809-3 apa: Kleine Büning, H., & Lettmann, T. (1994). Aussagenlogik - Deduktion und Algorithmen. Teubner. https://doi.org/10.1007/978-3-322-84809-3 bibtex: '@book{Kleine Büning_Lettmann_1994, series={Leitfäden und Monographien der Informatik}, title={Aussagenlogik - Deduktion und Algorithmen}, DOI={10.1007/978-3-322-84809-3}, publisher={Teubner}, author={Kleine Büning, Hans and Lettmann, Theodor}, year={1994}, collection={Leitfäden und Monographien der Informatik} }' chicago: 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. ieee: H. Kleine Büning and T. Lettmann, Aussagenlogik - Deduktion und Algorithmen. Teubner, 1994. mla: Kleine Büning, Hans, and Theodor Lettmann. Aussagenlogik - Deduktion und Algorithmen. Teubner, 1994, doi:10.1007/978-3-322-84809-3. short: H. Kleine Büning, T. Lettmann, Aussagenlogik - Deduktion und Algorithmen, Teubner, 1994. date_created: 2018-06-25T09:25:15Z date_updated: 2022-01-06T06:59:10Z doi: 10.1007/978-3-322-84809-3 language: - iso: ger publication_identifier: isbn: - 978-3-519-02133-9 publication_status: published publisher: Teubner series_title: Leitfäden und Monographien der Informatik status: public title: Aussagenlogik - Deduktion und Algorithmen type: book user_id: '315' year: '1994' ... --- _id: '19814' author: - first_name: A. full_name: Flögel, A. last_name: Flögel - first_name: H. full_name: Kleine Büning, H. last_name: Kleine Büning - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: Flögel A, Kleine Büning H, Lettmann T. On the restricted equivalence for subclasses of propositional logic. RAIRO - Theoretical Informatics and Applications. 1993:327-340. doi:10.1051/ita/1993270403271 apa: 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 bibtex: '@article{Flögel_Kleine Büning_Lettmann_1993, title={On the restricted equivalence for subclasses of propositional logic}, DOI={10.1051/ita/1993270403271}, journal={RAIRO - Theoretical Informatics and Applications}, author={Flögel, A. and Kleine Büning, H. and Lettmann, Theodor}, year={1993}, pages={327–340} }' chicago: 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. ieee: 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. mla: Flögel, A., et al. “On the Restricted Equivalence for Subclasses of Propositional Logic.” RAIRO - Theoretical Informatics and Applications, 1993, pp. 327–40, doi:10.1051/ita/1993270403271. short: A. Flögel, H. Kleine Büning, T. Lettmann, RAIRO - Theoretical Informatics and Applications (1993) 327–340. date_created: 2020-10-01T08:10:48Z date_updated: 2022-01-06T06:54:13Z department: - _id: '34' - _id: '355' - _id: '7' doi: 10.1051/ita/1993270403271 language: - iso: eng page: 327-340 publication: RAIRO - Theoretical Informatics and Applications publication_identifier: issn: - 0988-3754 - 1290-385X publication_status: published status: public title: On the restricted equivalence for subclasses of propositional logic type: journal_article user_id: '315' year: '1993' ... --- _id: '19822' author: - first_name: Bernd I. full_name: Dahn, Bernd I. last_name: Dahn - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 - first_name: Wolfgang full_name: Schönfeld, Wolfgang last_name: Schönfeld citation: ama: 'Dahn BI, Lettmann T, Schönfeld W. ILFA Interface Concept. Vol 193. ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland ; 1991.' apa: 'Dahn, B. I., Lettmann, T., & Schönfeld, W. (1991). ILFA Interface Concept (Vol. 193). ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland .' bibtex: '@book{Dahn_Lettmann_Schönfeld_1991, place={´Heidelberg}, series={IWBS Report}, title={ILFA Interface Concept}, volume={193}, publisher={Wissenschaftliche Zentrum der IBM Deutschland }, author={Dahn, Bernd I. and Lettmann, Theodor and Schönfeld, Wolfgang}, year={1991}, collection={IWBS Report} }' chicago: 'Dahn, Bernd I., Theodor Lettmann, and Wolfgang Schönfeld. ILFA Interface Concept. Vol. 193. IWBS Report. ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland , 1991.' ieee: 'B. I. Dahn, T. Lettmann, and W. Schönfeld, ILFA Interface Concept, vol. 193. ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland , 1991.' mla: Dahn, Bernd I., et al. ILFA Interface Concept. Vol. 193, Wissenschaftliche Zentrum der IBM Deutschland , 1991. short: B.I. Dahn, T. Lettmann, W. Schönfeld, ILFA Interface Concept, Wissenschaftliche Zentrum der IBM Deutschland , ´Heidelberg, 1991. date_created: 2020-10-01T09:30:28Z date_updated: 2022-01-06T06:54:13Z department: - _id: '34' - _id: '355' - _id: '7' intvolume: ' 193' language: - iso: eng place: ´Heidelberg publisher: 'Wissenschaftliche Zentrum der IBM Deutschland ' series_title: IWBS Report status: public title: ILFA Interface Concept type: report user_id: '315' volume: 193 year: '1991' ... --- _id: '19818' author: - first_name: Hans full_name: Kleine Büning, Hans last_name: Kleine Büning - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 - first_name: Ernst W. full_name: Mayr, Ernst W. last_name: Mayr citation: ama: Kleine Büning H, Lettmann T, Mayr EW. Projections of vector addition system reachability sets are semilinear. Theoretical Computer Science. 1989:343-350. doi:10.1016/0304-3975(89)90055-8 apa: 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 bibtex: '@article{Kleine Büning_Lettmann_Mayr_1989, title={Projections of vector addition system reachability sets are semilinear}, DOI={10.1016/0304-3975(89)90055-8}, journal={Theoretical Computer Science}, author={Kleine Büning, Hans and Lettmann, Theodor and Mayr, Ernst W.}, year={1989}, pages={343–350} }' chicago: 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. ieee: 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. mla: Kleine Büning, Hans, et al. “Projections of Vector Addition System Reachability Sets Are Semilinear.” Theoretical Computer Science, 1989, pp. 343–50, doi:10.1016/0304-3975(89)90055-8. short: H. Kleine Büning, T. Lettmann, E.W. Mayr, Theoretical Computer Science (1989) 343–350. date_created: 2020-10-01T08:20:05Z date_updated: 2022-01-06T06:54:13Z department: - _id: '34' - _id: '355' - _id: '7' doi: 10.1016/0304-3975(89)90055-8 language: - iso: eng page: 343-350 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: Projections of vector addition system reachability sets are semilinear type: journal_article user_id: '315' year: '1989' ... --- _id: '19820' author: - first_name: Hans full_name: Kleine Büning, Hans last_name: Kleine Büning - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: 'Kleine Büning H, Lettmann T. Perspektiven für die Logikprogrammierung. In: Rahmstorf G, ed. Workshop Wissensrepräsentation in Expertensystemen. Berlin, Heidelberg; 1988:56-78.' apa: 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. bibtex: '@inproceedings{Kleine Büning_Lettmann_1988, place={Berlin, Heidelberg}, title={Perspektiven für die Logikprogrammierung}, booktitle={Workshop Wissensrepräsentation in Expertensystemen}, author={Kleine Büning, Hans and Lettmann, Theodor}, editor={Rahmstorf, G.Editor}, year={1988}, pages={56–78} }' chicago: 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. ieee: H. Kleine Büning and T. Lettmann, “Perspektiven für die Logikprogrammierung,” in Workshop Wissensrepräsentation in Expertensystemen, 1988, pp. 56–78. mla: 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. short: 'H. Kleine Büning, T. Lettmann, in: G. Rahmstorf (Ed.), Workshop Wissensrepräsentation in Expertensystemen, Berlin, Heidelberg, 1988, pp. 56–78.' date_created: 2020-10-01T08:58:58Z date_updated: 2022-01-06T06:54:13Z department: - _id: '34' - _id: '355' - _id: '7' editor: - first_name: G. full_name: Rahmstorf, G. last_name: Rahmstorf language: - iso: eng page: 56-78 place: Berlin, Heidelberg publication: Workshop Wissensrepräsentation in Expertensystemen publication_identifier: isbn: - '9783540192169' - '9783642736414' issn: - 0343-3005 publication_status: published status: public title: Perspektiven für die Logikprogrammierung type: conference user_id: '315' year: '1988' ... --- _id: '19821' author: - first_name: Hans Kleine full_name: Büning, Hans Kleine last_name: Büning - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: 'Büning HK, Lettmann T. Representation independent query and update operations on propositional definite Horn formulas. In: Börger E, ed. Computation Theory and Logic. Berlin, Heidelberg; 1987:208-223. doi:10.1007/3-540-18170-9_167' apa: 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 bibtex: '@inbook{Büning_Lettmann_1987, place={Berlin, Heidelberg}, title={Representation independent query and update operations on propositional definite Horn formulas}, DOI={10.1007/3-540-18170-9_167}, booktitle={Computation Theory and Logic}, author={Büning, Hans Kleine and Lettmann, Theodor}, editor={Börger, EgonEditor}, year={1987}, pages={208–223} }' chicago: 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. ieee: 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. mla: Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.” Computation Theory and Logic, edited by Egon Börger, 1987, pp. 208–23, doi:10.1007/3-540-18170-9_167. short: 'H.K. Büning, T. Lettmann, in: E. Börger (Ed.), Computation Theory and Logic, Berlin, Heidelberg, 1987, pp. 208–223.' date_created: 2020-10-01T09:08:05Z date_updated: 2022-01-06T06:54:13Z department: - _id: '34' - _id: '355' - _id: '7' doi: 10.1007/3-540-18170-9_167 editor: - first_name: Egon full_name: Börger, Egon last_name: Börger language: - iso: eng page: 208-223 place: Berlin, Heidelberg publication: Computation Theory and Logic publication_identifier: isbn: - '9783540181705' - '9783540477952' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Representation independent query and update operations on propositional definite Horn formulas type: book_chapter user_id: '315' year: '1987' ... --- _id: '19819' author: - first_name: H. full_name: Kleine Büning, H. last_name: Kleine Büning - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: 'Kleine Büning H, Lettmann T. Classes of first order formulas under various satisfiability definitions. In: 8th International Conference on Automated Deduction. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16780-3_119' apa: 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 bibtex: '@inbook{Kleine Büning_Lettmann_1986, place={Berlin, Heidelberg}, title={Classes of first order formulas under various satisfiability definitions}, DOI={10.1007/3-540-16780-3_119}, booktitle={8th International Conference on Automated Deduction}, author={Kleine Büning, H. and Lettmann, Theodor}, year={1986} }' chicago: 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. ieee: 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. mla: Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.” 8th International Conference on Automated Deduction, 1986, doi:10.1007/3-540-16780-3_119. short: 'H. Kleine Büning, T. Lettmann, in: 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.' date_created: 2020-10-01T08:56:14Z date_updated: 2022-01-06T06:54:13Z department: - _id: '34' - _id: '355' - _id: '7' doi: 10.1007/3-540-16780-3_119 language: - iso: eng place: Berlin, Heidelberg publication: 8th International Conference on Automated Deduction publication_identifier: isbn: - '9783540167808' - '9783540398615' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Classes of first order formulas under various satisfiability definitions type: book_chapter user_id: '315' year: '1986' ...