Forschungsprojekte
Im Folgenden finden Sie einige Informationen über abgeschlossene bzw. aktuell laufende Forschungsprojekte an der Fakultät, welche über das Forschungsinformationssystem zur Verfügung gestellt werden. Darüber hinaus finden Sie weitere Informationen zu Projekten auch über die Webseiten der jeweiligen Institute und Professuren.
2016
Quantitative Logiken und Automaten
Titel (Englisch)
Quantitative Logics and Automata
Kurzbeschreibung (Deutsch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Kurzbeschreibung (Englisch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Zeitraum
10/2012
Art der Finanzierung
Drittmittel
Projektleiter
- Herr Prof. Dr.-Ing. Franz Baader
- Frau PD Dr.-Ing. habil. Anni-Yasmin Turhan
Projektmitarbeiter
- Frau Dipl.-Inf. Veronika Thost
- Herr Dr. rer. nat. Daniel Borchmann
- Herr Dr.-Ing. Stefan Borgwardt
- Herr Dr. rer. nat. Marcel Lippmann
- Herr M.Sc. Christian Al-Rabbaa
- Herr M.Sc. Pavlos Marantidis
- Herr M.A. Willi Hieke
- Herr M.Sc. Jakub Rydval
- Herr M.Sc. Maximilian Pensel
Finanzierungseinrichtungen
- Deutsche Forschungsgemeinschaft
Kooperationspartnerschaft
regional
Interne Kooperationspartner
- Christel Baier, Lehrstuhl für algebraische und logische Grundlagen der Informatik
- Bernhard Ganter, Institut für Algebra
- Heiko Vogler, Lehrstuhl für Grundlagen der Programmierung
Externe Kooperationspartner
- Manfred Droste, Universität Leipzig (Deutschland)
- Gerhard Brewka, Universität Leipzig (Deutschland)
- Markus Lohrey, Universität Leipzig (Deutschland)
Website zum Projekt
Zugeordnetes DFG-Fachgebiet
Informatik
Relevant für den Umweltschutz
Nein
Relevant für Multimedia
Nein
Relevant für den Technologietransfer
Nein
Schlagwörter
Quantitative Logiken, Automatentheorie
Berichtsjahr
2012
2015
Quantitative Logiken und Automaten
Titel (Englisch)
Quantitative Logics and Automata
Kurzbeschreibung (Deutsch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Kurzbeschreibung (Englisch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Zeitraum
10/2012
Art der Finanzierung
Drittmittel
Projektleiter
- Herr Prof. Dr.-Ing. Franz Baader
- Frau PD Dr.-Ing. habil. Anni-Yasmin Turhan
Projektmitarbeiter
- Frau Dipl.-Inf. Veronika Thost
- Herr Dr. rer. nat. Daniel Borchmann
- Herr Dr.-Ing. Stefan Borgwardt
- Herr Dr. rer. nat. Marcel Lippmann
- Herr M.Sc. Christian Al-Rabbaa
- Herr M.Sc. Pavlos Marantidis
- Herr M.A. Willi Hieke
- Herr M.Sc. Jakub Rydval
- Herr M.Sc. Maximilian Pensel
Finanzierungseinrichtungen
- Deutsche Forschungsgemeinschaft
Kooperationspartnerschaft
regional
Interne Kooperationspartner
- Christel Baier, Lehrstuhl für algebraische und logische Grundlagen der Informatik
- Bernhard Ganter, Institut für Algebra
- Heiko Vogler, Lehrstuhl für Grundlagen der Programmierung
Externe Kooperationspartner
- Manfred Droste, Universität Leipzig (Deutschland)
- Gerhard Brewka, Universität Leipzig (Deutschland)
- Markus Lohrey, Universität Leipzig (Deutschland)
Website zum Projekt
Zugeordnetes DFG-Fachgebiet
Informatik
Relevant für den Umweltschutz
Nein
Relevant für Multimedia
Nein
Relevant für den Technologietransfer
Nein
Schlagwörter
Quantitative Logiken, Automatentheorie
Berichtsjahr
2012
2014
Quantitative Logiken und Automaten
Titel (Englisch)
Quantitative Logics and Automata
Kurzbeschreibung (Deutsch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Kurzbeschreibung (Englisch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Zeitraum
10/2012
Art der Finanzierung
Drittmittel
Projektleiter
- Herr Prof. Dr.-Ing. Franz Baader
- Frau PD Dr.-Ing. habil. Anni-Yasmin Turhan
Projektmitarbeiter
- Frau Dipl.-Inf. Veronika Thost
- Herr Dr. rer. nat. Daniel Borchmann
- Herr Dr.-Ing. Stefan Borgwardt
- Herr Dr. rer. nat. Marcel Lippmann
- Herr M.Sc. Christian Al-Rabbaa
- Herr M.Sc. Pavlos Marantidis
- Herr M.A. Willi Hieke
- Herr M.Sc. Jakub Rydval
- Herr M.Sc. Maximilian Pensel
Finanzierungseinrichtungen
- Deutsche Forschungsgemeinschaft
Kooperationspartnerschaft
regional
Interne Kooperationspartner
- Christel Baier, Lehrstuhl für algebraische und logische Grundlagen der Informatik
- Bernhard Ganter, Institut für Algebra
- Heiko Vogler, Lehrstuhl für Grundlagen der Programmierung
Externe Kooperationspartner
- Manfred Droste, Universität Leipzig (Deutschland)
- Gerhard Brewka, Universität Leipzig (Deutschland)
- Markus Lohrey, Universität Leipzig (Deutschland)
Website zum Projekt
Zugeordnetes DFG-Fachgebiet
Informatik
Relevant für den Umweltschutz
Nein
Relevant für Multimedia
Nein
Relevant für den Technologietransfer
Nein
Schlagwörter
Quantitative Logiken, Automatentheorie
Berichtsjahr
2012
2013
Quantitative Logiken und Automaten
Titel (Englisch)
Quantitative Logics and Automata
Kurzbeschreibung (Deutsch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Kurzbeschreibung (Englisch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Zeitraum
10/2012
Art der Finanzierung
Drittmittel
Projektleiter
- Herr Prof. Dr.-Ing. Franz Baader
- Frau PD Dr.-Ing. habil. Anni-Yasmin Turhan
Projektmitarbeiter
- Frau Dipl.-Inf. Veronika Thost
- Herr Dr. rer. nat. Daniel Borchmann
- Herr Dr.-Ing. Stefan Borgwardt
- Herr Dr. rer. nat. Marcel Lippmann
- Herr M.Sc. Christian Al-Rabbaa
- Herr M.Sc. Pavlos Marantidis
- Herr M.A. Willi Hieke
- Herr M.Sc. Jakub Rydval
- Herr M.Sc. Maximilian Pensel
Finanzierungseinrichtungen
- Deutsche Forschungsgemeinschaft
Kooperationspartnerschaft
regional
Interne Kooperationspartner
- Christel Baier, Lehrstuhl für algebraische und logische Grundlagen der Informatik
- Bernhard Ganter, Institut für Algebra
- Heiko Vogler, Lehrstuhl für Grundlagen der Programmierung
Externe Kooperationspartner
- Manfred Droste, Universität Leipzig (Deutschland)
- Gerhard Brewka, Universität Leipzig (Deutschland)
- Markus Lohrey, Universität Leipzig (Deutschland)
Website zum Projekt
Zugeordnetes DFG-Fachgebiet
Informatik
Relevant für den Umweltschutz
Nein
Relevant für Multimedia
Nein
Relevant für den Technologietransfer
Nein
Schlagwörter
Quantitative Logiken, Automatentheorie
Berichtsjahr
2012
2012
Quantitative Logiken und Automaten
Titel (Englisch)
Quantitative Logics and Automata
Kurzbeschreibung (Deutsch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Kurzbeschreibung (Englisch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Zeitraum
10/2012
Art der Finanzierung
Drittmittel
Projektleiter
- Herr Prof. Dr.-Ing. Franz Baader
- Frau PD Dr.-Ing. habil. Anni-Yasmin Turhan
Projektmitarbeiter
- Frau Dipl.-Inf. Veronika Thost
- Herr Dr. rer. nat. Daniel Borchmann
- Herr Dr.-Ing. Stefan Borgwardt
- Herr Dr. rer. nat. Marcel Lippmann
- Herr M.Sc. Christian Al-Rabbaa
- Herr M.Sc. Pavlos Marantidis
- Herr M.A. Willi Hieke
- Herr M.Sc. Jakub Rydval
- Herr M.Sc. Maximilian Pensel
Finanzierungseinrichtungen
- Deutsche Forschungsgemeinschaft
Kooperationspartnerschaft
regional
Interne Kooperationspartner
- Christel Baier, Lehrstuhl für algebraische und logische Grundlagen der Informatik
- Bernhard Ganter, Institut für Algebra
- Heiko Vogler, Lehrstuhl für Grundlagen der Programmierung
Externe Kooperationspartner
- Manfred Droste, Universität Leipzig (Deutschland)
- Gerhard Brewka, Universität Leipzig (Deutschland)
- Markus Lohrey, Universität Leipzig (Deutschland)
Website zum Projekt
Zugeordnetes DFG-Fachgebiet
Informatik
Relevant für den Umweltschutz
Nein
Relevant für Multimedia
Nein
Relevant für den Technologietransfer
Nein
Schlagwörter
Quantitative Logiken, Automatentheorie
Berichtsjahr
2012
2011
Quantitative Logiken und Automaten
Titel (Englisch)
Quantitative Logics and Automata
Kurzbeschreibung (Deutsch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Kurzbeschreibung (Englisch)
Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.rnrnThe aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.rnrnThe planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists—in addition to the weekly research seminar—of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
Zeitraum
10/2012
Art der Finanzierung
Drittmittel
Projektleiter
- Herr Prof. Dr.-Ing. Franz Baader
- Frau PD Dr.-Ing. habil. Anni-Yasmin Turhan
Projektmitarbeiter
- Frau Dipl.-Inf. Veronika Thost
- Herr Dr. rer. nat. Daniel Borchmann
- Herr Dr.-Ing. Stefan Borgwardt
- Herr Dr. rer. nat. Marcel Lippmann
- Herr M.Sc. Christian Al-Rabbaa
- Herr M.Sc. Pavlos Marantidis
- Herr M.A. Willi Hieke
- Herr M.Sc. Jakub Rydval
- Herr M.Sc. Maximilian Pensel
Finanzierungseinrichtungen
- Deutsche Forschungsgemeinschaft
Kooperationspartnerschaft
regional
Interne Kooperationspartner
- Christel Baier, Lehrstuhl für algebraische und logische Grundlagen der Informatik
- Bernhard Ganter, Institut für Algebra
- Heiko Vogler, Lehrstuhl für Grundlagen der Programmierung
Externe Kooperationspartner
- Manfred Droste, Universität Leipzig (Deutschland)
- Gerhard Brewka, Universität Leipzig (Deutschland)
- Markus Lohrey, Universität Leipzig (Deutschland)
Website zum Projekt
Zugeordnetes DFG-Fachgebiet
Informatik
Relevant für den Umweltschutz
Nein
Relevant für Multimedia
Nein
Relevant für den Technologietransfer
Nein
Schlagwörter
Quantitative Logiken, Automatentheorie
Berichtsjahr
2012