<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="de">
	<id>https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Elisa+B%C3%B6hl</id>
	<title>International Center for Computational Logic - Benutzerbeiträge [de]</title>
	<link rel="self" type="application/atom+xml" href="https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Elisa+B%C3%B6hl"/>
	<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/web/Spezial:Beitr%C3%A4ge/Elisa_B%C3%B6hl"/>
	<updated>2026-04-18T19:07:56Z</updated>
	<subtitle>Benutzerbeiträge</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Elisa_B%C3%B6hl&amp;diff=40533</id>
		<title>Elisa Böhl</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Elisa_B%C3%B6hl&amp;diff=40533"/>
		<updated>2024-11-19T12:30:09Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Telefon=+49 351 463 42666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 3032&lt;br /&gt;
|Bild=Elisa-400x600.jpg&lt;br /&gt;
|Info=&lt;br /&gt;
Seit November 2024 bin ich Teil des [https://www.perspicuous-computing.science/ CPEC]-Teams in der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Wissensbasierte_Systeme Wissensbasierte Systeme]. Meine Themen sind Answer Set Programming, mit Spezialisierung auf diverse Answer Sets und Multi-Shot ASP. &lt;br /&gt;
&amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Nach meinem Informatik-Diplom (TU Dresden) habe ich in der Arbeitsgruppe [https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] von [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer] die Software rund um optische Pinzetten mitgestaltet.&lt;br /&gt;
*Darauf folgend habe ich in Kooperation mit der [https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden] an HMM-basierenden Spracherkennern mit minimalen Hardwareanforderungen gearbeitet. &lt;br /&gt;
*Danach habe ich in der Arbeitsgruppe [https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] am [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden] Softwarelösungen für die Durchführung und Auswertung von Thermographieaufnahmen in der Neurochirurgie entwickelt.&lt;br /&gt;
*Seit 2019 war ich in der Gruppe [[Computational Logic]] von [[Sebastian Rudolph]] tätig.&lt;br /&gt;
*Im Oktober 2020 bin ich in das BMBF geförderten Projekt [[NAVAS | NAVAS - Navigation im Lösungsraum von Answer Sets]] der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] Gruppe von [[Sarah Alice Gaggl]] gewechselt. &lt;br /&gt;
|Info EN=&lt;br /&gt;
&lt;br /&gt;
Since November 2024 I&#039;m part of the [https://www.perspicuous-computing.science/ CPEC]-Team in the [https://iccl.inf.tu-dresden.de/web/Wissensbasierte_Systeme/en Knowledge-Based Systems] group. My topic covers Answer Set Programming, and I&#039;m specialized in diverse Answer Sets and Multi-Shot ASP.&lt;br /&gt;
&amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
After finishing my Diploma in Computer Science in Dresden I worked on a variety of different research groups on different topics&lt;br /&gt;
*[https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] from [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer]: Software around optical tweezers; Simulation around motor proteins&lt;br /&gt;
*[https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden]: minimalistic hmm-based embedded speech recognizer&lt;br /&gt;
*Neurochirurgie/[https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] at [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden]: Thermal imaging for brain surgery, focus on strokes and cancer.&lt;br /&gt;
*Starting Oktober 2019 I have worked in the group [[Computational Logic]] from [[Sebastian Rudolph]].&lt;br /&gt;
*In October 2020 I joined the NAVAS Project from the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=1&lt;br /&gt;
|Telefon=+49 351 463 666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 2031&lt;br /&gt;
|Bild=elisa-400x600.jpg&lt;br /&gt;
|Info=Hello&lt;br /&gt;
|Info EN=Hello&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
|@category=Mitarbeiter&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=1&lt;br /&gt;
|Telefon=+49 351 463 42666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 2017&lt;br /&gt;
|Bild=Elisa-400x600.jpg&lt;br /&gt;
|Info=Ich arbeite  seit Oktober 2020 im BMBF geförderten Projekt [[NAVAS | NAVAS - Navigation im Lösungsraum von Answer Sets]] der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] Gruppe von [[Sarah Alice Gaggl]] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Nach meinem Informatik-Diplom (TU Dresden) habe ich in der Arbeitsgruppe [https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] von [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer] die Software rund um optische Pinzetten mitgestaltet.&lt;br /&gt;
*Darauf folgend habe ich in Kooperation mit der [https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden] an HMM-basierenden Spracherkennern mit minimalen Hardwareanforderungen gearbeitet.&lt;br /&gt;
*Danach habe ich in der Arbeitsgruppe [https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] am [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden] Softwarelösungen für die Durchführung und Auswertung von Thermographieaufnahmen in der Neurochirurgie entwickelt.&lt;br /&gt;
*Seit 2019 war ich in der Gruppe [[Computational Logic]] von [[Sebastian Rudolph]] tätig und bin 2020 in die Arbeitsgruppe [[Logische Programmierung und Argumentation]] von [[Sarah Alice Gaggl]] gewechselt. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
|Info EN=I&#039;m the new member in the NAVAS Project from the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
After finishing my Diploma in Computer Science in Dresden I worked on a viarety of different research groups on different topics&lt;br /&gt;
*[https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] from [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer]: Software around optical tweezers&lt;br /&gt;
*[https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden]: minimalistic hmm-based speech recognizer&lt;br /&gt;
*Neurochirurgie/[https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] at [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden]: Thermal imaging&lt;br /&gt;
*Starting 2019 I have worked in the group [[Computational Logic]] from [[Sebastian Rudolph]] and switched 2020 into the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
|@category=Mitarbeiter&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Elisa_B%C3%B6hl&amp;diff=40532</id>
		<title>Elisa Böhl</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Elisa_B%C3%B6hl&amp;diff=40532"/>
		<updated>2024-11-19T12:29:13Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Telefon=+49 351 463 42666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 3032&lt;br /&gt;
|Bild=Elisa-400x600.jpg&lt;br /&gt;
|Info=&lt;br /&gt;
Seit November 2024 bin ich Teil des [https://www.perspicuous-computing.science/ CPEC]-Teams in der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Wissensbasierte_Systeme]. Meine Themen sind Answer Set Programming, mit Spezialisierung auf diverse Answer Sets und Multi-Shot ASP. &lt;br /&gt;
&amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Nach meinem Informatik-Diplom (TU Dresden) habe ich in der Arbeitsgruppe [https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] von [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer] die Software rund um optische Pinzetten mitgestaltet.&lt;br /&gt;
*Darauf folgend habe ich in Kooperation mit der [https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden] an HMM-basierenden Spracherkennern mit minimalen Hardwareanforderungen gearbeitet. &lt;br /&gt;
*Danach habe ich in der Arbeitsgruppe [https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] am [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden] Softwarelösungen für die Durchführung und Auswertung von Thermographieaufnahmen in der Neurochirurgie entwickelt.&lt;br /&gt;
*Seit 2019 war ich in der Gruppe [[Computational Logic]] von [[Sebastian Rudolph]] tätig.&lt;br /&gt;
*Im Oktober 2020 bin ich in das BMBF geförderten Projekt [[NAVAS | NAVAS - Navigation im Lösungsraum von Answer Sets]] der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] Gruppe von [[Sarah Alice Gaggl]] gewechselt. &lt;br /&gt;
|Info EN=&lt;br /&gt;
&lt;br /&gt;
Since November 2024 I&#039;m part of the [https://www.perspicuous-computing.science/ CPEC]-Team in the [https://iccl.inf.tu-dresden.de/web/Wissensbasierte_Systeme/en] group. My topic covers Answer Set Programming, and I&#039;m specialized in diverse Answer Sets and Multi-Shot ASP.&lt;br /&gt;
&amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
After finishing my Diploma in Computer Science in Dresden I worked on a variety of different research groups on different topics&lt;br /&gt;
*[https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] from [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer]: Software around optical tweezers; Simulation around motor proteins&lt;br /&gt;
*[https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden]: minimalistic hmm-based embedded speech recognizer&lt;br /&gt;
*Neurochirurgie/[https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] at [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden]: Thermal imaging for brain surgery, focus on strokes and cancer.&lt;br /&gt;
*Starting Oktober 2019 I have worked in the group [[Computational Logic]] from [[Sebastian Rudolph]].&lt;br /&gt;
*In October 2020 I joined the NAVAS Project from the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=1&lt;br /&gt;
|Telefon=+49 351 463 666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 2031&lt;br /&gt;
|Bild=elisa-400x600.jpg&lt;br /&gt;
|Info=Hello&lt;br /&gt;
|Info EN=Hello&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
|@category=Mitarbeiter&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=1&lt;br /&gt;
|Telefon=+49 351 463 42666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 2017&lt;br /&gt;
|Bild=Elisa-400x600.jpg&lt;br /&gt;
|Info=Ich arbeite  seit Oktober 2020 im BMBF geförderten Projekt [[NAVAS | NAVAS - Navigation im Lösungsraum von Answer Sets]] der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] Gruppe von [[Sarah Alice Gaggl]] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Nach meinem Informatik-Diplom (TU Dresden) habe ich in der Arbeitsgruppe [https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] von [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer] die Software rund um optische Pinzetten mitgestaltet.&lt;br /&gt;
*Darauf folgend habe ich in Kooperation mit der [https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden] an HMM-basierenden Spracherkennern mit minimalen Hardwareanforderungen gearbeitet.&lt;br /&gt;
*Danach habe ich in der Arbeitsgruppe [https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] am [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden] Softwarelösungen für die Durchführung und Auswertung von Thermographieaufnahmen in der Neurochirurgie entwickelt.&lt;br /&gt;
*Seit 2019 war ich in der Gruppe [[Computational Logic]] von [[Sebastian Rudolph]] tätig und bin 2020 in die Arbeitsgruppe [[Logische Programmierung und Argumentation]] von [[Sarah Alice Gaggl]] gewechselt. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
|Info EN=I&#039;m the new member in the NAVAS Project from the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
After finishing my Diploma in Computer Science in Dresden I worked on a viarety of different research groups on different topics&lt;br /&gt;
*[https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] from [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer]: Software around optical tweezers&lt;br /&gt;
*[https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden]: minimalistic hmm-based speech recognizer&lt;br /&gt;
*Neurochirurgie/[https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] at [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden]: Thermal imaging&lt;br /&gt;
*Starting 2019 I have worked in the group [[Computational Logic]] from [[Sebastian Rudolph]] and switched 2020 into the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
|@category=Mitarbeiter&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Elisa_B%C3%B6hl&amp;diff=40531</id>
		<title>Elisa Böhl</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Elisa_B%C3%B6hl&amp;diff=40531"/>
		<updated>2024-11-19T12:27:54Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Wissensbasierte Systeme&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Telefon=+49 351 463 42666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 3032&lt;br /&gt;
|Bild=Elisa-400x600.jpg&lt;br /&gt;
|Info=&lt;br /&gt;
Seit November 2024 bin ich Teil des [[CPEC|https://www.perspicuous-computing.science/]]-Teams in der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Wissensbasierte_Systeme]. Meine Themen sind Answer Set Programming, mit Spezialisierung auf diverse Answer Sets und Multi-Shot ASP. &lt;br /&gt;
&amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Nach meinem Informatik-Diplom (TU Dresden) habe ich in der Arbeitsgruppe [https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] von [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer] die Software rund um optische Pinzetten mitgestaltet.&lt;br /&gt;
*Darauf folgend habe ich in Kooperation mit der [https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden] an HMM-basierenden Spracherkennern mit minimalen Hardwareanforderungen gearbeitet. &lt;br /&gt;
*Danach habe ich in der Arbeitsgruppe [https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] am [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden] Softwarelösungen für die Durchführung und Auswertung von Thermographieaufnahmen in der Neurochirurgie entwickelt.&lt;br /&gt;
*Seit 2019 war ich in der Gruppe [[Computational Logic]] von [[Sebastian Rudolph]] tätig.&lt;br /&gt;
*Im Oktober 2020 bin ich in das BMBF geförderten Projekt [[NAVAS | NAVAS - Navigation im Lösungsraum von Answer Sets]] der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] Gruppe von [[Sarah Alice Gaggl]] gewechselt. &lt;br /&gt;
|Info EN=&lt;br /&gt;
&lt;br /&gt;
Since November 2024 I&#039;m part of the [[CPEC|https://www.perspicuous-computing.science/]]-Team in the [https://iccl.inf.tu-dresden.de/web/Wissensbasierte_Systeme/en] group. My topic covers Answer Set Programming, and I&#039;m specialized in diverse Answer Sets and Multi-Shot ASP.&lt;br /&gt;
&amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
After finishing my Diploma in Computer Science in Dresden I worked on a variety of different research groups on different topics&lt;br /&gt;
*[https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] from [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer]: Software around optical tweezers; Simulation around motor proteins&lt;br /&gt;
*[https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden]: minimalistic hmm-based embedded speech recognizer&lt;br /&gt;
*Neurochirurgie/[https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] at [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden]: Thermal imaging for brain surgery, focus on strokes and cancer.&lt;br /&gt;
*Starting Oktober 2019 I have worked in the group [[Computational Logic]] from [[Sebastian Rudolph]].&lt;br /&gt;
*In October 2020 I joined the NAVAS Project from the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=1&lt;br /&gt;
|Telefon=+49 351 463 666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 2031&lt;br /&gt;
|Bild=elisa-400x600.jpg&lt;br /&gt;
|Info=Hello&lt;br /&gt;
|Info EN=Hello&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
|@category=Mitarbeiter&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=1&lt;br /&gt;
|Telefon=+49 351 463 42666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 2017&lt;br /&gt;
|Bild=Elisa-400x600.jpg&lt;br /&gt;
|Info=Ich arbeite  seit Oktober 2020 im BMBF geförderten Projekt [[NAVAS | NAVAS - Navigation im Lösungsraum von Answer Sets]] der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] Gruppe von [[Sarah Alice Gaggl]] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Nach meinem Informatik-Diplom (TU Dresden) habe ich in der Arbeitsgruppe [https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] von [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer] die Software rund um optische Pinzetten mitgestaltet.&lt;br /&gt;
*Darauf folgend habe ich in Kooperation mit der [https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden] an HMM-basierenden Spracherkennern mit minimalen Hardwareanforderungen gearbeitet.&lt;br /&gt;
*Danach habe ich in der Arbeitsgruppe [https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] am [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden] Softwarelösungen für die Durchführung und Auswertung von Thermographieaufnahmen in der Neurochirurgie entwickelt.&lt;br /&gt;
*Seit 2019 war ich in der Gruppe [[Computational Logic]] von [[Sebastian Rudolph]] tätig und bin 2020 in die Arbeitsgruppe [[Logische Programmierung und Argumentation]] von [[Sarah Alice Gaggl]] gewechselt. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
|Info EN=I&#039;m the new member in the NAVAS Project from the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
After finishing my Diploma in Computer Science in Dresden I worked on a viarety of different research groups on different topics&lt;br /&gt;
*[https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] from [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer]: Software around optical tweezers&lt;br /&gt;
*[https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden]: minimalistic hmm-based speech recognizer&lt;br /&gt;
*Neurochirurgie/[https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] at [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden]: Thermal imaging&lt;br /&gt;
*Starting 2019 I have worked in the group [[Computational Logic]] from [[Sebastian Rudolph]] and switched 2020 into the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
|@category=Mitarbeiter&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3334&amp;diff=40386</id>
		<title>Inproceedings3334</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3334&amp;diff=40386"/>
		<updated>2024-10-23T14:04:26Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Elisa&lt;br /&gt;
|ErsterAutorNachname=Böhl&lt;br /&gt;
|FurtherAuthors=Sarah Alice Gaggl&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy&lt;br /&gt;
|To appear=0&lt;br /&gt;
|Year=2022&lt;br /&gt;
|Month=August&lt;br /&gt;
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)&lt;br /&gt;
|Pages=89-102&lt;br /&gt;
|Publisher=Springer International Publishing&lt;br /&gt;
|Editor=Georg Gottlob, Daniela Inclezan, Marco Maratea&lt;br /&gt;
|Series=Lecture Notes in Computer Science&lt;br /&gt;
|Volume=13416&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Answer set programming (ASP) solvers have advanced in recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process, the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets one after another by iteratively solving and updating the program. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.&lt;br /&gt;
|ISBN=978-3-031-15707-3&lt;br /&gt;
|Download=LPNMR EB.pdf&lt;br /&gt;
|Slides=Tunas.talk.pdf&lt;br /&gt;
|DOI Name=https://doi.org/10.1007/978-3-031-15707-3_8&lt;br /&gt;
|Projekt=NAVAS&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Answer Set Programming&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Tunas.talk.pdf&amp;diff=40385</id>
		<title>Datei:Tunas.talk.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Tunas.talk.pdf&amp;diff=40385"/>
		<updated>2024-10-23T14:04:01Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: LPNMR&amp;#039;22&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;LPNMR&#039;22&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3368&amp;diff=40384</id>
		<title>Inproceedings3368</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3368&amp;diff=40384"/>
		<updated>2024-10-23T13:57:24Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Elisa&lt;br /&gt;
|ErsterAutorNachname=Böhl&lt;br /&gt;
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Representative Answer Sets: Collecting Something of Everything&lt;br /&gt;
|To appear=0&lt;br /&gt;
|Year=2023&lt;br /&gt;
|Month=September&lt;br /&gt;
|Booktitle=Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)&lt;br /&gt;
|Pages=271--278&lt;br /&gt;
|Publisher=IOS Press&lt;br /&gt;
|Editor=Kobi Gal, Ann Nowé, Grzegorz J. Nalepa, Roy Fairstein, Roxana Radulescu&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Answer set programming (ASP) is a popular problem solving paradigm with&lt;br /&gt;
			applications in planning and configuration.&lt;br /&gt;
			In practice, the number of answer sets can be overwhelmingly high, which&lt;br /&gt;
			naturally causes interest in a concise characterisation of the solution space&lt;br /&gt;
			in terms of representative answer sets.&lt;br /&gt;
			We establish a notion of representativeness that refers to the entropy of&lt;br /&gt;
			specified target atoms within a collection of answer sets. Accordingly, we&lt;br /&gt;
			propose different approaches for collecting such representative answer sets,&lt;br /&gt;
			based on answer set navigation.&lt;br /&gt;
			Finally, we conduct experiments using our prototypical implementation, which &lt;br /&gt;
			reveals promising results.&lt;br /&gt;
|Download=2023BGR.pdf&lt;br /&gt;
|Slides=Soetalk.pdf&lt;br /&gt;
|Link=https://doi.org/10.3233/FAIA230280&lt;br /&gt;
|DOI Name=10.3233/FAIA230280&lt;br /&gt;
|Projekt=NAVAS&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Answer Set Programming&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Soetalk.pdf&amp;diff=40383</id>
		<title>Datei:Soetalk.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Soetalk.pdf&amp;diff=40383"/>
		<updated>2024-10-23T13:56:20Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: ECAI&amp;#039;23&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;ECAI&#039;23&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40382</id>
		<title>Inproceedings3387</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40382"/>
		<updated>2024-10-23T13:55:12Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Elisa&lt;br /&gt;
|ErsterAutorNachname=Böhl&lt;br /&gt;
|FurtherAuthors=Stefan Ellmauthaler; Sarah Alice Gaggl&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Winning Snake: Design Choices in Multi-Shot ASP&lt;br /&gt;
|To appear=1&lt;br /&gt;
|Year=2024&lt;br /&gt;
|Month=Oktober&lt;br /&gt;
|Booktitle=Proceedings of the 40th International Conference on Logic Programming (ICLP 2024)&lt;br /&gt;
|Note=preprint at arxiv.org/abs/2408.08150&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper compiles and demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snakes. This game is particularly interesting because a victory can be assured by solving the NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game&#039;s progress.&lt;br /&gt;
|Download=Snakesplus.pdf&lt;br /&gt;
|Slides=24Snaketalk.pdf&lt;br /&gt;
|DOI Name=doi.org/10.48550/arXiv.2408.08150&lt;br /&gt;
|Projekt=Cfaed, InnoSale, NAVAS, ScaDS.AI&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:24Snaketalk.pdf&amp;diff=40381</id>
		<title>Datei:24Snaketalk.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:24Snaketalk.pdf&amp;diff=40381"/>
		<updated>2024-10-23T13:55:04Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: ICLP&amp;#039;24&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;ICLP&#039;24&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Snaketalk.pdf&amp;diff=40379</id>
		<title>Datei:Snaketalk.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Snaketalk.pdf&amp;diff=40379"/>
		<updated>2024-10-23T12:39:20Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Talk from ICLP&amp;#039;24&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Talk from ICLP&#039;24&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=CPEC&amp;diff=40148</id>
		<title>CPEC</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=CPEC&amp;diff=40148"/>
		<updated>2024-09-24T14:46:13Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Projekt&lt;br /&gt;
|Kurzname=CPEC&lt;br /&gt;
|Name=Grundlagen verständlicher Softwaresysteme&lt;br /&gt;
|Name EN=Center for Perspicuous Computing&lt;br /&gt;
|Beschreibung DE=Der Sonderforschungsbereich 248 &#039;&#039;&#039;Grundlagen verständlicher Softwaresysteme&#039;&#039;&#039; (Center for Perspicuous Computing, CPEC) zielt darauf ab, die cyber-physikalische Welt für Menschen nachvollziehbar zu gestalten.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Computergestützte Systeme treffen zunehmend Entscheidungen, die Auswirkungen auf den Menschen haben. Darum&lt;br /&gt;
müssen sie in der Lage sein, dem Menschen zu kommunizieren, wie einzelne Entscheidungen zustande kommen. Der&lt;br /&gt;
SFB/Transregio „Grundlagen verständlicher Softwaresysteme – Für eine nachvollziehbare cyber-physische Welt“&lt;br /&gt;
widmet sich den wissenschaftlichen Grundlagen nachvollziehbarer Software. Die neu gewonnenen Erkenntnisse werden&lt;br /&gt;
in die Entwicklung softwarebasierter Systeme einfließen, die vorhersagbar und nachvollziehbar agieren.&lt;br /&gt;
|Beschreibung EN=The Transregional Collaborative Research Centre 248 &#039;&#039;&#039;Center for Perspicuous Computing&#039;&#039;&#039; (CPEC) aims at enabling comprehension in a cyber-physical world with the human in the loop.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
From autonomous vehicles to Industry 4.0, from smart homes to smart cities – increasingly computer programs participate in actions and decisions that affect humans. However, our understanding of how these applications interact and what is the cause of a specific automated decision is lagging far behind. With the increase in cyber-physical technology impacting our lives, the consequences of this gradual loss in understanding are becoming severe. Systems lack support for making their behaviour plausible to their users. And even for technology experts it is nowadays virtually impossible to provide scientifically well-founded answers to questions about the exact reasons that lead to a particular decision, or about the responsibility for a malfunctioning. The root cause of the problem is that contemporary systems do not have any built-in concepts to explicate their behaviour. They calculate and propagate outcomes of computations, but are not designed to provide explanations. They are not perspicuous.&lt;br /&gt;
&lt;br /&gt;
The key to enable comprehension in a cyber-physical world is a science of perspicuous computing, and it is the overarching goal of CPEC to develop the necessary tools and methods to support this. To this end, CPEC brings together researchers from formal methods, artificial intelligence, and human-computer interaction in a closely connected consortium of researchers from TU Dresden, Saarland University, and selected partners at two Max-Planck Institutes and the University of Tübingen.&lt;br /&gt;
|Kontaktperson=Raimund Dachselt&lt;br /&gt;
|URL=https://perspicuous-computing.science/&lt;br /&gt;
|Start=2019/01/01&lt;br /&gt;
|Ende=2026/12/31&lt;br /&gt;
|Finanziert von=DFG&lt;br /&gt;
|Projektstatus=aktiv&lt;br /&gt;
|Logo=CPEC-logo.png&lt;br /&gt;
|Person=Franz Baader, Christel Baier, Stefan Borgwardt, Markus Krötzsch, Ali Elhalawati, Irina Dragoste, Lukas Gerlach, Stephan Mennicke&lt;br /&gt;
|Forschungsgruppe=Automatentheorie, Verifikation und formale quantitative Analyse, Wissensbasierte Systeme&lt;br /&gt;
|Partner=Universität des Saarlandes, Max-Planck-Institut für Softwaresysteme, Max-Planck-Institut für Informatik&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Abstrakte Argumentation&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Beschreibungslogiken&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Existenzielle Regeln&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Semantische Technologien&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40054</id>
		<title>Inproceedings3387</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40054"/>
		<updated>2024-08-30T12:19:32Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Elisa&lt;br /&gt;
|ErsterAutorNachname=Böhl&lt;br /&gt;
|FurtherAuthors=Stefan Ellmauthaler; Sarah Alice Gaggl&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Winning Snake: Design Choices in Multi-Shot ASP&lt;br /&gt;
|To appear=1&lt;br /&gt;
|Year=2024&lt;br /&gt;
|Month=Oktober&lt;br /&gt;
|Booktitle=Proceedings of the 40th International Conference on Logic Programming (ICLP 2024)&lt;br /&gt;
|Note=preprint at arxiv.org/abs/2408.08150&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper compiles and demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snakes. This game is particularly interesting because a victory can be assured by solving the NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game&#039;s progress.&lt;br /&gt;
|Download=Snakesplus.pdf&lt;br /&gt;
|DOI Name=doi.org/10.48550/arXiv.2408.08150&lt;br /&gt;
|Projekt=Cfaed, InnoSale, NAVAS, ScaDS.AI&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40053</id>
		<title>Inproceedings3387</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40053"/>
		<updated>2024-08-30T12:18:17Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Elisa&lt;br /&gt;
|ErsterAutorNachname=Böhl&lt;br /&gt;
|FurtherAuthors=Stefan Ellmauthaler; Sarah Alice Gaggl&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Winning Snake: Design Choices in Multi-Shot ASP&lt;br /&gt;
|To appear=1&lt;br /&gt;
|Year=2024&lt;br /&gt;
|Month=Oktober&lt;br /&gt;
|Booktitle=Proceedings of the 40th International Conference on Logic Programming (ICLP 2024)&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper compiles and demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snakes. This game is particularly interesting because a victory can be assured by solving the NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game&#039;s progress.&lt;br /&gt;
|Download=Snakesplus.pdf&lt;br /&gt;
|DOI Name=doi.org/10.48550/arXiv.2408.08150&lt;br /&gt;
|Projekt=Cfaed, InnoSale, NAVAS, ScaDS.AI&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40049</id>
		<title>Inproceedings3387</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40049"/>
		<updated>2024-08-23T14:04:36Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Elisa&lt;br /&gt;
|ErsterAutorNachname=Böhl&lt;br /&gt;
|FurtherAuthors=Stefan Ellmauthaler; Sarah Alice Gaggl&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Winning Snake: Design Choices in Multi-Shot ASP&lt;br /&gt;
|To appear=1&lt;br /&gt;
|Year=2024&lt;br /&gt;
|Month=Oktober&lt;br /&gt;
|Booktitle=Proceedings of the 40th International Conference on Logic Programming (ICLP 2024)&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper compiles and demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snakes. This game is particularly interesting because a victory can be assured by solving the NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game&#039;s progress.&lt;br /&gt;
|Download=Snakesplus.pdf&lt;br /&gt;
|Projekt=Cfaed, InnoSale, NAVAS, ScaDS.AI&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Snakesplus.pdf&amp;diff=40048</id>
		<title>Datei:Snakesplus.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Snakesplus.pdf&amp;diff=40048"/>
		<updated>2024-08-23T14:04:23Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Elisa_B%C3%B6hl&amp;diff=40036</id>
		<title>Elisa Böhl</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Elisa_B%C3%B6hl&amp;diff=40036"/>
		<updated>2024-08-21T08:26:40Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Telefon=+49 351 463 42666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 2017&lt;br /&gt;
|Bild=Elisa-400x600.jpg&lt;br /&gt;
|Info=Ich arbeite  seit Oktober 2020 im BMBF geförderten Projekt [[NAVAS | NAVAS - Navigation im Lösungsraum von Answer Sets]] der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] Gruppe von [[Sarah Alice Gaggl]] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Nach meinem Informatik-Diplom (TU Dresden) habe ich in der Arbeitsgruppe [https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] von [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer] die Software rund um optische Pinzetten mitgestaltet.&lt;br /&gt;
*Darauf folgend habe ich in Kooperation mit der [https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden] an HMM-basierenden Spracherkennern mit minimalen Hardwareanforderungen gearbeitet. &lt;br /&gt;
*Danach habe ich in der Arbeitsgruppe [https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] am [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden] Softwarelösungen für die Durchführung und Auswertung von Thermographieaufnahmen in der Neurochirurgie entwickelt.&lt;br /&gt;
*Seit 2019 war ich in der Gruppe [[Computational Logic]] von [[Sebastian Rudolph]] tätig und bin 2020 in die Arbeitsgruppe [[Logische Programmierung und Argumentation]] von [[Sarah Alice Gaggl]] gewechselt. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
|Info EN=I&#039;m the new member in the NAVAS Project from the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
After finishing my Diploma in Computer Science in Dresden I worked on a viarety of different research groups on different topics&lt;br /&gt;
*[https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] from [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer]: Software around optical tweezers&lt;br /&gt;
*[https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden]: minimalistic hmm-based speech recognizer&lt;br /&gt;
*Neurochirurgie/[https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] at [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden]: Thermal imaging&lt;br /&gt;
*Starting 2019 I have worked in the group [[Computational Logic]] from [[Sebastian Rudolph]] and switched 2020 into the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=1&lt;br /&gt;
|Telefon=+49 351 463 666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 2031&lt;br /&gt;
|Bild=elisa-400x600.jpg&lt;br /&gt;
|Info=Hello&lt;br /&gt;
|Info EN=Hello&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
|@category=Mitarbeiter&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40006</id>
		<title>Inproceedings3387</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40006"/>
		<updated>2024-08-06T12:18:27Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: typo&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Elisa&lt;br /&gt;
|ErsterAutorNachname=Böhl&lt;br /&gt;
|FurtherAuthors=Stefan Ellmauthaler; Sarah Alice Gaggl&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Winning Snake: Design Choices in Multi-Shot ASP&lt;br /&gt;
|To appear=1&lt;br /&gt;
|Year=2024&lt;br /&gt;
|Month=Oktober&lt;br /&gt;
|Booktitle=Proceeding of the 40th International Conference on Logic Programming (ICLP 2024)&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper compiles and demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snakes. This game is particularly interesting because a victory can be assured by solving the NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game&#039;s progress.&lt;br /&gt;
|Projekt=NAVAS&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40005</id>
		<title>Inproceedings3387</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3387&amp;diff=40005"/>
		<updated>2024-08-06T12:16:45Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Elisa |ErsterAutorNachname=Böhl |FurtherAuthors=Stefan Ellmauthaler; Sarah Alice Gaggl }} {{Inproceedings |Referiert=1 |Title=Winning Snake: Design Choices in Multi-Shot ASP |To appear=1 |Year=2024 |Month=Oktober |Booktitle=Proceeding of the 38th International Conference on Logic Programming (ICLP 2024) }} {{Publikation Details |Abstract=Answer set programming is a well-understood and established problem-sol…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Elisa&lt;br /&gt;
|ErsterAutorNachname=Böhl&lt;br /&gt;
|FurtherAuthors=Stefan Ellmauthaler; Sarah Alice Gaggl&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Winning Snake: Design Choices in Multi-Shot ASP&lt;br /&gt;
|To appear=1&lt;br /&gt;
|Year=2024&lt;br /&gt;
|Month=Oktober&lt;br /&gt;
|Booktitle=Proceeding of the 38th International Conference on Logic Programming (ICLP 2024)&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper compiles and demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snakes. This game is particularly interesting because a victory can be assured by solving the NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game&#039;s progress.&lt;br /&gt;
|Projekt=NAVAS&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Proceedings3025/en&amp;diff=40004</id>
		<title>Proceedings3025/en</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Proceedings3025/en&amp;diff=40004"/>
		<updated>2024-08-06T12:08:58Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Page created automatically by parser function on page Proceedings3025&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#REDIRECT [[Proceedings3025]]&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3368&amp;diff=39460</id>
		<title>Inproceedings3368</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3368&amp;diff=39460"/>
		<updated>2024-04-02T11:17:25Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Elisa&lt;br /&gt;
|ErsterAutorNachname=Böhl&lt;br /&gt;
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Representative Answer Sets: Collecting Something of Everything&lt;br /&gt;
|To appear=0&lt;br /&gt;
|Year=2023&lt;br /&gt;
|Month=September&lt;br /&gt;
|Booktitle=Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)&lt;br /&gt;
|Pages=271--278&lt;br /&gt;
|Publisher=IOS Press&lt;br /&gt;
|Editor=Kobi Gal, Ann Nowé, Grzegorz J. Nalepa, Roy Fairstein, Roxana Radulescu&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Answer set programming (ASP) is a popular problem solving paradigm with&lt;br /&gt;
			applications in planning and configuration.&lt;br /&gt;
			In practice, the number of answer sets can be overwhelmingly high, which&lt;br /&gt;
			naturally causes interest in a concise characterisation of the solution space&lt;br /&gt;
			in terms of representative answer sets.&lt;br /&gt;
			We establish a notion of representativeness that refers to the entropy of&lt;br /&gt;
			specified target atoms within a collection of answer sets. Accordingly, we&lt;br /&gt;
			propose different approaches for collecting such representative answer sets,&lt;br /&gt;
			based on answer set navigation.&lt;br /&gt;
			Finally, we conduct experiments using our prototypical implementation, which &lt;br /&gt;
			reveals promising results.&lt;br /&gt;
|Download=2023BGR.pdf&lt;br /&gt;
|Link=https://doi.org/10.3233/FAIA230280&lt;br /&gt;
|DOI Name=10.3233/FAIA230280&lt;br /&gt;
|Projekt=NAVAS&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Answer Set Programming&lt;br /&gt;
}}&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
, Grzegorz J. Nalepa, Roy Fairstein, Roxana Radulescu&lt;br /&gt;
|Series=Frontiers in Artificial Intelligence and Applications&lt;br /&gt;
|Volume=372&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:2023BGR.pdf&amp;diff=39459</id>
		<title>Datei:2023BGR.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:2023BGR.pdf&amp;diff=39459"/>
		<updated>2024-04-02T11:17:11Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3368&amp;diff=39383</id>
		<title>Inproceedings3368</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3368&amp;diff=39383"/>
		<updated>2024-01-30T14:17:16Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Publikation Erster Autor&lt;br /&gt;
|ErsterAutorVorname=Elisa&lt;br /&gt;
|ErsterAutorNachname=Böhl&lt;br /&gt;
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac&lt;br /&gt;
}}&lt;br /&gt;
{{Inproceedings&lt;br /&gt;
|Referiert=1&lt;br /&gt;
|Title=Representative Answer Sets: Collecting Something of Everything&lt;br /&gt;
|To appear=0&lt;br /&gt;
|Year=2023&lt;br /&gt;
|Month=September&lt;br /&gt;
|Booktitle=Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)&lt;br /&gt;
|Pages=271--278&lt;br /&gt;
|Publisher=IOS Press&lt;br /&gt;
|Editor=Kobi Gal, Ann Nowé, Grzegorz J. Nalepa, Roy Fairstein, Roxana Radulescu&lt;br /&gt;
}}&lt;br /&gt;
{{Publikation Details&lt;br /&gt;
|Abstract=Answer set programming (ASP) is a popular problem solving paradigm with&lt;br /&gt;
			applications in planning and configuration.&lt;br /&gt;
			In practice, the number of answer sets can be overwhelmingly high, which&lt;br /&gt;
			naturally causes interest in a concise characterisation of the solution space&lt;br /&gt;
			in terms of representative answer sets.&lt;br /&gt;
			We establish a notion of representativeness that refers to the entropy of&lt;br /&gt;
			specified target atoms within a collection of answer sets. Accordingly, we&lt;br /&gt;
			propose different approaches for collecting such representative answer sets,&lt;br /&gt;
			based on answer set navigation.&lt;br /&gt;
			Finally, we conduct experiments using our prototypical implementation, which &lt;br /&gt;
			reveals promising results.&lt;br /&gt;
|Download=BGR 2023.pdf&lt;br /&gt;
|Link=https://doi.org/10.3233/FAIA230280&lt;br /&gt;
|DOI Name=10.3233/FAIA230280&lt;br /&gt;
|Projekt=NAVAS&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Answer Set Programming&lt;br /&gt;
}}&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
, Grzegorz J. Nalepa, Roy Fairstein, Roxana Radulescu&lt;br /&gt;
|Series=Frontiers in Artificial Intelligence and Applications&lt;br /&gt;
|Volume=372&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:BGR_2023.pdf&amp;diff=39382</id>
		<title>Datei:BGR 2023.pdf</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:BGR_2023.pdf&amp;diff=39382"/>
		<updated>2024-01-30T14:16:41Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36441</id>
		<title>Sarah Alice Gaggl/NAVAS Workshop-Wien</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36441"/>
		<updated>2022-05-11T10:29:11Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The NAVAS workshop on &#039;&#039;Navigation Approaches for Answer Sets&#039;&#039; is jointly organized by research groups at [http://www.tuwien.at TU Wien] and [http://www.tu-dresden.de TU Dresden] will take place in Vienna, Austria, May 23-25, 2022. &lt;br /&gt;
&lt;br /&gt;
[[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]&lt;br /&gt;
&lt;br /&gt;
{{#maketabs:&lt;br /&gt;
|Aim and Scope=&lt;br /&gt;
&lt;br /&gt;
|Program=&lt;br /&gt;
The NaVAS workshop will take place from Monday, May 23th until Wednesday May 25th of 2022. &lt;br /&gt;
&lt;br /&gt;
Monday, May 23th:&lt;br /&gt;
&lt;br /&gt;
*09:15 - 09:20 Welcome&lt;br /&gt;
*09:20 - 09:45 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]&lt;br /&gt;
*09:45 - 10:15 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy -  [[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
*10:15 - 10:30 Coffee break&lt;br /&gt;
&lt;br /&gt;
*10:30 - 11:00 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]&lt;br /&gt;
*11:30 - 12:00 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy - [[Dominik Rusovac]]&lt;br /&gt;
*12:00 - 12:30 Talk: Existential Abstraction on Argumentation Frameworks via Clustering - [https://wallner.ist.tugraz.at/ Johannes Wallner]&lt;br /&gt;
&lt;br /&gt;
*12:30 - 14:00 Lunch Break&lt;br /&gt;
&lt;br /&gt;
*14:00 - 18:00 internal meetings&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Tuesday, May 24th:&lt;br /&gt;
*09:00 - 10:00 internal meetings&lt;br /&gt;
&lt;br /&gt;
*14:00 - 19:00 [https://www.tuwien.at/caiml/news-detail/caiml-annual-event-edward-a-lee/# CAIML Lectures] - [https://www2.eecs.berkeley.edu/Faculty/Homepages/lee.html Edward A. Lee], [https://www.dc.fi.udc.es/~cabalar/ Pedro Cabalar]&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--TODO: link ersetzen --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|Abstracts=&lt;br /&gt;
For the schedule on on Monday, May 23th the following talks are presented.&lt;br /&gt;
&lt;br /&gt;
=== Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===&lt;br /&gt;
[[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) solvers have advanced in the recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.&lt;br /&gt;
&lt;br /&gt;
=== Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===&lt;br /&gt;
[[Martin Diller]]&lt;br /&gt;
&lt;br /&gt;
Assumption-based argumentation (ABA) is one of the main general frameworks for structured argumentation. Dispute derivations for ABA allow for evaluating claims in a dialectical manner: i.e. on the basis of an exchange of arguments and counter-arguments for a claim between a proponent and an opponent of the claim. Current versions of dispute derivations are geared towards determining (credulous) acceptance of claims w.r.t. the admissibility-based semantics that ABA inherits from abstract argumentation. Relatedly, they make use of backwards or top down reasoning for constructing arguments. In this work we define flexible dispute derivations with forward as well as backward reasoning allowing us, in particular, to also have dispute derivations for finding admissible, complete, and stable assumption sets rather than only determine acceptability of claims. We give an argumentation-based definition of such dispute derivations and a more implementation friendly alternative representation in which disputes involve exchange of claims and rules rather than arguments. These can be seen as elaborations on, in particular, existing graph-based dispute derivations on two fronts: first, in also allowing for forward reasoning; second, in that all arguments put forward in the dispute are represented by a graph and not only the proponents.&lt;br /&gt;
&lt;br /&gt;
=== Rushing and Strolling among Answer Sets - Navigation Made Easy ===&lt;br /&gt;
[[Dominik Rusovac]] &lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) is a popular declarative programming paradigm with a wide range of applications in artificial intelligence. Oftentimes, when modeling an AI problem with ASP, and in particular when we are interested beyond simple search for optimal solutions, an actual solution, differences between solutions, or number of solutions of the ASP program matter. For example, when a user aims to identify a specific answer set according to her needs, or requires the total number of diverging solutions to comprehend probabilistic applications such as reasoning in medical domains. Then, there are only certain problem specific and handcrafted encoding techniques available to navigate the solution space of ASP programs, which is oftentimes not enough. We propose a formal and general framework for interactive navigation toward desired subsets of answer sets analogous to faceted browsing. Our approach enables the user to explore the solution space by consciously zooming in or out of sub-spaces of solutions at a certain configurable pace. We illustrate that weighted faceted navigation is computationally hard. Finally, we provide an implementation of our approach that demonstrates the feasibility of our framework for incomprehensible solution spaces.&lt;br /&gt;
&lt;br /&gt;
=== Existential Abstraction on Argumentation Frameworks via Clustering ===&lt;br /&gt;
[https://wallner.ist.tugraz.at/ Johannes Wallner]&lt;br /&gt;
&lt;br /&gt;
Argumentation in Artificial Intelligence (AI) builds on formal&lt;br /&gt;
approaches to reasoning argumentatively. Common to many such approaches&lt;br /&gt;
is to use argumentation frameworks (AFs) as reasoning engines, with AFs&lt;br /&gt;
being composed of arguments and attacks between arguments, which are&lt;br /&gt;
instantiated from knowledge bases in a principle-based manner. While&lt;br /&gt;
representing what can be argued for in an AF provides a conceptually&lt;br /&gt;
clean way, this process can face challenges arising from generating a&lt;br /&gt;
large number of arguments, which can act as a barrier to explainability.&lt;br /&gt;
Inspired by successful approaches to model checking where the state&lt;br /&gt;
explosion is mitigated by applying existential abstraction, we study an&lt;br /&gt;
adaption of existential abstraction in form of clustering arguments in&lt;br /&gt;
an AF to address an associated &amp;quot;argument explosion&amp;quot;. In the paper on&lt;br /&gt;
which this talk is based on, we provide a foundational investigation of&lt;br /&gt;
this form of existential abstraction by defining semantics of the&lt;br /&gt;
resulting clustered AFs, which balance two inherent aspects of&lt;br /&gt;
existential abstractions: abstracting from concrete AFs and not&lt;br /&gt;
permitting too much spuriousness (i.e., conclusions that hold on the&lt;br /&gt;
abstraction but not on the original AF). Moreover, we show properties of&lt;br /&gt;
clustered AFs, including complexity results, discuss use of clusterings&lt;br /&gt;
for explaining results of reasoning tasks, and employ the recently&lt;br /&gt;
introduced methodology of abstraction in answer set programming (ASP)&lt;br /&gt;
for obtaining and reasoning over clustered AFs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|Organization=&lt;br /&gt;
&#039;&#039;&#039;Organization &#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
*[[Sarah Gaggl]] (TU Dresden)&lt;br /&gt;
*[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte] (TU Wien)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- End of #maketabs --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36432</id>
		<title>Sarah Alice Gaggl/NAVAS Workshop-Wien</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36432"/>
		<updated>2022-05-10T10:21:50Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The NAVAS workshop on &#039;&#039;Navigation Approaches for Answer Sets&#039;&#039; is jointly organized by research groups at [http://www.tuwien.at TU Wien] and [http://www.tu-dresden.de TU Dresden] will take place in Vienna, Austria, May 23-25, 2022. &lt;br /&gt;
&lt;br /&gt;
[[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]&lt;br /&gt;
&lt;br /&gt;
{{#maketabs:&lt;br /&gt;
|Aim and Scope=&lt;br /&gt;
&lt;br /&gt;
|Program=&lt;br /&gt;
The NaVAS workshop will take place from Monday, May 23th until Wednesday May 25th of 2022. &lt;br /&gt;
&lt;br /&gt;
Monday, May 23th:&lt;br /&gt;
&lt;br /&gt;
*09:15 Welcome&lt;br /&gt;
*09:20 - 09:45 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]&lt;br /&gt;
*09:45 - 10:15 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy -  [[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
*10:15 Coffee break&lt;br /&gt;
&lt;br /&gt;
*10:30 - 11:00 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]&lt;br /&gt;
*11:30 - 12:00 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy - [[Dominik Rusovac]]&lt;br /&gt;
*12:00 - 12:30 Talk: tba - [https://wallner.ist.tugraz.at/ Johannes Wallner]&lt;br /&gt;
&lt;br /&gt;
*12:30 Lunch Break&lt;br /&gt;
&lt;br /&gt;
*14:00 - 18:00 internal meetings&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Tuesday, May 24th:&lt;br /&gt;
*09:00 - 10:00 internal meetings&lt;br /&gt;
&lt;br /&gt;
*14:00 - 19:00 [https://www.tuwien.at/caiml/news-detail/caiml-annual-event-edward-a-lee/# CAIML Lectures] - [https://www2.eecs.berkeley.edu/Faculty/Homepages/lee.html Edward A. Lee], [https://www.dc.fi.udc.es/~cabalar/ Pedro Cabalar]&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--TODO: link ersetzen --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|Abstracts=&lt;br /&gt;
For the schedule on on Monday, May 23th the following talks are presented.&lt;br /&gt;
&lt;br /&gt;
=== Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===&lt;br /&gt;
[[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) solvers have advanced in the recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.&lt;br /&gt;
&lt;br /&gt;
=== Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===&lt;br /&gt;
[[Martin Diller]]&lt;br /&gt;
&lt;br /&gt;
Assumption-based argumentation (ABA) is one of the main general frameworks for structured argumentation. Dispute derivations for ABA allow for evaluating claims in a dialectical manner: i.e. on the basis of an exchange of arguments and counter-arguments for a claim between a proponent and an opponent of the claim. Current versions of dispute derivations are geared towards determining (credulous) acceptance of claims w.r.t. the admissibility-based semantics that ABA inherits from abstract argumentation. Relatedly, they make use of backwards or top down reasoning for constructing arguments. In this work we define flexible dispute derivations with forward as well as backward reasoning allowing us, in particular, to also have dispute derivations for finding admissible, complete, and stable assumption sets rather than only determine acceptability of claims. We give an argumentation-based definition of such dispute derivations and a more implementation friendly alternative representation in which disputes involve exchange of claims and rules rather than arguments. These can be seen as elaborations on, in particular, existing graph-based dispute derivations on two fronts: first, in also allowing for forward reasoning; second, in that all arguments put forward in the dispute are represented by a graph and not only the proponents.&lt;br /&gt;
&lt;br /&gt;
=== Rushing and Strolling among Answer Sets - Navigation Made Easy ===&lt;br /&gt;
[[Dominik Rusovac]] &lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) is a popular declarative programming paradigm with a wide range of applications in artificial intelligence. Oftentimes, when modeling an AI problem with ASP, and in particular when we are interested beyond simple search for optimal solutions, an actual solution, differences between solutions, or number of solutions of the ASP program matter. For example, when a user aims to identify a specific answer set according to her needs, or requires the total number of diverging solutions to comprehend probabilistic applications such as reasoning in medical domains. Then, there are only certain problem specific and handcrafted encoding techniques available to navigate the solution space of ASP programs, which is oftentimes not enough. We propose a formal and general framework for interactive navigation toward desired subsets of answer sets analogous to faceted browsing. Our approach enables the user to explore the solution space by consciously zooming in or out of sub-spaces of solutions at a certain configurable pace. We illustrate that weighted faceted navigation is computationally hard. Finally, we provide an implementation of our approach that demonstrates the feasibility of our framework for incomprehensible solution spaces.&lt;br /&gt;
&lt;br /&gt;
|Organization=&lt;br /&gt;
&#039;&#039;&#039;Organization &#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
*[[Sarah Gaggl]] (TU Dresden)&lt;br /&gt;
*[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte] (TU Wien)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- End of #maketabs --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36431</id>
		<title>Sarah Alice Gaggl/NAVAS Workshop-Wien</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36431"/>
		<updated>2022-05-10T10:11:10Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The NAVAS workshop on &#039;&#039;Navigation Approaches for Answer Sets&#039;&#039; is jointly organized by research groups at [http://www.tuwien.at TU Wien] and [http://www.tu-dresden.de TU Dresden] will take place in Vienna, Austria, May 23-25, 2022. &lt;br /&gt;
&lt;br /&gt;
[[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]&lt;br /&gt;
&lt;br /&gt;
{{#maketabs:&lt;br /&gt;
|Aim and Scope=&lt;br /&gt;
&lt;br /&gt;
|Program=&lt;br /&gt;
The NaVAS workshop will take place from Monday, May 23th until Wednesday May 25th of 2022. &lt;br /&gt;
&lt;br /&gt;
Monday, May 23th:&lt;br /&gt;
&lt;br /&gt;
*09:15 Welcome&lt;br /&gt;
*09:20 - 09:45 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]&lt;br /&gt;
*09:45 - 10:15 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy -  [[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
*10:15 Coffee break&lt;br /&gt;
&lt;br /&gt;
*10:30 - 11:00 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]&lt;br /&gt;
*11:30 - 12:00 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy - [[Dominik Rusovac]]&lt;br /&gt;
&lt;br /&gt;
*12:30 Lunch Break&lt;br /&gt;
&lt;br /&gt;
*14:00 - 18:00 internal meetings&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Tuesday, May 24th:&lt;br /&gt;
*09:00 - 10:00 internal meetings&lt;br /&gt;
&lt;br /&gt;
*14:00 - 19:00 [https://www.tuwien.at/caiml/news-detail/caiml-annual-event-edward-a-lee/# CAIML Lectures] - [https://www2.eecs.berkeley.edu/Faculty/Homepages/lee.html Edward A. Lee], [https://www.dc.fi.udc.es/~cabalar/ Pedro Cabalar]&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--TODO: link ersetzen --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|Abstracts=&lt;br /&gt;
For the schedule on on Monday, May 23th the following talks are presented.&lt;br /&gt;
&lt;br /&gt;
=== Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===&lt;br /&gt;
[[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) solvers have advanced in the recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===&lt;br /&gt;
[[Martin Diller]]&lt;br /&gt;
&lt;br /&gt;
Assumption-based argumentation (ABA) is one of the main general frameworks for structured argumentation. Dispute derivations for ABA allow for evaluating claims in a dialectical manner: i.e. on the basis of an exchange of arguments and counter-arguments for a claim between a proponent and an opponent of the claim. Current versions of dispute derivations are geared towards determining (credulous) acceptance of claims w.r.t. the admissibility-based semantics that ABA inherits from abstract argumentation. Relatedly, they make use of backwards or top down reasoning for constructing arguments. In this work we define flexible dispute derivations with forward as well as backward reasoning allowing us, in particular, to also have dispute derivations for finding admissible, complete, and stable assumption sets rather than only determine acceptability of claims. We give an argumentation-based definition of such dispute derivations and a more implementation friendly alternative representation in which disputes involve exchange of claims and rules rather than arguments. These can be seen as elaborations on, in particular, existing graph-based dispute derivations on two fronts: first, in also allowing for forward reasoning; second, in that all arguments put forward in the dispute are represented by a graph and not only the proponents.&lt;br /&gt;
&lt;br /&gt;
=== Rushing and Strolling among Answer Sets - Navigation Made Easy ===&lt;br /&gt;
[[Dominik Rusovac]] &lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) is a popular declarative programming paradigm with a wide range of applications in artificial intelligence. Oftentimes, when modeling an AI problem with ASP, and in particular when we are interested beyond simple search for optimal solutions, an actual solution, differences between solutions, or number of solutions of the ASP program matter. For example, when a user aims to identify a specific answer set according to her needs, or requires the total number of diverging solutions to comprehend probabilistic applications such as reasoning in medical domains. Then, there are only certain problem specific and handcrafted encoding techniques available to navigate the solution space of ASP programs, which is oftentimes not enough. We propose a formal and general framework for interactive navigation toward desired subsets of answer sets analogous to faceted browsing. Our approach enables the user to explore the solution space by consciously zooming in or out of sub-spaces of solutions at a certain configurable pace. We illustrate that weighted faceted navigation is computationally hard. Finally, we provide an implementation of our approach that demonstrates the feasibility of our framework for incomprehensible solution spaces.&lt;br /&gt;
&lt;br /&gt;
|Organization=&lt;br /&gt;
&#039;&#039;&#039;Organization &#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
*[[Sarah Gaggl]] (TU Dresden)&lt;br /&gt;
*[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte] (TU Wien)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- End of #maketabs --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36430</id>
		<title>Sarah Alice Gaggl/NAVAS Workshop-Wien</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36430"/>
		<updated>2022-05-10T10:10:24Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The NAVAS workshop on &#039;&#039;Navigation Approaches for Answer Sets&#039;&#039; is jointly organized by research groups at [http://www.tuwien.at TU Wien] and [http://www.tu-dresden.de TU Dresden] will take place in Vienna, Austria, May 23-25, 2022. &lt;br /&gt;
&lt;br /&gt;
[[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]&lt;br /&gt;
&lt;br /&gt;
{{#maketabs:&lt;br /&gt;
|Aim and Scope=&lt;br /&gt;
&lt;br /&gt;
|Program=&lt;br /&gt;
The NaVAS workshop will take place from Monday, May 23th until Wednesday May 25th of 2022. &lt;br /&gt;
&lt;br /&gt;
Monday, May 23th:&lt;br /&gt;
&lt;br /&gt;
*09:15 Welcome&lt;br /&gt;
*09:20 - 09:45 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]&lt;br /&gt;
*09:45 - 10:15Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy -  [[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
*10:15 Coffee break&lt;br /&gt;
&lt;br /&gt;
*10:30 - 11:00 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]&lt;br /&gt;
*11:30 - 12:00 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy - [[Dominik Rusovac]]&lt;br /&gt;
&lt;br /&gt;
*12:30 Lunch Break&lt;br /&gt;
&lt;br /&gt;
*14:00 - 18:00 internal meetings&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Tuesday, May 24th:&lt;br /&gt;
*09:00 - 10:00 internal meetings&lt;br /&gt;
&lt;br /&gt;
*14:00 - 19:00 [https://www.tuwien.at/caiml/news-detail/caiml-annual-event-edward-a-lee/# CAIML Lectures] - [https://www2.eecs.berkeley.edu/Faculty/Homepages/lee.html Edward A. Lee], [https://www.dc.fi.udc.es/~cabalar/ Pedro Cabalar]&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--TODO: link ersetzen --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|Abstracts=&lt;br /&gt;
For the schedule on on Monday, May 23th the following talks are presented.&lt;br /&gt;
&lt;br /&gt;
=== Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===&lt;br /&gt;
[[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) solvers have advanced in the recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===&lt;br /&gt;
[[Martin Diller]]&lt;br /&gt;
&lt;br /&gt;
Assumption-based argumentation (ABA) is one of the main general frameworks for structured argumentation. Dispute derivations for ABA allow for evaluating claims in a dialectical manner: i.e. on the basis of an exchange of arguments and counter-arguments for a claim between a proponent and an opponent of the claim. Current versions of dispute derivations are geared towards determining (credulous) acceptance of claims w.r.t. the admissibility-based semantics that ABA inherits from abstract argumentation. Relatedly, they make use of backwards or top down reasoning for constructing arguments. In this work we define flexible dispute derivations with forward as well as backward reasoning allowing us, in particular, to also have dispute derivations for finding admissible, complete, and stable assumption sets rather than only determine acceptability of claims. We give an argumentation-based definition of such dispute derivations and a more implementation friendly alternative representation in which disputes involve exchange of claims and rules rather than arguments. These can be seen as elaborations on, in particular, existing graph-based dispute derivations on two fronts: first, in also allowing for forward reasoning; second, in that all arguments put forward in the dispute are represented by a graph and not only the proponents.&lt;br /&gt;
&lt;br /&gt;
=== Rushing and Strolling among Answer Sets - Navigation Made Easy ===&lt;br /&gt;
[[Dominik Rusovac]] &lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) is a popular declarative programming paradigm with a wide range of applications in artificial intelligence. Oftentimes, when modeling an AI problem with ASP, and in particular when we are interested beyond simple search for optimal solutions, an actual solution, differences between solutions, or number of solutions of the ASP program matter. For example, when a user aims to identify a specific answer set according to her needs, or requires the total number of diverging solutions to comprehend probabilistic applications such as reasoning in medical domains. Then, there are only certain problem specific and handcrafted encoding techniques available to navigate the solution space of ASP programs, which is oftentimes not enough. We propose a formal and general framework for interactive navigation toward desired subsets of answer sets analogous to faceted browsing. Our approach enables the user to explore the solution space by consciously zooming in or out of sub-spaces of solutions at a certain configurable pace. We illustrate that weighted faceted navigation is computationally hard. Finally, we provide an implementation of our approach that demonstrates the feasibility of our framework for incomprehensible solution spaces.&lt;br /&gt;
&lt;br /&gt;
|Organization=&lt;br /&gt;
&#039;&#039;&#039;Organization &#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
*[[Sarah Gaggl]] (TU Dresden)&lt;br /&gt;
*[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte] (TU Wien)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- End of #maketabs --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36415</id>
		<title>Sarah Alice Gaggl/NAVAS Workshop-Wien</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36415"/>
		<updated>2022-05-10T09:40:22Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}&lt;br /&gt;
&amp;lt;!--*&lt;br /&gt;
The NAVAS workshop series is jointly organized by research groups at Alpen-Adria-Universität Klagenfurt, Technische Universität Wien, and Universität Potsdam. TAASP 2018 is the second workshop of its type, which was held  November 19-20, 2018 at Technische Universität Wien, Vienna, Austria.--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The NAVAS workshop on &#039;&#039;Navigation Approaches for Answer Sets&#039;&#039; is jointly organized by research groups at [http://www.tuwien.at TU Wien] and [http://www.tu-dresden.de TU Dresden] will take place in Vienna , Austria, may 23-25, 2022.  &amp;lt;!--*The event will be held at the TODO--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]&lt;br /&gt;
&lt;br /&gt;
{{#maketabs:&lt;br /&gt;
|Aim and Scope=&lt;br /&gt;
&lt;br /&gt;
|Programme=&lt;br /&gt;
The NaVAS workshop will take place from Monday, May 21th until Wednesday May 23th of 2022. &lt;br /&gt;
&lt;br /&gt;
Monday, May 23th:&lt;br /&gt;
&lt;br /&gt;
*09:15 Welcome&lt;br /&gt;
*09:20 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]&lt;br /&gt;
*09:45 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy -  [[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
*10:15 Coffee break&lt;br /&gt;
&lt;br /&gt;
*10:30 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]&lt;br /&gt;
*11:30 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy [[Dominik Rusovac]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Tuesday, May 24th:&lt;br /&gt;
&lt;br /&gt;
*14:00 - 19:00 [https://www.tuwien.at/caiml/news-detail/caiml-annual-event-edward-a-lee/# CAIML Event] - [https://www2.eecs.berkeley.edu/Faculty/Homepages/lee.html Edward A. Lee], [https://www.dc.fi.udc.es/~cabalar/ Pedro Cabalar]&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--TODO: link ersetzen --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|Abstracts=&lt;br /&gt;
For the schedule on on Monday, May 23th the following talks are presented.&lt;br /&gt;
&lt;br /&gt;
=== Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===&lt;br /&gt;
[[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) solvers have advanced in the recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===&lt;br /&gt;
[[Martin Diller]]&lt;br /&gt;
&lt;br /&gt;
=== Rushing and Strolling among Answer Sets - Navigation Made Easy ===&lt;br /&gt;
[[Dominik Rusovac]] &lt;br /&gt;
&lt;br /&gt;
|Organization=&lt;br /&gt;
&#039;&#039;&#039;Organization &#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
*[[Sarah Gaggl]]&lt;br /&gt;
*[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- End of #maketabs --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36412</id>
		<title>Sarah Alice Gaggl/NAVAS Workshop-Wien</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36412"/>
		<updated>2022-05-10T09:34:43Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}&lt;br /&gt;
&lt;br /&gt;
The first international Workshop on &#039;&#039;Navigation Approaches for Answer Sets&#039;&#039; (NAVAS) in joint venture with the [http://www.tuwien.at TU Wien] will take place in Vienna, may 23-25, 2022.  &amp;lt;!--*The event will be held at the TODO--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]&lt;br /&gt;
&lt;br /&gt;
{{#maketabs:&lt;br /&gt;
|Aim and Scope=&lt;br /&gt;
&lt;br /&gt;
|Programme=&lt;br /&gt;
The NaVAS workshop will take place from Monday, May 21th until Wednesday May 23th of 2022. &lt;br /&gt;
&lt;br /&gt;
Monday, May 23th:&lt;br /&gt;
&lt;br /&gt;
*09:15 Welcome&lt;br /&gt;
*09:20 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]&lt;br /&gt;
*09:45 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy -  [[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
*10:15 Coffee break&lt;br /&gt;
&lt;br /&gt;
*10:30 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]&lt;br /&gt;
*11:30 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy [[Dominik Rusovac]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Tuesday, May 24th:&lt;br /&gt;
&lt;br /&gt;
*14:00 - 19:00 [https://www.tuwien.at/caiml/news-detail/caiml-annual-event-edward-a-lee/# CAIML Event] - [https://www2.eecs.berkeley.edu/Faculty/Homepages/lee.html Edward A. Lee], [https://www.dc.fi.udc.es/~cabalar/ Pedro Cabalar]&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--TODO: link ersetzen --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|Abstracts=&lt;br /&gt;
For the schedule on on Monday, May 23th the following talks are presented.&lt;br /&gt;
&lt;br /&gt;
=== Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===&lt;br /&gt;
[[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) solvers have advanced in the recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===&lt;br /&gt;
[[Martin Diller]]&lt;br /&gt;
&lt;br /&gt;
=== Rushing and Strolling among Answer Sets - Navigation Made Easy ===&lt;br /&gt;
[[Dominik Rusovac]] &lt;br /&gt;
&lt;br /&gt;
|Organization=&lt;br /&gt;
&#039;&#039;&#039;Organization &#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
*[[Sarah Gaggl]]&lt;br /&gt;
*[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- End of #maketabs --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36410</id>
		<title>Sarah Alice Gaggl/NAVAS Workshop-Wien</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36410"/>
		<updated>2022-05-10T09:33:23Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}&lt;br /&gt;
&lt;br /&gt;
The first international Workshop on &#039;&#039;Navigation Approaches for Answer Sets&#039;&#039; (NAVAS) in joint venture with the [www.tuwien.at TU Wien] will take place in Vienna, may 23-25, 2022.  &amp;lt;!--*The event will be held at the TODO--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]&lt;br /&gt;
&lt;br /&gt;
{{#maketabs:&lt;br /&gt;
|Aim and Scope=&lt;br /&gt;
&lt;br /&gt;
|Programme=&lt;br /&gt;
The NaVAS workshop will take place from Monday, May 21th until Wednesday May 23th of 2022. &lt;br /&gt;
&lt;br /&gt;
Monday, May 23th:&lt;br /&gt;
&lt;br /&gt;
*09:15 Welcome&lt;br /&gt;
*09:20 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]&lt;br /&gt;
*09:45 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy -  [[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
*10:15 Coffee break&lt;br /&gt;
&lt;br /&gt;
*10:30 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]&lt;br /&gt;
*11:30 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy [[Dominik Rusovac]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Tuesday, May 24th:&lt;br /&gt;
&lt;br /&gt;
*14:00 - 19:00 [https://www.tuwien.at/caiml/news-detail/caiml-annual-event-edward-a-lee/# CAIML Event] - [https://www2.eecs.berkeley.edu/Faculty/Homepages/lee.html Edward A. Lee], [https://www.dc.fi.udc.es/~cabalar/ Pedro Cabalar]&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--TODO: link ersetzen --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|Abstracts=&lt;br /&gt;
For the schedule on on Monday, May 23th the following talks are presented.&lt;br /&gt;
&lt;br /&gt;
=== Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===&lt;br /&gt;
[[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) solvers have advanced in the recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===&lt;br /&gt;
[[Martin Diller]]&lt;br /&gt;
&lt;br /&gt;
=== Rushing and Strolling among Answer Sets - Navigation Made Easy ===&lt;br /&gt;
[[Dominik Rusovac]] &lt;br /&gt;
&lt;br /&gt;
|Organization=&lt;br /&gt;
&#039;&#039;&#039;Organization &#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
*[[Sarah Gaggl]]&lt;br /&gt;
*[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- End of #maketabs --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36409</id>
		<title>Sarah Alice Gaggl/NAVAS Workshop-Wien</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36409"/>
		<updated>2022-05-10T09:32:13Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:NAVAS Workshop 2022 in Wien}}&lt;br /&gt;
&lt;br /&gt;
The first international Workshop on &#039;&#039;Navigation Approaches for Answer Sets&#039;&#039; (NAVAS) in joint venture with the [www.tuwien.at TU Wien] will take place in Vienna, may 23-25, 2022.  &amp;lt;!--*The event will be held at the TODO--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]&lt;br /&gt;
&lt;br /&gt;
{{#maketabs:&lt;br /&gt;
|Aim and Scope=&lt;br /&gt;
&lt;br /&gt;
|Programme=&lt;br /&gt;
The NaVAS workshop will take place from Monday, May 21th until Wednesday May 23th of 2022. &lt;br /&gt;
&lt;br /&gt;
Monday, May 23th:&lt;br /&gt;
&lt;br /&gt;
*09:15 Welcome&lt;br /&gt;
*09:20 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]&lt;br /&gt;
*09:45 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy -  [[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
*10:15 Coffee break&lt;br /&gt;
&lt;br /&gt;
*10:30 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]&lt;br /&gt;
*11:30 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy [[Dominik Rusovac]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Tuesday, May 24th:&lt;br /&gt;
&lt;br /&gt;
*14:00 - 19:00 [https://www.tuwien.at/caiml/news-detail/caiml-annual-event-edward-a-lee/# CAIML Event] - [https://www2.eecs.berkeley.edu/Faculty/Homepages/lee.html Edward A. Lee], [https://www.dc.fi.udc.es/~cabalar/ Pedro Cabalar]&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--TODO: link ersetzen --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|Abstracts=&lt;br /&gt;
For the schedule on on Monday, May 23th the following talks are presented.&lt;br /&gt;
&lt;br /&gt;
=== Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===&lt;br /&gt;
[[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) solvers have advanced in the recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===&lt;br /&gt;
[[Martin Diller]]&lt;br /&gt;
&lt;br /&gt;
=== Rushing and Strolling among Answer Sets - Navigation Made Easy ===&lt;br /&gt;
[[Dominik Rusovac]] &lt;br /&gt;
&lt;br /&gt;
|Organization=&lt;br /&gt;
&#039;&#039;&#039;Organization &#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
*[[Sarah Gaggl]]&lt;br /&gt;
*[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- End of #maketabs --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Vienna-Pierre_Blach%C3%A9.jpg&amp;diff=36408</id>
		<title>Datei:Vienna-Pierre Blaché.jpg</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Vienna-Pierre_Blach%C3%A9.jpg&amp;diff=36408"/>
		<updated>2022-05-10T09:27:53Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: https://commons.wikimedia.org/wiki/File:Vienna,_Austria_-_Flickr_-_Pierre_Blach%C3%A9.jpg&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Beschreibung ==&lt;br /&gt;
https://commons.wikimedia.org/wiki/File:Vienna,_Austria_-_Flickr_-_Pierre_Blach%C3%A9.jpg&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36404</id>
		<title>Sarah Alice Gaggl/NAVAS Workshop-Wien</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36404"/>
		<updated>2022-05-10T09:01:00Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:NAVAS Workshop 2022 in Wien}}&lt;br /&gt;
&lt;br /&gt;
The first international Workshop on &#039;&#039;Navigation Approaches for Answer Sets&#039;&#039; (NAVAS) in joint venture with the [www.tuwien.at TU Wien] will take place in Vienna, may 23-25, 2022.  &amp;lt;!--*The event will be held at the TODO--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{#maketabs:&lt;br /&gt;
|Aim and Scope=&lt;br /&gt;
&lt;br /&gt;
|Programme=&lt;br /&gt;
The NaVAS workshop will take place from Monday, May 21th until Wednesday May 23th of 2022. &lt;br /&gt;
&lt;br /&gt;
Monday, May 23th:&lt;br /&gt;
&lt;br /&gt;
*09:15 Welcome&lt;br /&gt;
*09:20 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]&lt;br /&gt;
*09:45 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy -  [[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
*10:15 Coffee break&lt;br /&gt;
&lt;br /&gt;
*10:30 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]&lt;br /&gt;
*11:30 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy [[Dominik Rusovac]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Tuesday, May 24th:&lt;br /&gt;
&lt;br /&gt;
*14:00 - 19:00 [https://www.tuwien.at/caiml/news-detail/caiml-annual-event-edward-a-lee/# CAIML Event] - [https://www2.eecs.berkeley.edu/Faculty/Homepages/lee.html Edward A. Lee], [https://www.dc.fi.udc.es/~cabalar/ Pedro Cabalar]&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--TODO: link ersetzen --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|Abstracts=&lt;br /&gt;
For the schedule on on Monday, May 23th the following talks are presented.&lt;br /&gt;
&lt;br /&gt;
=== Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===&lt;br /&gt;
[[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
Answer set programming (ASP) solvers have advanced in the recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===&lt;br /&gt;
[[Martin Diller]]&lt;br /&gt;
&lt;br /&gt;
=== Rushing and Strolling among Answer Sets - Navigation Made Easy ===&lt;br /&gt;
[[Dominik Rusovac]] &lt;br /&gt;
&lt;br /&gt;
|Organization=&lt;br /&gt;
&#039;&#039;&#039;Organization &#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
*[[Sarah Gaggl]]&lt;br /&gt;
*[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- End of #maketabs --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36387</id>
		<title>Sarah Alice Gaggl/NAVAS Workshop-Wien</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&amp;diff=36387"/>
		<updated>2022-05-09T13:47:55Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Die Seite wurde neu angelegt: „{{DISPLAYTITLE:NAVAS Workshop 2022 in Wien}}  The first international Workshop on &amp;#039;&amp;#039;Navigation Approaches for Answer Sets&amp;#039;&amp;#039; (NAVAS) in joint venture with the […“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:NAVAS Workshop 2022 in Wien}}&lt;br /&gt;
&lt;br /&gt;
The first international Workshop on &#039;&#039;Navigation Approaches for Answer Sets&#039;&#039; (NAVAS) in joint venture with the [www.tuwien.at TU Wien] will take place in Vienna, may 23-25, 2022.  &amp;lt;!--*The event will be held at the TODO--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{#maketabs:&lt;br /&gt;
|Aim and Scope=&lt;br /&gt;
&lt;br /&gt;
|Programme=&lt;br /&gt;
The NaVAS workshop will take place from Monday, May 21th until Wednesday May 23th of 2022. &lt;br /&gt;
&lt;br /&gt;
Monday, May 23th:&lt;br /&gt;
*09:15 Welcome&lt;br /&gt;
*09:20 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]&lt;br /&gt;
*09:45 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy -  [[Elisa Böhl]]&lt;br /&gt;
&lt;br /&gt;
*10:15 Coffee break&lt;br /&gt;
&lt;br /&gt;
*10:30 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]&lt;br /&gt;
*11:30 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy [[Dominik Rusovac]]&lt;br /&gt;
&lt;br /&gt;
Tuesday, May 24th:&lt;br /&gt;
*14:00 - 19:00 [https://www.tuwien.at/caiml/news-detail/caiml-annual-event-edward-a-lee/# CAIML Event] (external)- [https://www2.eecs.berkeley.edu/Faculty/Homepages/lee.html Edward A. Lee], [https://www.dc.fi.udc.es/~cabalar/ Pedro Cabalar]&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;!--TODO: link ersetzen --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
|Abstracts=&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
|Organization=&lt;br /&gt;
&#039;&#039;&#039;Organization &#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
*[[Sarah Gaggl]]&lt;br /&gt;
*[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
}}&amp;lt;!-- End of #maketabs --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Karina_Neupert&amp;diff=33583</id>
		<title>Karina Neupert</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Karina_Neupert&amp;diff=33583"/>
		<updated>2021-04-06T11:49:18Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Karina&lt;br /&gt;
|Nachname=Adler&lt;br /&gt;
|Forschungsgruppe=Computational Logic; Logische Programmierung und Argumentation&lt;br /&gt;
|Stellung=Technikerin&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Telefon=+49 351 463 38521&lt;br /&gt;
|Email=karina.adler@tu-dresden.de&lt;br /&gt;
|Raum=APB 2004&lt;br /&gt;
|Publikationen anzeigen=0&lt;br /&gt;
|Abschlussarbeiten anzeigen=0&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Johannes_Fichte&amp;diff=33582</id>
		<title>Johannes Fichte</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Johannes_Fichte&amp;diff=33582"/>
		<updated>2021-04-06T11:40:55Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Johannes K.&lt;br /&gt;
|Nachname=Fichte&lt;br /&gt;
|Akademischer Titel=Dr.&lt;br /&gt;
|Stellung=Wissenschaftlicher Mitarbeiter&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Telefon=+49 351 463 43548&lt;br /&gt;
|Email=johannes.fichte@tu-dresden.de&lt;br /&gt;
|Raum=&lt;br /&gt;
|Bild=By sarameister23-3.jpg&lt;br /&gt;
|Info=Please visit our new webpage at: &amp;lt;br&amp;gt;&lt;br /&gt;
https://tu-dresden.de/ing/informatik/ki/krr/die-professur/staff/dr-johannes-k-fichte&lt;br /&gt;
|Info EN=Please visit our new webpage at: &amp;lt;br&amp;gt;&lt;br /&gt;
https://tu-dresden.de/ing/informatik/ki/krr/die-professur/staff/dr-johannes-k-fichte&lt;br /&gt;
|DBLP=http://dblp.uni-trier.de/pers/hd/f/Fichte:Johannes_Klaus&lt;br /&gt;
|Google Scholar=https://scholar.google.de/citations?user=-yhf134AAAAJ&amp;amp;hl=en&lt;br /&gt;
|Publikationen anzeigen=0&lt;br /&gt;
|Abschlussarbeiten anzeigen=0&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Answer Set Programming&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Constraint Satisfaction Problems&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Logic and Decision Procedures&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2018/en&amp;diff=33581</id>
		<title>APB 2018/en</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2018/en&amp;diff=33581"/>
		<updated>2021-04-06T11:39:25Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Page created automatically by parser function on page APB 2018&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Raum/en}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2018&amp;diff=33580</id>
		<title>APB 2018</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2018&amp;diff=33580"/>
		<updated>2021-04-06T11:39:25Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Die Seite wurde neu angelegt: „{{Raum}}“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Raum}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2004/en&amp;diff=33579</id>
		<title>APB 2004/en</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2004/en&amp;diff=33579"/>
		<updated>2021-04-06T11:38:42Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Page created automatically by parser function on page APB 2004&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Raum/en}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2004&amp;diff=33578</id>
		<title>APB 2004</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2004&amp;diff=33578"/>
		<updated>2021-04-06T11:38:42Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Die Seite wurde neu angelegt: „{{Raum}}“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Raum}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2017/en&amp;diff=33577</id>
		<title>APB 2017/en</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2017/en&amp;diff=33577"/>
		<updated>2021-04-06T11:38:19Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Page created automatically by parser function on page APB 2017&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Raum/en}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2017&amp;diff=33576</id>
		<title>APB 2017</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=APB_2017&amp;diff=33576"/>
		<updated>2021-04-06T11:38:19Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Die Seite wurde neu angelegt: „{{Raum}}“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Raum}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Elisa_B%C3%B6hl&amp;diff=33575</id>
		<title>Elisa Böhl</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Elisa_B%C3%B6hl&amp;diff=33575"/>
		<updated>2021-04-06T11:37:43Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Telefon=+49 351 463 42666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 2017&lt;br /&gt;
|Bild=Elisa-400x600.jpg&lt;br /&gt;
|Info=Ich arbeite  seit Oktober 2020 im BMBF geförderten Projekt [[NAVAS | NAVAS - Navigation im Lösungsraum von Answer Sets]] der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] Gruppe von [[Sarah Alice Gaggl]] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*Nach meinem Informatik-Diplom (TU Dresden) habe ich in der Arbeitsgruppe [https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] von [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer] die Software rund um optische Pinzetten mitgestaltet.&lt;br /&gt;
*Darauf folgend habe ich in Kooperation mit der [https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden] an HMM-basierenden Spracherkennern mit minimalen Hardwareanforderungen gearbeitet. &lt;br /&gt;
*Danach habe ich in der Arbeitsgruppe [https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] am [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden] Softwarelösungen für die Durchführung und Auswertung von Thermographieaufnahmen in der Neurochirurgie entwickelt.&lt;br /&gt;
*Seit 2019 war ich in der Gruppe [[Computational Logic]] von [[Sebastian Rudolph]] tätig und bin 2020 in die Arbeitsgruppe [[Logische Programmierung und Argumentation]] von [[Sarah Alice Gaggl]] gewechselt. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
|Info EN=I&#039;m the new member in the NAVAS Project from the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
After finishing my Diploma in Computer Science in Dresden I worked on a viarety of different research groups on different topics&lt;br /&gt;
*[https://www.biotec.tu-dresden.de/fileadmin/groups/schaeffer/people.html Nanomechanics] from [https://imprs.tuebingen.mpg.de/de/research/faculty-and-projects/erik-schaeffer.html Erik Schäffer]: Software around optical tweezers&lt;br /&gt;
*[https://en.wikipedia.org/wiki/University_of_Applied_Sciences_Dresden HTW Dresden]: minimalistic hmm-based speech recognizer&lt;br /&gt;
*Neurochirurgie/[https://tu-dresden.de/med/mf/ksm/die-arbeitsgruppe Klinisches Sensoring and Monitoring] at [https://www.uniklinikum-dresden.de/de Universitätsklinikum Carl Gustav Carus Dresden]: Thermal imaging&lt;br /&gt;
*Starting 2019 I have worked in the group [[Computational Logic]] from [[Sebastian Rudolph]] and switched 2020 into the group [[Logische Programmierung und Argumentation]] from [[Sarah Alice Gaggl]].&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
}}&lt;br /&gt;
{{#subobject:&lt;br /&gt;
|Vorname=Elisa&lt;br /&gt;
|Nachname=Böhl&lt;br /&gt;
|Akademischer Titel=Dipl.-Inf.&lt;br /&gt;
|Forschungsgruppe=Computational Logic&lt;br /&gt;
|Stellung=Wissenschaftliche Mitarbeiterin&lt;br /&gt;
|Ehemaliger=1&lt;br /&gt;
|Telefon=+49 351 463 666&lt;br /&gt;
|Email=elisa.boehl@tu-dresden.de&lt;br /&gt;
|Raum=APB 2031&lt;br /&gt;
|Bild=elisa-400x600.jpg&lt;br /&gt;
|Info=Ich &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
|Info EN=I&#039;m the 3rd  Thermal imaging&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
|@category=Mitarbeiter&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=News56&amp;diff=32564</id>
		<title>News56</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=News56&amp;diff=32564"/>
		<updated>2021-01-22T16:35:22Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Neuigkeit&lt;br /&gt;
|Titel DE=Neuer Mitarbeiter: Dominik Rusovac&lt;br /&gt;
|Titel EN=New Member: Dominik Rusovac&lt;br /&gt;
|Beschreibung DE= [[Dominik Rusovac]] ist seit Januar 2021 das neueste Mitglied in der Arbeitsgruppe [[Logische Programmierung und Argumentation]]. In den nächsten vier Jahren wird er als Doktorand im [[NAVAS]] Projekt forschen.&lt;br /&gt;
&amp;lt;br/&amp;gt;Bevor Dominik an die TU Dresden kam, hat er 2019 an der [https://www.uni-leipzig.de Universität Leipzig] sein Masterstudium im Fach Logik abgeschlossen und im Anschluss bis 2021 als Junior Softwareentwickler bei [https://www.a-trust.at A-Trust] gearbeitet. Während seiner Masterarbeit unter Prof. Dr. Gerhard Brewka beschäftigte sich Dominik mit Inkonsistenz-Werten für nicht-monotone Formalismen, insbesondere Answer Set Semantics. Die Ergebnisse seiner  [https://iccl.inf.tu-dresden.de/web/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics Masterarbeit] stellte Dominik im Rahmen des [https://iccl.inf.tu-dresden.de/web/Research_Seminar_Logic_and_AI Research Seminar Logic and AI] vor.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Herzlich willkommen im Team, Dominik!&lt;br /&gt;
|Beschreibung EN=Since january 2021 we welcome [[Dominik Rusovac]] as new PhD student in the [[NAVAS]] project.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Dominik studied at the [https://www.uni-leipzig.de Universität Leipzig] Logic and finished his Master thesis under Prof. Dr. Gerhard Brewka in 2019. He worked on the topic of [https://iccl.inf.tu-dresden.de/web/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics Inconsistency Values for Logic Programs under Answer Set Semantics] and presented his results in the [https://iccl.inf.tu-dresden.de/web/Research_Seminar_Logic_and_AI Research Seminar Logic and AI]. Before joining the group [[Logische Programmierung und Argumentation|Logic Programming and Argumentation]] of [[Sarah Gaggl]] he worked as junior software developer at [https://www.a-trust.at A-Trust].&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Good luck Dominik!&lt;br /&gt;
|Datum=2021/01/22&lt;br /&gt;
|Bild=Some portrait.jpeg&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=News56&amp;diff=32563</id>
		<title>News56</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=News56&amp;diff=32563"/>
		<updated>2021-01-22T16:34:56Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Neuigkeit&lt;br /&gt;
|Titel DE=Neuer Mitarbeiter: Dominik Rusovac&lt;br /&gt;
|Titel EN=New Member: Dominik Rusovac&lt;br /&gt;
|Beschreibung DE= [[Dominik Rusovac]] ist seit Januar 2021 das neueste Mitglied in der Arbeitsgruppe [[Logische Programmierung und Argumentation]]. In den nächsten vier Jahren wird er als Doktorand im [[NAVAS]] Projekt arbeiten.&lt;br /&gt;
&amp;lt;br/&amp;gt;Bevor Dominik an die TU Dresden kam, hat er 2019 an der [https://www.uni-leipzig.de Universität Leipzig] sein Masterstudium im Fach Logik abgeschlossen und im Anschluss bis 2021 als Junior Softwareentwickler bei [https://www.a-trust.at A-Trust] gearbeitet. Während seiner Masterarbeit unter Prof. Dr. Gerhard Brewka beschäftigte sich Dominik mit Inkonsistenz-Werten für nicht-monotone Formalismen, insbesondere Answer Set Semantics. Die Ergebnisse seiner  [https://iccl.inf.tu-dresden.de/web/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics Masterarbeit] stellte Dominik im Rahmen des [https://iccl.inf.tu-dresden.de/web/Research_Seminar_Logic_and_AI Research Seminar Logic and AI] vor.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Herzlich willkommen im Team, Dominik!&lt;br /&gt;
|Beschreibung EN=Since january 2021 we welcome [[Dominik Rusovac]] as new PhD student in the [[NAVAS]] project.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Dominik studied at the [https://www.uni-leipzig.de Universität Leipzig] Logic and finished his Master thesis under Prof. Dr. Gerhard Brewka in 2019. He worked on the topic of [https://iccl.inf.tu-dresden.de/web/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics Inconsistency Values for Logic Programs under Answer Set Semantics] and presented his results in the [https://iccl.inf.tu-dresden.de/web/Research_Seminar_Logic_and_AI Research Seminar Logic and AI]. Before joining the group [[Logische Programmierung und Argumentation|Logic Programming and Argumentation]] of [[Sarah Gaggl]] he worked as junior software developer at [https://www.a-trust.at A-Trust].&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Good luck Dominik!&lt;br /&gt;
|Datum=2021/01/22&lt;br /&gt;
|Bild=Some portrait.jpeg&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=News56&amp;diff=32562</id>
		<title>News56</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=News56&amp;diff=32562"/>
		<updated>2021-01-22T16:33:43Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Neuigkeit&lt;br /&gt;
|Titel DE=Neuer Mitarbeiter: Dominik Rusovac&lt;br /&gt;
|Titel EN=New Member: Dominik Rusovac&lt;br /&gt;
|Beschreibung DE=[[Dominik Rusovac]] ist das neueste Mitglied in der Arbeitsgruppe [[Logische Programmierung und Argumentation]]. In den nächsten vier Jahren wird er als Doktorand im [[NAVAS]] Projekt arbeiten.&lt;br /&gt;
&amp;lt;br/&amp;gt;Bevor Dominik an die TU Dresden kam, hat er 2019 an der [https://www.uni-leipzig.de Universität Leipzig] sein Masterstudium im Fach Logik abgeschlossen und im Anschluss bis 2021 als Junior Softwareentwickler bei [https://www.a-trust.at A-Trust] gearbeitet. Während seiner Masterarbeit unter Prof. Dr. Gerhard Brewka beschäftigte sich Dominik mit Inkonsistenz-Werten für nicht-monotone Formalismen, insbesondere Answer Set Semantics. Die Ergebnisse seiner  [https://iccl.inf.tu-dresden.de/web/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics Masterarbeit] stellte Dominik im Rahmen des [https://iccl.inf.tu-dresden.de/web/Research_Seminar_Logic_and_AI Research Seminar Logic and AI] vor.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Herzlich willkommen im Team, Dominik!&lt;br /&gt;
|Beschreibung EN=Since january 2021 we welcome [[Dominik Rusovac]] as new PhD student in the [[NAVAS]] project.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Dominik studied at the [https://www.uni-leipzig.de Universität Leipzig] Logic and finished his Master thesis under Prof. Dr. Gerhard Brewka in 2019. He worked on the topic of [https://iccl.inf.tu-dresden.de/web/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics Inconsistency Values for Logic Programs under Answer Set Semantics] and presented his results in the [https://iccl.inf.tu-dresden.de/web/Research_Seminar_Logic_and_AI Research Seminar Logic and AI]. Before joining the group [[Logische Programmierung und Argumentation|Logic Programming and Argumentation]] of [[Sarah Gaggl]] he worked as junior software developer at [https://www.a-trust.at A-Trust].&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Good luck Dominik!&lt;br /&gt;
|Datum=2021/01/22&lt;br /&gt;
|Bild=Some portrait.jpeg&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=News56&amp;diff=32561</id>
		<title>News56</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=News56&amp;diff=32561"/>
		<updated>2021-01-22T16:29:21Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Neuigkeit&lt;br /&gt;
|Titel DE=Neuer Mitarbeiter: Dominik Rusovac&lt;br /&gt;
|Titel EN=New Member: Dominik Rusovac&lt;br /&gt;
|Beschreibung DE=[[Dominik Rusovac]] ist das neueste Mitglied im  [[NAVAS]] Projekt in der Arbeitsgruppe [[Logische Programmierung und Argumentation]].&lt;br /&gt;
&amp;lt;br/&amp;gt;Bevor Dominik an die TU Dresden kam, hat er 2019 an der [https://www.uni-leipzig.de Universität Leipzig] sein Masterstudium im Fach Logik abgeschlossen und im Anschluss bis 2021 als Junior Softwareentwickler bei [https://www.a-trust.at A-Trust] gearbeitet. Während seiner Masterarbeit unter Prof. Dr. Gerhard Brewka beschäftigte sich Dominik mit Inkonsistenz-Werten für nicht-monotone Formalismen, insbesondere Answer Set Semantics. Die Ergebnisse seiner  [https://iccl.inf.tu-dresden.de/web/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics Masterarbeit] stellte Dominik im Rahmen des [https://iccl.inf.tu-dresden.de/web/Research_Seminar_Logic_and_AI Research Seminar Logic and AI] vor.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Herzlich willkommen im Team, Dominik!&lt;br /&gt;
|Beschreibung EN=Since january 2021 we welcome [[Dominik Rusovac]] as new PhD student in the [[NAVAS]] project.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Dominik studied at the [https://www.uni-leipzig.de Universität Leipzig] Logic and finished his Master thesis under Prof. Dr. Gerhard Brewka in 2019. He worked on the topic of [https://iccl.inf.tu-dresden.de/web/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics Inconsistency Values for Logic Programs under Answer Set Semantics] and presented his results in the [https://iccl.inf.tu-dresden.de/web/Research_Seminar_Logic_and_AI Research Seminar Logic and AI]. Before joining the group [[Logische Programmierung und Argumentation|Logic Programming and Argumentation]] of [[Sarah Gaggl]] he worked as junior software developer at [https://www.a-trust.at A-Trust].&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Good luck Dominik!&lt;br /&gt;
|Datum=2021/01/22&lt;br /&gt;
|Bild=Some portrait.jpeg&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=News56/en&amp;diff=32560</id>
		<title>News56/en</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=News56/en&amp;diff=32560"/>
		<updated>2021-01-22T16:28:36Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Page created automatically by parser function on page News56&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Neuigkeit/en}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=News56&amp;diff=32559</id>
		<title>News56</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=News56&amp;diff=32559"/>
		<updated>2021-01-22T16:28:36Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: Die Seite wurde neu angelegt: „{{Neuigkeit |Titel DE=Neuer Mitarbeiter: Dominik Rusovac |Titel EN=New Member: Dominik Rusovac |Beschreibung DE=Dominik Rusovac ist das neueste Mitglied im…“&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Neuigkeit&lt;br /&gt;
|Titel DE=Neuer Mitarbeiter: Dominik Rusovac&lt;br /&gt;
|Titel EN=New Member: Dominik Rusovac&lt;br /&gt;
|Beschreibung DE=[[Dominik Rusovac]] ist das neueste Mitglied im  [[NAVAS]] Projekt in der Arbeitsgruppe [[Logische Programmierung und Argumentation]].&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;Bevor Dominik an die TU Dresden kam, hat er 2019 an der [https://www.uni-leipzig.de Universität Leipzig] sein Masterstudium im Fach Logik abgeschlossen und im Anschluss bis 2021 als Junior Softwareentwickler bei [https://www.a-trust.at A-Trust] gearbeitet. Während seiner Masterarbeit unter Prof. Dr. Gerhard Brewka beschäftigte sich Dominik mit Inkonsistenz-Werten für nicht-monotone Formalismen, insbesondere Answer Set Semantics. Die Ergebnisse seiner  [https://iccl.inf.tu-dresden.de/web/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics Masterarbeit] stellte Dominik im Rahmen des [https://iccl.inf.tu-dresden.de/web/Research_Seminar_Logic_and_AI Research Seminar Logic and AI] vor.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Herzlich willkommen im Team, Dominik!&lt;br /&gt;
|Beschreibung EN=Since january 2021 we welcome [[Dominik Rusovac]] as new PhD student in the [[NAVAS]] project.&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
Dominik studied at the [https://www.uni-leipzig.de Universität Leipzig] Logic and finished his Master thesis under Prof. Dr. Gerhard Brewka in 2019. He worked on the topic of [https://iccl.inf.tu-dresden.de/web/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics Inconsistency Values for Logic Programs under Answer Set Semantics] and presented his results in the [https://iccl.inf.tu-dresden.de/web/Research_Seminar_Logic_and_AI Research Seminar Logic and AI]. Before joining the group [[Logische Programmierung und Argumentation|Logic Programming and Argumentation]] of [[Sarah Gaggl]] he worked as junior software developer at [https://www.a-trust.at A-Trust].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&amp;lt;br/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Good luck Dominik!&lt;br /&gt;
|Datum=2021/01/22&lt;br /&gt;
|Bild=Some portrait.jpeg&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
	<entry>
		<id>https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&amp;diff=32514</id>
		<title>Dominik Rusovac</title>
		<link rel="alternate" type="text/html" href="https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&amp;diff=32514"/>
		<updated>2021-01-15T14:37:18Z</updated>

		<summary type="html">&lt;p&gt;Elisa Böhl: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Mitarbeiter&lt;br /&gt;
|Vorname=Dominik&lt;br /&gt;
|Nachname=Rusovac&lt;br /&gt;
|Akademischer Titel=M.A.&lt;br /&gt;
|Forschungsgruppe=Logische Programmierung und Argumentation&lt;br /&gt;
|Stellung=Wissenschaftlicher Mitarbeiter&lt;br /&gt;
|Ehemaliger=0&lt;br /&gt;
|Email=dominik.rusovac@tu-dresden.de&lt;br /&gt;
|Raum=APB 2017&lt;br /&gt;
|Publikationen anzeigen=1&lt;br /&gt;
|Abschlussarbeiten anzeigen=1&lt;br /&gt;
}}&lt;br /&gt;
{{Forschungsgebiet Auswahl&lt;br /&gt;
|Forschungsgebiet=Answer Set Programming&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Elisa Böhl</name></author>
	</entry>
</feed>