https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&feedformat=atom&user=Dominik+Rusovac 2026-04-18T19:25:03Z Benutzerbeiträge MediaWiki 1.43.1 https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=42484 2025-06-17T13:23:12Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Forschungsgruppe=Logische Programmierung und Argumentation; Wissensbasierte Systeme<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=1<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=0<br /> }}<br /> {{#subobject:<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=1<br /> |Telefon=<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=<br /> |Bild=<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> |Info EN=I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] in January 2021.<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=0<br /> |@category=Mitarbeiter<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3396/en&diff=40157 2024-09-26T07:56:01Z

<p>Dominik Rusovac: Page created automatically by parser function on page Inproceedings3396</p> <hr /> <div>#REDIRECT [[Inproceedings3396]]</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3396&diff=40156 2024-09-26T07:56:01Z

<p>Dominik Rusovac: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Dominik |ErsterAutorNachname=Rusovac |FurtherAuthors=Markus Hecher; Martin Gebser; Sarah Alice Gaggl; Johannes K. Fichte }} {{Inproceedings |Referiert=1 |Title=Navigating and Querying Answer Sets: How Hard Is It Really and Why? |To appear=1 |Year=2024 |Booktitle=Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024) }} {{Publikation Details |Projekt=…“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Dominik<br /> |ErsterAutorNachname=Rusovac<br /> |FurtherAuthors=Markus Hecher; Martin Gebser; Sarah Alice Gaggl; Johannes K. Fichte<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Navigating and Querying Answer Sets: How Hard Is It Really and Why?<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024)<br /> }}<br /> {{Publikation Details<br /> |Projekt=NAVAS, SECAI<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Article3098/en&diff=39961 2024-07-15T08:45:03Z

<p>Dominik Rusovac: Page created automatically by parser function on page Article3098</p> <hr /> <div>#REDIRECT [[Article3098]]</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=39765 2024-06-10T05:41:08Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Telefon=<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=<br /> |Bild=<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> |Info EN=I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] in January 2021. <br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=0<br /> }}<br /> {{Forschungsgebiet Auswahl | Forschungsgebiet=Answer Set Programming}}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Misc3080/en&diff=38016 2023-04-13T13:59:01Z

<p>Dominik Rusovac: Page created automatically by parser function on page Misc3080</p> <hr /> <div>#REDIRECT [[Misc3080]]</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Misc3080&diff=38015 2023-04-13T13:59:01Z

<p>Dominik Rusovac: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Dominik |ErsterAutorNachname=Rusovac }} {{Misc |Title=Rushing and Strolling among Answer Sets - Navigation Made…“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Dominik<br /> |ErsterAutorNachname=Rusovac<br /> }}<br /> {{Misc<br /> |Title=Rushing and Strolling among Answer Sets - Navigation Made Easy<br /> |Year=2022<br /> |Month=August<br /> |Note=International Workshop on Counting and Sampling in Haifa, Israel at FLoC 2022<br /> }}<br /> {{Publikation Details<br /> |Projekt=NAVAS<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Misc3079/en&diff=38012 2023-04-13T11:58:56Z

<p>Dominik Rusovac: Page created automatically by parser function on page Misc3079</p> <hr /> <div>#REDIRECT [[Misc3079]]</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Misc3079&diff=38011 2023-04-13T11:58:56Z

<p>Dominik Rusovac: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Dominik |ErsterAutorNachname=Rusovac }} {{Misc |Title=Answer Set Navigation: Probleme Besser Verstehen |Year=202…“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Dominik<br /> |ErsterAutorNachname=Rusovac<br /> }}<br /> {{Misc<br /> |Title=Answer Set Navigation: Probleme Besser Verstehen<br /> |Year=2022<br /> |Month=Mai<br /> |Howpublished=remotely held invited talk at Security Networks AG Dresden<br /> }}<br /> {{Publikation Details<br /> |Projekt=NAVAS<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=NAVAS&diff=37175 2022-09-23T08:57:32Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Projekt<br /> |Kurzname=NAVAS<br /> |Name=Navigation im Lösungsraum von Answer Sets<br /> |Name EN=Navigation Approaches for Answer Sets<br /> |Beschreibung DE=Durch die kontinuierliche Weiterentwicklung in den letzten Jahren können heute eine Vielzahl anspruchsvoller kombinatorischer Suchprobleme von enormer praktischer Relevanz effizient durch Answer Set Programming (ASP) gelöst werden. Dabei kann es je nach Umfang des zu lösenden Problems sehr rasch zu einer “kombinatorischen Explosion” der Menge von Lösungen kommen. Während moderne ASP Solver problemlos mehrere Millionen von Lösungen in kurzer Zeit berechnen können, stellt dies den Anwender vor ein neues Problem: Wie soll der enorme Lösungsraum gehandhabt und zugänglich gemacht werden?<br /> Typischer Weise werden die Answer Sets in beliebiger Reihenfolge ausgegeben. Jedoch sind viele dieser Lösungen sehr ähnlich. In der Praxis sind hingegen oft nur Lösungen von Interesse, die sich hinreichend voneinander unterscheiden, die besondere Eigenschaften aufweisen, oder die einer gegebenen Menge von Lösungen ähnlich sind. Derlei Features werden allerdings bis jetzt noch nicht von ASP Solvern unterstützt.<br /> Um eine interaktive und transparente Navigation in ASP-Lösungsräumen zu ermöglichen wird sich das Projekt NAVAS mit den folgenden Themen befassen:<br /> # Entwicklung von Methoden zur interaktiven und transparenten Navigation im Lösungsraum der Answer Sets; <br /> # Implementierung der Methoden mit effizienten Algorithmen; <br /> # Evaluation des Prototyps anhand von Anwendungsfällen aus den Bereichen Konfiguration und Argumentation. <br /> Wir sind zuversichtlich, dass ASP-Technologie durch die in NAVAS erzielten Erkenntnisse, Entwicklungen und Implementierungen auch für eine breitere Masse zugänglicher wird. Hierbei sehen wir ein besonderes unmittelbares Potential im Bereich industrieller Anwendungen, etwa zur Produktkonfiguration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] Erster NAVAS Workshop in Wien (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention bei LPNMR 2022<br /> |Beschreibung EN=Due to the continuous development in recent years, a large number of demanding combinatorial search problems of enormous practical relevance can now be efficiently solved by Answer Set Programming (ASP). Depending on the scope of the problem to be solved, a &quot;combinatorial explosion&quot; of the number of solutions can occur very quickly. While modern ASP solvers can easily calculate several million solutions in a short time, this poses a new problem for the user: How should the enormous solution space be handled and made accessible? Typically, the Answer Sets are output in any order. However, many of these solutions are very similar. In practice, however, often only solutions are of interest that are sufficiently different from each other, that have special properties, or that are similar to a given set of solutions. Such features are not yet supported by ASP solvers. To enable an interactive and transparent navigation in ASP solution spaces the project NAVAS will deal with the following topics:<br /> # Development of methods for interactive and transparent navigation in the Answer Set solution space;<br /> # Implementation of the methods with efficient algorithms;<br /> # Evaluation of the prototype on use cases from the areas of configuration and argumentation theory.<br /> We are confident that the knowledge, developments and implementations achieved in NAVAS will make ASP technology more accessible to a wider audience. We see a particular immediate potential in the area of industrial applications, for example product configuration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] First NAVAS Workshop in Vienna (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention at LPNMR 2022<br /> |Kontaktperson=Sarah Alice Gaggl<br /> |Project Authors=Sarah Alice Gaggl<br /> |Start=2020/10/01<br /> |Ende=2024/09/30<br /> |Finanziert von=BMBF; 1.268.842,48 €<br /> |Projektstatus=aktiv<br /> |Logo=NAVAS-logo.png<br /> |Person=Sarah Alice Gaggl, Elisa Böhl, Dominik Rusovac<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=NAVAS&diff=37174 2022-09-23T08:56:38Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Projekt<br /> |Kurzname=NAVAS<br /> |Name=Navigation im Lösungsraum von Answer Sets<br /> |Name EN=Navigation Approaches for Answer Sets<br /> |Beschreibung DE=Durch die kontinuierliche Weiterentwicklung in den letzten Jahren können heute eine Vielzahl anspruchsvoller kombinatorischer Suchprobleme von enormer praktischer Relevanz effizient durch Answer Set Programming (ASP) gelöst werden. Dabei kann es je nach Umfang des zu lösenden Problems sehr rasch zu einer “kombinatorischen Explosion” der Menge von Lösungen kommen. Während moderne ASP Solver problemlos mehrere Millionen von Lösungen in kurzer Zeit berechnen können, stellt dies den Anwender vor ein neues Problem: Wie soll der enorme Lösungsraum gehandhabt und zugänglich gemacht werden?<br /> Typischer Weise werden die Answer Sets in beliebiger Reihenfolge ausgegeben. Jedoch sind viele dieser Lösungen sehr ähnlich. In der Praxis sind hingegen oft nur Lösungen von Interesse, die sich hinreichend voneinander unterscheiden, die besondere Eigenschaften aufweisen, oder die einer gegebenen Menge von Lösungen ähnlich sind. Derlei Features werden allerdings bis jetzt noch nicht von ASP Solvern unterstützt.<br /> Um eine interaktive und transparente Navigation in ASP-Lösungsräumen zu ermöglichen wird sich das Projekt NAVAS mit den folgenden Themen befassen:<br /> # Entwicklung von Methoden zur interaktiven und transparenten Navigation im Lösungsraum der Answer Sets; <br /> # Implementierung der Methoden mit effizienten Algorithmen; <br /> # Evaluation des Prototyps anhand von Anwendungsfällen aus den Bereichen Konfiguration und Argumentation. <br /> Wir sind zuversichtlich, dass ASP-Technologie durch die in NAVAS erzielten Erkenntnisse, Entwicklungen und Implementierungen auch für eine breitere Masse zugänglicher wird. Hierbei sehen wir ein besonderes unmittelbares Potential im Bereich industrieller Anwendungen, etwa zur Produktkonfiguration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] Erster NAVAS Workshop in Wien (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention bei LPNMR 2022<br /> |Beschreibung EN=Due to the continuous development in recent years, a large number of demanding combinatorial search problems of enormous practical relevance can now be efficiently solved by Answer Set Programming (ASP). Depending on the scope of the problem to be solved, a &quot;combinatorial explosion&quot; of the number of solutions can occur very quickly. While modern ASP solvers can easily calculate several million solutions in a short time, this poses a new problem for the user: How should the enormous solution space be handled and made accessible? Typically, the Answer Sets are output in any order. However, many of these solutions are very similar. In practice, however, often only solutions are of interest that are sufficiently different from each other, that have special properties, or that are similar to a given set of solutions. Such features are not yet supported by ASP solvers. To enable an interactive and transparent navigation in ASP solution spaces the project NAVAS will deal with the following topics:<br /> # Development of methods for interactive and transparent navigation in the Answer Set solution space;<br /> # Implementation of the methods with efficient algorithms;<br /> # Evaluation of the prototype on use cases from the areas of configuration and argumentation theory.<br /> We are confident that the knowledge, developments and implementations achieved in NAVAS will make ASP technology more accessible to a wider audience. We see a particular immediate potential in the area of industrial applications, for example product configuration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] First NAVAS Workshop in Vienna (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78/en] Honorable Mention at LPNMR 2022<br /> |Kontaktperson=Sarah Alice Gaggl<br /> |Project Authors=Sarah Alice Gaggl<br /> |Start=2020/10/01<br /> |Ende=2024/09/30<br /> |Finanziert von=BMBF; 1.268.842,48 €<br /> |Projektstatus=aktiv<br /> |Logo=NAVAS-logo.png<br /> |Person=Sarah Alice Gaggl, Elisa Böhl, Dominik Rusovac<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=NAVAS&diff=37173 2022-09-23T08:56:15Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Projekt<br /> |Kurzname=NAVAS<br /> |Name=Navigation im Lösungsraum von Answer Sets<br /> |Name EN=Navigation Approaches for Answer Sets<br /> |Beschreibung DE=Durch die kontinuierliche Weiterentwicklung in den letzten Jahren können heute eine Vielzahl anspruchsvoller kombinatorischer Suchprobleme von enormer praktischer Relevanz effizient durch Answer Set Programming (ASP) gelöst werden. Dabei kann es je nach Umfang des zu lösenden Problems sehr rasch zu einer “kombinatorischen Explosion” der Menge von Lösungen kommen. Während moderne ASP Solver problemlos mehrere Millionen von Lösungen in kurzer Zeit berechnen können, stellt dies den Anwender vor ein neues Problem: Wie soll der enorme Lösungsraum gehandhabt und zugänglich gemacht werden?<br /> Typischer Weise werden die Answer Sets in beliebiger Reihenfolge ausgegeben. Jedoch sind viele dieser Lösungen sehr ähnlich. In der Praxis sind hingegen oft nur Lösungen von Interesse, die sich hinreichend voneinander unterscheiden, die besondere Eigenschaften aufweisen, oder die einer gegebenen Menge von Lösungen ähnlich sind. Derlei Features werden allerdings bis jetzt noch nicht von ASP Solvern unterstützt.<br /> Um eine interaktive und transparente Navigation in ASP-Lösungsräumen zu ermöglichen wird sich das Projekt NAVAS mit den folgenden Themen befassen:<br /> # Entwicklung von Methoden zur interaktiven und transparenten Navigation im Lösungsraum der Answer Sets; <br /> # Implementierung der Methoden mit effizienten Algorithmen; <br /> # Evaluation des Prototyps anhand von Anwendungsfällen aus den Bereichen Konfiguration und Argumentation. <br /> Wir sind zuversichtlich, dass ASP-Technologie durch die in NAVAS erzielten Erkenntnisse, Entwicklungen und Implementierungen auch für eine breitere Masse zugänglicher wird. Hierbei sehen wir ein besonderes unmittelbares Potential im Bereich industrieller Anwendungen, etwa zur Produktkonfiguration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] Erster NAVAS Workshop in Wien (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention bei LPNMR 2022<br /> |Beschreibung EN=Due to the continuous development in recent years, a large number of demanding combinatorial search problems of enormous practical relevance can now be efficiently solved by Answer Set Programming (ASP). Depending on the scope of the problem to be solved, a &quot;combinatorial explosion&quot; of the number of solutions can occur very quickly. While modern ASP solvers can easily calculate several million solutions in a short time, this poses a new problem for the user: How should the enormous solution space be handled and made accessible? Typically, the Answer Sets are output in any order. However, many of these solutions are very similar. In practice, however, often only solutions are of interest that are sufficiently different from each other, that have special properties, or that are similar to a given set of solutions. Such features are not yet supported by ASP solvers. To enable an interactive and transparent navigation in ASP solution spaces the project NAVAS will deal with the following topics:<br /> # Development of methods for interactive and transparent navigation in the Answer Set solution space;<br /> # Implementation of the methods with efficient algorithms;<br /> # Evaluation of the prototype on use cases from the areas of configuration and argumentation theory.<br /> We are confident that the knowledge, developments and implementations achieved in NAVAS will make ASP technology more accessible to a wider audience. We see a particular immediate potential in the area of industrial applications, for example product configuration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] First NAVAS Workshop in Vienna (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention at LPNMR 2022<br /> |Kontaktperson=Sarah Alice Gaggl<br /> |Project Authors=Sarah Alice Gaggl<br /> |Start=2020/10/01<br /> |Ende=2024/09/30<br /> |Finanziert von=BMBF; 1.268.842,48 €<br /> |Projektstatus=aktiv<br /> |Logo=NAVAS-logo.png<br /> |Person=Sarah Alice Gaggl, Elisa Böhl, Dominik Rusovac<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=NAVAS&diff=37172 2022-09-23T08:55:50Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Projekt<br /> |Kurzname=NAVAS<br /> |Name=Navigation im Lösungsraum von Answer Sets<br /> |Name EN=Navigation Approaches for Answer Sets<br /> |Beschreibung DE=Durch die kontinuierliche Weiterentwicklung in den letzten Jahren können heute eine Vielzahl anspruchsvoller kombinatorischer Suchprobleme von enormer praktischer Relevanz effizient durch Answer Set Programming (ASP) gelöst werden. Dabei kann es je nach Umfang des zu lösenden Problems sehr rasch zu einer “kombinatorischen Explosion” der Menge von Lösungen kommen. Während moderne ASP Solver problemlos mehrere Millionen von Lösungen in kurzer Zeit berechnen können, stellt dies den Anwender vor ein neues Problem: Wie soll der enorme Lösungsraum gehandhabt und zugänglich gemacht werden?<br /> Typischer Weise werden die Answer Sets in beliebiger Reihenfolge ausgegeben. Jedoch sind viele dieser Lösungen sehr ähnlich. In der Praxis sind hingegen oft nur Lösungen von Interesse, die sich hinreichend voneinander unterscheiden, die besondere Eigenschaften aufweisen, oder die einer gegebenen Menge von Lösungen ähnlich sind. Derlei Features werden allerdings bis jetzt noch nicht von ASP Solvern unterstützt.<br /> Um eine interaktive und transparente Navigation in ASP-Lösungsräumen zu ermöglichen wird sich das Projekt NAVAS mit den folgenden Themen befassen:<br /> # Entwicklung von Methoden zur interaktiven und transparenten Navigation im Lösungsraum der Answer Sets; <br /> # Implementierung der Methoden mit effizienten Algorithmen; <br /> # Evaluation des Prototyps anhand von Anwendungsfällen aus den Bereichen Konfiguration und Argumentation. <br /> Wir sind zuversichtlich, dass ASP-Technologie durch die in NAVAS erzielten Erkenntnisse, Entwicklungen und Implementierungen auch für eine breitere Masse zugänglicher wird. Hierbei sehen wir ein besonderes unmittelbares Potential im Bereich industrieller Anwendungen, etwa zur Produktkonfiguration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] Erster NAVAS Workshop in Wien (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention bei LPNMR 2022<br /> |Beschreibung EN=Due to the continuous development in recent years, a large number of demanding combinatorial search problems of enormous practical relevance can now be efficiently solved by Answer Set Programming (ASP). Depending on the scope of the problem to be solved, a &quot;combinatorial explosion&quot; of the number of solutions can occur very quickly. While modern ASP solvers can easily calculate several million solutions in a short time, this poses a new problem for the user: How should the enormous solution space be handled and made accessible? Typically, the Answer Sets are output in any order. However, many of these solutions are very similar. In practice, however, often only solutions are of interest that are sufficiently different from each other, that have special properties, or that are similar to a given set of solutions. Such features are not yet supported by ASP solvers. To enable an interactive and transparent navigation in ASP solution spaces the project NAVAS will deal with the following topics:<br /> # Development of methods for interactive and transparent navigation in the Answer Set solution space;<br /> # Implementation of the methods with efficient algorithms;<br /> # Evaluation of the prototype on use cases from the areas of configuration and argumentation theory.<br /> We are confident that the knowledge, developments and implementations achieved in NAVAS will make ASP technology more accessible to a wider audience. We see a particular immediate potential in the area of industrial applications, for example product configuration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] First NAVAS Workshop in Vienna (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78/en] Honorable Mention at LPNMR 2022<br /> |Kontaktperson=Sarah Alice Gaggl<br /> |Project Authors=Sarah Alice Gaggl<br /> |Start=2020/10/01<br /> |Ende=2024/09/30<br /> |Finanziert von=BMBF; 1.268.842,48 €<br /> |Projektstatus=aktiv<br /> |Logo=NAVAS-logo.png<br /> |Person=Sarah Alice Gaggl, Elisa Böhl, Dominik Rusovac<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=NAVAS&diff=37171 2022-09-23T08:55:19Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Projekt<br /> |Kurzname=NAVAS<br /> |Name=Navigation im Lösungsraum von Answer Sets<br /> |Name EN=Navigation Approaches for Answer Sets<br /> |Beschreibung DE=Durch die kontinuierliche Weiterentwicklung in den letzten Jahren können heute eine Vielzahl anspruchsvoller kombinatorischer Suchprobleme von enormer praktischer Relevanz effizient durch Answer Set Programming (ASP) gelöst werden. Dabei kann es je nach Umfang des zu lösenden Problems sehr rasch zu einer “kombinatorischen Explosion” der Menge von Lösungen kommen. Während moderne ASP Solver problemlos mehrere Millionen von Lösungen in kurzer Zeit berechnen können, stellt dies den Anwender vor ein neues Problem: Wie soll der enorme Lösungsraum gehandhabt und zugänglich gemacht werden?<br /> Typischer Weise werden die Answer Sets in beliebiger Reihenfolge ausgegeben. Jedoch sind viele dieser Lösungen sehr ähnlich. In der Praxis sind hingegen oft nur Lösungen von Interesse, die sich hinreichend voneinander unterscheiden, die besondere Eigenschaften aufweisen, oder die einer gegebenen Menge von Lösungen ähnlich sind. Derlei Features werden allerdings bis jetzt noch nicht von ASP Solvern unterstützt.<br /> Um eine interaktive und transparente Navigation in ASP-Lösungsräumen zu ermöglichen wird sich das Projekt NAVAS mit den folgenden Themen befassen:<br /> # Entwicklung von Methoden zur interaktiven und transparenten Navigation im Lösungsraum der Answer Sets; <br /> # Implementierung der Methoden mit effizienten Algorithmen; <br /> # Evaluation des Prototyps anhand von Anwendungsfällen aus den Bereichen Konfiguration und Argumentation. <br /> Wir sind zuversichtlich, dass ASP-Technologie durch die in NAVAS erzielten Erkenntnisse, Entwicklungen und Implementierungen auch für eine breitere Masse zugänglicher wird. Hierbei sehen wir ein besonderes unmittelbares Potential im Bereich industrieller Anwendungen, etwa zur Produktkonfiguration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] Erster NAVAS Workshop in Wien (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention bei LPNMR 2022<br /> |Beschreibung EN=Due to the continuous development in recent years, a large number of demanding combinatorial search problems of enormous practical relevance can now be efficiently solved by Answer Set Programming (ASP). Depending on the scope of the problem to be solved, a &quot;combinatorial explosion&quot; of the number of solutions can occur very quickly. While modern ASP solvers can easily calculate several million solutions in a short time, this poses a new problem for the user: How should the enormous solution space be handled and made accessible? Typically, the Answer Sets are output in any order. However, many of these solutions are very similar. In practice, however, often only solutions are of interest that are sufficiently different from each other, that have special properties, or that are similar to a given set of solutions. Such features are not yet supported by ASP solvers. To enable an interactive and transparent navigation in ASP solution spaces the project NAVAS will deal with the following topics:<br /> # Development of methods for interactive and transparent navigation in the Answer Set solution space;<br /> # Implementation of the methods with efficient algorithms;<br /> # Evaluation of the prototype on use cases from the areas of configuration and argumentation theory.<br /> We are confident that the knowledge, developments and implementations achieved in NAVAS will make ASP technology more accessible to a wider audience. We see a particular immediate potential in the area of industrial applications, for example product configuration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] First NAVAS Workshop in Vienna (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention at LPNMR 2022<br /> |Kontaktperson=Sarah Alice Gaggl<br /> |Project Authors=Sarah Alice Gaggl<br /> |Start=2020/10/01<br /> |Ende=2024/09/30<br /> |Finanziert von=BMBF; 1.268.842,48 €<br /> |Projektstatus=aktiv<br /> |Logo=NAVAS-logo.png<br /> |Person=Sarah Alice Gaggl, Elisa Böhl, Dominik Rusovac<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=NAVAS&diff=37170 2022-09-23T08:54:57Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Projekt<br /> |Kurzname=NAVAS<br /> |Name=Navigation im Lösungsraum von Answer Sets<br /> |Name EN=Navigation Approaches for Answer Sets<br /> |Beschreibung DE=Durch die kontinuierliche Weiterentwicklung in den letzten Jahren können heute eine Vielzahl anspruchsvoller kombinatorischer Suchprobleme von enormer praktischer Relevanz effizient durch Answer Set Programming (ASP) gelöst werden. Dabei kann es je nach Umfang des zu lösenden Problems sehr rasch zu einer “kombinatorischen Explosion” der Menge von Lösungen kommen. Während moderne ASP Solver problemlos mehrere Millionen von Lösungen in kurzer Zeit berechnen können, stellt dies den Anwender vor ein neues Problem: Wie soll der enorme Lösungsraum gehandhabt und zugänglich gemacht werden?<br /> Typischer Weise werden die Answer Sets in beliebiger Reihenfolge ausgegeben. Jedoch sind viele dieser Lösungen sehr ähnlich. In der Praxis sind hingegen oft nur Lösungen von Interesse, die sich hinreichend voneinander unterscheiden, die besondere Eigenschaften aufweisen, oder die einer gegebenen Menge von Lösungen ähnlich sind. Derlei Features werden allerdings bis jetzt noch nicht von ASP Solvern unterstützt.<br /> Um eine interaktive und transparente Navigation in ASP-Lösungsräumen zu ermöglichen wird sich das Projekt NAVAS mit den folgenden Themen befassen:<br /> # Entwicklung von Methoden zur interaktiven und transparenten Navigation im Lösungsraum der Answer Sets; <br /> # Implementierung der Methoden mit effizienten Algorithmen; <br /> # Evaluation des Prototyps anhand von Anwendungsfällen aus den Bereichen Konfiguration und Argumentation. <br /> Wir sind zuversichtlich, dass ASP-Technologie durch die in NAVAS erzielten Erkenntnisse, Entwicklungen und Implementierungen auch für eine breitere Masse zugänglicher wird. Hierbei sehen wir ein besonderes unmittelbares Potential im Bereich industrieller Anwendungen, etwa zur Produktkonfiguration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] Erster NAVAS Workshop in Wien (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention at LPNMR 2022<br /> |Beschreibung EN=Due to the continuous development in recent years, a large number of demanding combinatorial search problems of enormous practical relevance can now be efficiently solved by Answer Set Programming (ASP). Depending on the scope of the problem to be solved, a &quot;combinatorial explosion&quot; of the number of solutions can occur very quickly. While modern ASP solvers can easily calculate several million solutions in a short time, this poses a new problem for the user: How should the enormous solution space be handled and made accessible? Typically, the Answer Sets are output in any order. However, many of these solutions are very similar. In practice, however, often only solutions are of interest that are sufficiently different from each other, that have special properties, or that are similar to a given set of solutions. Such features are not yet supported by ASP solvers. To enable an interactive and transparent navigation in ASP solution spaces the project NAVAS will deal with the following topics:<br /> # Development of methods for interactive and transparent navigation in the Answer Set solution space;<br /> # Implementation of the methods with efficient algorithms;<br /> # Evaluation of the prototype on use cases from the areas of configuration and argumentation theory.<br /> We are confident that the knowledge, developments and implementations achieved in NAVAS will make ASP technology more accessible to a wider audience. We see a particular immediate potential in the area of industrial applications, for example product configuration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] First NAVAS Workshop in Vienna (23.-24.05.2022)<br /> <br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention at LPNMR 2022<br /> |Kontaktperson=Sarah Alice Gaggl<br /> |Project Authors=Sarah Alice Gaggl<br /> |Start=2020/10/01<br /> |Ende=2024/09/30<br /> |Finanziert von=BMBF; 1.268.842,48 €<br /> |Projektstatus=aktiv<br /> |Logo=NAVAS-logo.png<br /> |Person=Sarah Alice Gaggl, Elisa Böhl, Dominik Rusovac<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=NAVAS&diff=37169 2022-09-23T08:54:41Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Projekt<br /> |Kurzname=NAVAS<br /> |Name=Navigation im Lösungsraum von Answer Sets<br /> |Name EN=Navigation Approaches for Answer Sets<br /> |Beschreibung DE=Durch die kontinuierliche Weiterentwicklung in den letzten Jahren können heute eine Vielzahl anspruchsvoller kombinatorischer Suchprobleme von enormer praktischer Relevanz effizient durch Answer Set Programming (ASP) gelöst werden. Dabei kann es je nach Umfang des zu lösenden Problems sehr rasch zu einer “kombinatorischen Explosion” der Menge von Lösungen kommen. Während moderne ASP Solver problemlos mehrere Millionen von Lösungen in kurzer Zeit berechnen können, stellt dies den Anwender vor ein neues Problem: Wie soll der enorme Lösungsraum gehandhabt und zugänglich gemacht werden?<br /> Typischer Weise werden die Answer Sets in beliebiger Reihenfolge ausgegeben. Jedoch sind viele dieser Lösungen sehr ähnlich. In der Praxis sind hingegen oft nur Lösungen von Interesse, die sich hinreichend voneinander unterscheiden, die besondere Eigenschaften aufweisen, oder die einer gegebenen Menge von Lösungen ähnlich sind. Derlei Features werden allerdings bis jetzt noch nicht von ASP Solvern unterstützt.<br /> Um eine interaktive und transparente Navigation in ASP-Lösungsräumen zu ermöglichen wird sich das Projekt NAVAS mit den folgenden Themen befassen:<br /> # Entwicklung von Methoden zur interaktiven und transparenten Navigation im Lösungsraum der Answer Sets; <br /> # Implementierung der Methoden mit effizienten Algorithmen; <br /> # Evaluation des Prototyps anhand von Anwendungsfällen aus den Bereichen Konfiguration und Argumentation. <br /> Wir sind zuversichtlich, dass ASP-Technologie durch die in NAVAS erzielten Erkenntnisse, Entwicklungen und Implementierungen auch für eine breitere Masse zugänglicher wird. Hierbei sehen wir ein besonderes unmittelbares Potential im Bereich industrieller Anwendungen, etwa zur Produktkonfiguration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] Erster NAVAS Workshop in Wien (23.-24.05.2022)<br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention at LPNMR 2022<br /> |Beschreibung EN=Due to the continuous development in recent years, a large number of demanding combinatorial search problems of enormous practical relevance can now be efficiently solved by Answer Set Programming (ASP). Depending on the scope of the problem to be solved, a &quot;combinatorial explosion&quot; of the number of solutions can occur very quickly. While modern ASP solvers can easily calculate several million solutions in a short time, this poses a new problem for the user: How should the enormous solution space be handled and made accessible? Typically, the Answer Sets are output in any order. However, many of these solutions are very similar. In practice, however, often only solutions are of interest that are sufficiently different from each other, that have special properties, or that are similar to a given set of solutions. Such features are not yet supported by ASP solvers. To enable an interactive and transparent navigation in ASP solution spaces the project NAVAS will deal with the following topics:<br /> # Development of methods for interactive and transparent navigation in the Answer Set solution space;<br /> # Implementation of the methods with efficient algorithms;<br /> # Evaluation of the prototype on use cases from the areas of configuration and argumentation theory.<br /> We are confident that the knowledge, developments and implementations achieved in NAVAS will make ASP technology more accessible to a wider audience. We see a particular immediate potential in the area of industrial applications, for example product configuration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] First NAVAS Workshop in Vienna (23.-24.05.2022)<br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention at LPNMR 2022<br /> |Kontaktperson=Sarah Alice Gaggl<br /> |Project Authors=Sarah Alice Gaggl<br /> |Start=2020/10/01<br /> |Ende=2024/09/30<br /> |Finanziert von=BMBF; 1.268.842,48 €<br /> |Projektstatus=aktiv<br /> |Logo=NAVAS-logo.png<br /> |Person=Sarah Alice Gaggl, Elisa Böhl, Dominik Rusovac<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=NAVAS&diff=37168 2022-09-23T08:53:09Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Projekt<br /> |Kurzname=NAVAS<br /> |Name=Navigation im Lösungsraum von Answer Sets<br /> |Name EN=Navigation Approaches for Answer Sets<br /> |Beschreibung DE=Durch die kontinuierliche Weiterentwicklung in den letzten Jahren können heute eine Vielzahl anspruchsvoller kombinatorischer Suchprobleme von enormer praktischer Relevanz effizient durch Answer Set Programming (ASP) gelöst werden. Dabei kann es je nach Umfang des zu lösenden Problems sehr rasch zu einer “kombinatorischen Explosion” der Menge von Lösungen kommen. Während moderne ASP Solver problemlos mehrere Millionen von Lösungen in kurzer Zeit berechnen können, stellt dies den Anwender vor ein neues Problem: Wie soll der enorme Lösungsraum gehandhabt und zugänglich gemacht werden?<br /> Typischer Weise werden die Answer Sets in beliebiger Reihenfolge ausgegeben. Jedoch sind viele dieser Lösungen sehr ähnlich. In der Praxis sind hingegen oft nur Lösungen von Interesse, die sich hinreichend voneinander unterscheiden, die besondere Eigenschaften aufweisen, oder die einer gegebenen Menge von Lösungen ähnlich sind. Derlei Features werden allerdings bis jetzt noch nicht von ASP Solvern unterstützt.<br /> Um eine interaktive und transparente Navigation in ASP-Lösungsräumen zu ermöglichen wird sich das Projekt NAVAS mit den folgenden Themen befassen:<br /> # Entwicklung von Methoden zur interaktiven und transparenten Navigation im Lösungsraum der Answer Sets; <br /> # Implementierung der Methoden mit effizienten Algorithmen; <br /> # Evaluation des Prototyps anhand von Anwendungsfällen aus den Bereichen Konfiguration und Argumentation. <br /> Wir sind zuversichtlich, dass ASP-Technologie durch die in NAVAS erzielten Erkenntnisse, Entwicklungen und Implementierungen auch für eine breitere Masse zugänglicher wird. Hierbei sehen wir ein besonderes unmittelbares Potential im Bereich industrieller Anwendungen, etwa zur Produktkonfiguration.<br /> <br /> '''News:'''<br /> <br /> Erster NAVAS Workshop in Wien (23.-24.05.2022) [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien]<br /> |Beschreibung EN=Due to the continuous development in recent years, a large number of demanding combinatorial search problems of enormous practical relevance can now be efficiently solved by Answer Set Programming (ASP). Depending on the scope of the problem to be solved, a &quot;combinatorial explosion&quot; of the number of solutions can occur very quickly. While modern ASP solvers can easily calculate several million solutions in a short time, this poses a new problem for the user: How should the enormous solution space be handled and made accessible? Typically, the Answer Sets are output in any order. However, many of these solutions are very similar. In practice, however, often only solutions are of interest that are sufficiently different from each other, that have special properties, or that are similar to a given set of solutions. Such features are not yet supported by ASP solvers. To enable an interactive and transparent navigation in ASP solution spaces the project NAVAS will deal with the following topics:<br /> # Development of methods for interactive and transparent navigation in the Answer Set solution space;<br /> # Implementation of the methods with efficient algorithms;<br /> # Evaluation of the prototype on use cases from the areas of configuration and argumentation theory.<br /> We are confident that the knowledge, developments and implementations achieved in NAVAS will make ASP technology more accessible to a wider audience. We see a particular immediate potential in the area of industrial applications, for example product configuration.<br /> <br /> '''News:'''<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl/NAVAS_Workshop-Wien] First NAVAS Workshop in Vienna (23.-24.05.2022)<br /> [https://iccl.inf.tu-dresden.de/web/News78] Honorable Mention at LPNMR 2022<br /> |Kontaktperson=Sarah Alice Gaggl<br /> |Project Authors=Sarah Alice Gaggl<br /> |Start=2020/10/01<br /> |Ende=2024/09/30<br /> |Finanziert von=BMBF; 1.268.842,48 €<br /> |Projektstatus=aktiv<br /> |Logo=NAVAS-logo.png<br /> |Person=Sarah Alice Gaggl, Elisa Böhl, Dominik Rusovac<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Abstrakte Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=News78/en&diff=37167 2022-09-23T08:42:07Z

<p>Dominik Rusovac: Page created automatically by parser function on page News78</p> <hr /> <div>{{Neuigkeit/en}}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=News78&diff=37166 2022-09-23T08:42:07Z

<p>Dominik Rusovac: Die Seite wurde neu angelegt: „{{Neuigkeit |Titel DE=Honorable Mention bei LPNMR 2022 |Titel EN=Honorable Mention at LPNMR 2022 |Beschreibung DE=[[Datei:Lpmnr22honmen.jpeg|300px|thumb|right]…“</p> <hr /> <div>{{Neuigkeit<br /> |Titel DE=Honorable Mention bei LPNMR 2022<br /> |Titel EN=Honorable Mention at LPNMR 2022<br /> |Beschreibung DE=[[Datei:Lpmnr22honmen.jpeg|300px|thumb|right]]<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Inproceedings3335 IASCAR: Incremental Answer Set Counting by Anytime Refinement] erhält &quot;Honorable Mention&quot; (Best-Paper Finalist) auf der [https://sites.google.com/view/lpnmr2022 16th International Conference on Logic Programming and Non-monotonic Reasoning] (LPMNR 2022). <br /> <br /> <br /> Gratulation an die Kollegen [https://informatics.tuwien.ac.at/people/johannes-fichte Johannes K. Fichte] und [https://www.dbai.tuwien.ac.at/staff/hecher/ Markus Hecher] von der [https://www.dbai.tuwien.ac.at/ Database and Artificial Intelligence Group] der TU Wien, [[NAVAS]]-Projekt- und [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation LpArg]-Gruppenleiterin [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] und ihren PhD-Studenten [https://iccl.inf.tu-dresden.de/web/Dominik_Rusovac Dominik Rusovac]!<br /> |Beschreibung EN=[[Datei:Lpmnr22honmen.jpeg|300px|thumb|right]]<br /> <br /> [https://iccl.inf.tu-dresden.de/web/Inproceedings3335 IASCAR: Incremental Answer Set Counting by Anytime Refinement] receives &quot;Honorable Mention&quot; (best paper award finalist) at the [https://sites.google.com/view/lpnmr2022 16th International Conference on Logic Programming and Non-monotonic Reasoning] (LPMNR 2022). <br /> <br /> <br /> Congratulations to our colleagues [https://informatics.tuwien.ac.at/people/johannes-fichte Johannes K. Fichte] and [https://www.dbai.tuwien.ac.at/staff/hecher/ Markus Hecher] from the [https://www.dbai.tuwien.ac.at/ Database and Artificial Intelligence Group] at TU Wien, [[NAVAS]] project and [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation LpArg] group leader [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] and her PhD student [https://iccl.inf.tu-dresden.de/web/Dominik_Rusovac Dominik Rusovac]!<br /> |Datum=2022/09/20<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Lpmnr22honmen.jpeg&diff=37158 2022-09-19T12:58:41Z

<p>Dominik Rusovac: </p> <hr /> <div></div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Lpmnr22_honorable_mention.jpeg&diff=37157 2022-09-19T12:20:24Z

<p>Dominik Rusovac: </p> <hr /> <div></div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=36697 2022-06-22T12:33:42Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 37920<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=APB 2017<br /> |Bild=Dominik-400x600.jpg<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> |Info EN=I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] in January 2021. <br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl | Forschungsgebiet=Answer Set Programming}}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=36683 2022-06-21T15:08:50Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 37920<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=APB 2017<br /> |Bild=Dominik-400x600.jpg<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> <br /> &lt;b&gt;Open Source Tools&lt;/b&gt; <br /> * [https://github.com/drwadu/fasb &lt;b&gt;fasb&lt;/b&gt; - faceted answer set browser]<br /> * [https://github.com/drwadu/iascar &lt;b&gt;iascar&lt;/b&gt; - incremental answer set counter with anytime refinement (propositional model counter)]<br /> Tools können [https://cloudstore.zih.tu-dresden.de/index.php/s/Dfnxp53ggtxkJcr hier] heruntergeladen werden.<br /> <br /> |Info EN=I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] in January 2021. <br /> <br /> &lt;b&gt;Open Source Tools&lt;/b&gt; <br /> * [https://github.com/drwadu/fasb &lt;b&gt;fasb&lt;/b&gt; - faceted answer set browser]<br /> * [https://github.com/drwadu/iascar &lt;b&gt;iascar&lt;/b&gt; - incremental answer set counter with anytime refinement (propositional model counter)]<br /> Binaries can be downloaded [https://cloudstore.zih.tu-dresden.de/index.php/s/Dfnxp53ggtxkJcr here].<br /> <br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl | Forschungsgebiet=Answer Set Programming}}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=36682 2022-06-21T15:06:17Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 37920<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=APB 2017<br /> |Bild=Dominik-400x600.jpg<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> <br /> &lt;b&gt;Open Source Tools&lt;/b&gt; <br /> * [https://github.com/drwadu/fasb &lt;b&gt;fasb&lt;/b&gt; - faceted answer set browser]<br /> * [https://github.com/drwadu/iascar &lt;b&gt;iascar&lt;/b&gt; - incremental answer set counter with anytime refinement (propositional model counter)]<br /> Tools können [https://cloudstore.zih.tu-dresden.de/index.php/s/Dfnxp53ggtxkJcr hier] heruntergeladen werden.<br /> <br /> |Info EN=In January 2021,I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation]. <br /> &lt;p&gt;&lt;/p&gt;<br /> &lt;b&gt;Open Source Tools&lt;/b&gt; <br /> * [https://github.com/drwadu/fasb &lt;b&gt;fasb&lt;/b&gt; - faceted answer set browser]<br /> * [https://github.com/drwadu/iascar &lt;b&gt;iascar&lt;/b&gt; - incremental answer set counter with anytime refinement (propositional model counter)]<br /> Binaries can be downloaded [https://cloudstore.zih.tu-dresden.de/index.php/s/Dfnxp53ggtxkJcr here].<br /> <br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl | Forschungsgebiet=Answer Set Programming}}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=36681 2022-06-21T15:03:47Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 37920<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=APB 2017<br /> |Bild=Dominik-400x600.jpg<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> <br /> &lt;b&gt;Open Source Tools&lt;/b&gt; <br /> * [https://github.com/drwadu/fasb &lt;b&gt;fasb&lt;/b&gt; - faceted answer set browser]<br /> * [https://github.com/drwadu/iascar &lt;b&gt;iascar&lt;/b&gt; - incremental answer set counter with anytime refinement (propositional model counter)]<br /> Tools können [https://cloudstore.zih.tu-dresden.de/index.php/s/Dfnxp53ggtxkJcr hier] heruntergeladen werden.<br /> <br /> |Info EN=I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] in January 2021. <br /> &lt;p&gt;&lt;/p&gt;<br /> &lt;b&gt;Open Source Tools&lt;/b&gt; <br /> * [https://github.com/drwadu/fasb &lt;b&gt;fasb&lt;/b&gt; - faceted answer set browser]<br /> * [https://github.com/drwadu/iascar &lt;b&gt;iascar&lt;/b&gt; - incremental answer set counter with anytime refinement (propositional model counter)]<br /> Binaries can be downloaded [https://cloudstore.zih.tu-dresden.de/index.php/s/Dfnxp53ggtxkJcr here].<br /> <br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl | Forschungsgebiet=Answer Set Programming}}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=36680 2022-06-21T15:02:41Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 37920<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=APB 2017<br /> |Bild=Dominik-400x600.jpg<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> <br /> &lt;b&gt;Open Source Tools&lt;/b&gt; <br /> * [https://github.com/drwadu/fasb &lt;b&gt;fasb&lt;/b&gt; - faceted answer set browser]<br /> * [https://github.com/drwadu/iascar &lt;b&gt;iascar&lt;/b&gt; - incremental answer set counter with anytime refinement (propositional model counter)]<br /> Tools können [https://cloudstore.zih.tu-dresden.de/index.php/s/Dfnxp53ggtxkJcr hier] heruntergeladen werden.<br /> <br /> |Info EN=I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] in January 2021. <br /> <br /> &lt;b&gt;Open Source Tools&lt;/b&gt; <br /> * [https://github.com/drwadu/fasb &lt;b&gt;fasb&lt;/b&gt; - faceted answer set browser]<br /> * [https://github.com/drwadu/iascar &lt;b&gt;iascar&lt;/b&gt; - incremental answer set counter with anytime refinement (propositional model counter)]<br /> Binaries can be downloaded [https://cloudstore.zih.tu-dresden.de/index.php/s/Dfnxp53ggtxkJcr here].<br /> <br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl | Forschungsgebiet=Answer Set Programming}}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=36679 2022-06-21T15:02:12Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 37920<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=APB 2017<br /> |Bild=Dominik-400x600.jpg<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> <br /> &lt;b&gt;Open Source Tools&lt;/b&gt; <br /> * [https://github.com/drwadu/fasb &lt;b&gt;fasb&lt;/b&gt; - faceted answer set browser]<br /> * [https://github.com/drwadu/iascar &lt;b&gt;iascar&lt;/b&gt; - incremental answer set counter with anytime refinement (propositional model counter)]<br /> Tools können [https://cloudstore.zih.tu-dresden.de/index.php/s/Dfnxp53ggtxkJcr hier] heruntergeladen werden.<br /> <br /> |Info EN=I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] in January 2021. <br /> &lt;b&gt;Open Source Tools&lt;/b&gt; <br /> * [https://github.com/drwadu/fasb &lt;b&gt;fasb&lt;/b&gt; - faceted answer set browser]<br /> * [https://github.com/drwadu/iascar &lt;b&gt;iascar&lt;/b&gt; - incremental answer set counter with anytime refinement (propositional model counter)]<br /> Binaries can be downloaded [https://cloudstore.zih.tu-dresden.de/index.php/s/Dfnxp53ggtxkJcr here].<br /> <br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl | Forschungsgebiet=Answer Set Programming}}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&diff=36427 2022-05-10T09:57:57Z

<p>Dominik Rusovac: </p> <hr /> <div>{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}<br /> &lt;!--*<br /> 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.--&gt;<br /> <br /> The NAVAS workshop on ''Navigation Approaches for Answer Sets'' 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;!--*The event will be held at the TODO--&gt;<br /> <br /> [[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]<br /> <br /> {{#maketabs:<br /> |Aim and Scope=<br /> <br /> |Programme=<br /> The NaVAS workshop will take place from Monday, May 21th until Wednesday May 23th of 2022. <br /> <br /> Monday, May 23th:<br /> <br /> *09:15 Welcome<br /> *09:20 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]<br /> *09:45 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy - [[Elisa Böhl]]<br /> <br /> *10:15 Coffee break<br /> <br /> *10:30 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]<br /> *11:30 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy - [[Dominik Rusovac]]<br /> <br /> <br /> Tuesday, May 24th:<br /> <br /> *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]<br /> <br /> &lt;!--TODO: link ersetzen --&gt;<br /> <br /> |Abstracts=<br /> For the schedule on on Monday, May 23th the following talks are presented.<br /> <br /> === Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===<br /> [[Elisa Böhl]]<br /> <br /> 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.<br /> <br /> <br /> === Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===<br /> [[Martin Diller]]<br /> <br /> 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.<br /> <br /> === Rushing and Strolling among Answer Sets - Navigation Made Easy ===<br /> [[Dominik Rusovac]] <br /> <br /> 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.<br /> <br /> |Organization=<br /> '''Organization '''&lt;br /&gt;<br /> *[[Sarah Gaggl]]<br /> *[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte]<br /> <br /> <br /> }}&lt;!-- End of #maketabs --&gt;</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=36426 2022-05-10T09:56:04Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 37920<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=APB 2017<br /> |Bild=Dominik-400x600.jpg<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> |Info EN=I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] in January 2021.<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&diff=36425 2022-05-10T09:55:23Z

<p>Dominik Rusovac: </p> <hr /> <div>{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}<br /> &lt;!--*<br /> 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.--&gt;<br /> <br /> The NAVAS workshop on ''Navigation Approaches for Answer Sets'' 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;!--*The event will be held at the TODO--&gt;<br /> <br /> [[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]<br /> <br /> {{#maketabs:<br /> |Aim and Scope=<br /> <br /> |Programme=<br /> The NaVAS workshop will take place from Monday, May 21th until Wednesday May 23th of 2022. <br /> <br /> Monday, May 23th:<br /> <br /> *09:15 Welcome<br /> *09:20 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]<br /> *09:45 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy - [[Elisa Böhl]]<br /> <br /> *10:15 Coffee break<br /> <br /> *10:30 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]<br /> *11:30 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy [[Dominik Rusovac]]<br /> <br /> <br /> Tuesday, May 24th:<br /> <br /> *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]<br /> <br /> &lt;!--TODO: link ersetzen --&gt;<br /> <br /> |Abstracts=<br /> For the schedule on on Monday, May 23th the following talks are presented.<br /> <br /> === Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===<br /> [[Elisa Böhl]]<br /> <br /> 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.<br /> <br /> <br /> === Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===<br /> [[Martin Diller]]<br /> <br /> 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.<br /> <br /> === Rushing and Strolling among Answer Sets - Navigation Made Easy ===<br /> [[Dominik Rusovac]] <br /> <br /> 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.<br /> <br /> |Organization=<br /> '''Organization '''&lt;br /&gt;<br /> *[[Sarah Gaggl]]<br /> *[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte]<br /> <br /> <br /> }}&lt;!-- End of #maketabs --&gt;</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&diff=36422 2022-05-10T09:54:26Z

<p>Dominik Rusovac: </p> <hr /> <div>{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}<br /> &lt;!--*<br /> 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.--&gt;<br /> <br /> The NAVAS workshop on ''Navigation Approaches for Answer Sets'' 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;!--*The event will be held at the TODO--&gt;<br /> <br /> [[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]<br /> <br /> {{#maketabs:<br /> |Aim and Scope=<br /> <br /> |Programme=<br /> The NaVAS workshop will take place from Monday, May 21th until Wednesday May 23th of 2022. <br /> <br /> Monday, May 23th:<br /> <br /> *09:15 Welcome<br /> *09:20 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]<br /> *09:45 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy - [[Elisa Böhl]]<br /> <br /> *10:15 Coffee break<br /> <br /> *10:30 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]<br /> *11:30 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy [[Dominik Rusovac]]<br /> <br /> <br /> Tuesday, May 24th:<br /> <br /> *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]<br /> <br /> &lt;!--TODO: link ersetzen --&gt;<br /> <br /> |Abstracts=<br /> For the schedule on on Monday, May 23th the following talks are presented.<br /> <br /> === Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===<br /> [[Elisa Böhl]]<br /> <br /> 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.<br /> <br /> <br /> === Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===<br /> [[Martin Diller]]<br /> <br /> 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.<br /> <br /> === Rushing and Strolling among Answer Sets - Navigation Made Easy ===<br /> [[Dominik Rusovac]] <br /> <br /> Answer set programming (ASP) is a popular declarative programming paradigm with a wide range<br /> of applications in artificial intelligence. Oftentimes, when modeling an AI problem with ASP, and in<br /> 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<br /> a user aims to identify a specific answer set according to her needs, or requires the total number<br /> 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<br /> to navigate the solution space of ASP programs, which is oftentimes not enough. We<br /> propose a formal and general framework for interactive navigation toward desired subsets of answer<br /> sets analogous to faceted browsing. Our approach enables the user to explore the solution space by<br /> consciously zooming in or out of sub-spaces of solutions at a certain configurable pace. We illustrate<br /> that weighted faceted navigation is computationally hard. Finally, we provide an implementation<br /> of our approach that demonstrates the feasibility of our framework for incomprehensible solution spaces.<br /> <br /> |Organization=<br /> '''Organization '''&lt;br /&gt;<br /> *[[Sarah Gaggl]]<br /> *[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte]<br /> <br /> <br /> }}&lt;!-- End of #maketabs --&gt;</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Sarah_Alice_Gaggl/NAVAS_Workshop-Wien&diff=36420 2022-05-10T09:50:22Z

<p>Dominik Rusovac: </p> <hr /> <div>{{DISPLAYTITLE:NAVAS Workshop 2022 in Vienna}}<br /> &lt;!--*<br /> 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.--&gt;<br /> <br /> The NAVAS workshop on ''Navigation Approaches for Answer Sets'' 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;!--*The event will be held at the TODO--&gt;<br /> <br /> [[Image:Vienna-Pierre Blaché.jpg|center|Vienna Skyline]]<br /> <br /> {{#maketabs:<br /> |Aim and Scope=<br /> <br /> |Programme=<br /> The NaVAS workshop will take place from Monday, May 21th until Wednesday May 23th of 2022. <br /> <br /> Monday, May 23th:<br /> <br /> *09:15 Welcome<br /> *09:20 Talk: NAVAS - Navigation in the solution space of answer sets and Visualization for Argument Frameworks - [[Sarah Alice Gaggl]]<br /> *09:45 Talk: Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy - [[Elisa Böhl]]<br /> <br /> *10:15 Coffee break<br /> <br /> *10:30 Talk: Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation - [[Martin Diller]]<br /> *11:30 Talk: Rushing and Strolling among Answer Sets - Navigation Made Easy [[Dominik Rusovac]]<br /> <br /> <br /> Tuesday, May 24th:<br /> <br /> *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]<br /> <br /> &lt;!--TODO: link ersetzen --&gt;<br /> <br /> |Abstracts=<br /> For the schedule on on Monday, May 23th the following talks are presented.<br /> <br /> === Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy ===<br /> [[Elisa Böhl]]<br /> <br /> 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.<br /> <br /> <br /> === Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation ===<br /> [[Martin Diller]]<br /> <br /> 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.<br /> <br /> === Rushing and Strolling among Answer Sets - Navigation Made Easy ===<br /> [[Dominik Rusovac]] <br /> <br /> Answer set programming (ASP) is a popular declarative programming paradigm<br /> with a wide range of applications in artificial intelligence. Oftentimes,<br /> when modeling an AI problem with ASP, and in particular when we are interested<br /> beyond simple search for optimal solutions, an actual solution, differences<br /> between solutions, or number of solutions of the ASP program matter. For<br /> example, when a user aims to identify a specific answer set according to her<br /> needs, or requires the total number of diverging solutions to comprehend<br /> probabilistic applications such as reasoning in medical domains. Then, there<br /> are only certain problem specific and handcrafted encoding techniques<br /> available to navigate the solution space of ASP programs, which is oftentimes<br /> not enough. In this paper, we propose a formal and general framework for<br /> interactive navigation toward desired subsets of answer sets analogous to<br /> faceted browsing. Our approach enables the user to explore the solution space<br /> by consciously zooming in or out of sub-spaces of solutions at a certain<br /> configurable pace. We illustrate that weighted faceted navigation is<br /> computationally hard. Finally, we provide an implementation of our approach<br /> that demonstrates the feasibility of our framework for incomprehensible<br /> solution spaces. <br /> <br /> |Organization=<br /> '''Organization '''&lt;br /&gt;<br /> *[[Sarah Gaggl]]<br /> *[https://informatics.tuwien.ac.at/people/johannes-fichte Johannes Fichte]<br /> <br /> <br /> }}&lt;!-- End of #maketabs --&gt;</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=32658 2021-02-04T11:12:26Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=M.A.<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 37920<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=APB 2017<br /> |Bild=Some portrait.jpeg<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> |Info EN=I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] in January 2021.<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=32543 2021-01-19T20:51:14Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=M.A.<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=APB 2017<br /> |Bild=Some portrait.jpeg<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> |Info EN=I joined the BMBF funded project [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation Approaches for Answer Sets] as part of my doctoral studies and as a member of the research group [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] in January 2021.<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}</div>

Dominik Rusovac https://iccl.inf.tu-dresden.de/w/index.php?title=Dominik_Rusovac&diff=32542 2021-01-19T20:33:33Z

<p>Dominik Rusovac: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Dominik<br /> |Nachname=Rusovac<br /> |Akademischer Titel=M.A.<br /> |Forschungsgruppe=Logische Programmierung und Argumentation<br /> |Stellung=Wissenschaftlicher Mitarbeiter<br /> |Ehemaliger=0<br /> |Email=dominik.rusovac@tu-dresden.de<br /> |Raum=APB 2017<br /> |Bild=Some portrait.jpeg<br /> |Info=Seit Januar 2021 arbeite ich im Rahmen meines Doktorats als Teil der Arbeitsgruppe [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logische Programmierung und Argumentation] von [https://iccl.inf.tu-dresden.de/web/Sarah_Alice_Gaggl Sarah Alice Gaggl] im BMBF geförderten Projekt [https://iccl.inf.tu-dresden.de/web/NAVAS NAVAS - Navigation im Lösungsraum von Answer Sets].<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Answer Set Programming<br /> }}</div>

Dominik Rusovac