https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&user=Stefan+Ellmauthaler&feedformat=atomInternational Center for Computational Logic - Benutzerbeiträge [de]2024-03-28T09:00:50ZBenutzerbeiträgeMediaWiki 1.35.6https://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2124/en&diff=39400Aktivitaet2124/en2024-02-12T09:53:48Z<p>Stefan Ellmauthaler: Page created automatically by parser function on page Aktivitaet2124</p>
<hr />
<div>#REDIRECT [[Aktivitaet2124]]</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2124&diff=39399Aktivitaet21242024-02-12T09:53:47Z<p>Stefan Ellmauthaler: Die Seite wurde neu angelegt: „{{Aktivität |Beschreibung DE=Co-Organisator des 5. International Workshop on Systems and Algorithms for Formal Argumentation |Beschreibung EN=Co-chair of the…“</p>
<hr />
<div>{{Aktivität<br />
|Beschreibung DE=Co-Organisator des 5. International Workshop on Systems and Algorithms for Formal Argumentation<br />
|Beschreibung EN=Co-chair of the 5th International Workshop on Systems and Algorithms for Formal Argumentation<br />
|Person=Stefan Ellmauthaler<br />
|Start(Jahr)=2024<br />
|Ende(Jahr)=2024<br />
|Rank=★★<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2123/en&diff=39398Aktivitaet2123/en2024-02-12T09:51:12Z<p>Stefan Ellmauthaler: Page created automatically by parser function on page Aktivitaet2123</p>
<hr />
<div>#REDIRECT [[Aktivitaet2123]]</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2123&diff=39397Aktivitaet21232024-02-12T09:51:12Z<p>Stefan Ellmauthaler: Die Seite wurde neu angelegt: „{{Aktivität |Beschreibung DE=Programmkomiteemitglied der 27. European Conference on Artificial Intelligence |Beschreibung EN=Program committee member of the 2…“</p>
<hr />
<div>{{Aktivität<br />
|Beschreibung DE=Programmkomiteemitglied der 27. European Conference on Artificial Intelligence<br />
|Beschreibung EN=Program committee member of the 27th European Conference on Artificial Inelligence<br />
|Person=Stefan Ellmauthaler<br />
|Start(Jahr)=2024<br />
|Ende(Jahr)=2024<br />
|Rank=★★<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3370&diff=39261Inproceedings33702024-01-09T10:00:03Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Lukas Gerlach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=ADF-BDD.DEV: Insights to undecided Statements in Abstract Dialectical Frameworks<br />
|To appear=0<br />
|Year=2023<br />
|Month=Dezember<br />
|Booktitle=Proceedings of the 7th Workshop on Advances in Argumentation in Artificial Intelligence (AI^3 2023) co-located with the 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), Rome, Italy, November 9, 2023<br />
|Publisher=CEUR-WS.org<br />
|Editor=Gianvincenzo Alfano, Stefano Ferilli<br />
|Series=CEUR Workshop Proceedings<br />
|Volume=3546<br />
}}<br />
{{Publikation Tool<br />
|Tool=Adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract Dialectical Frameworks (ADF) are a well known and understood generalisation of Dung’s Argumentation frameworks. Multiple approaches to solve the computation and enumeration of the semantics have been proposed over the last decade. One recent approach is to solve the computational hard problems by translating the acceptance condition of a given ADF into reduced ordered binary decision diagrams (roBDD). The use of roBDDs lays a foundation for straightforward graphical visualization of the underlying ADFs and their solutions. In this work, we present ADF-BDD.DEV, a web-service that generates graphical representations of ADFs and for different semantics, allowing their comparison and to spot the influence of yet undecided statements. We propose that this is a first steps towards better explainability and understanding of ADFs.<br />
|Download=ai3 2023 cr manuscript.pdf<br />
|Slides=ai3 2023 talk.pdf<br />
|Link=https://ceur-ws.org/Vol-3546/paper11.pdf<br />
|Projekt=CPEC, InnoSale, SECAI, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3370&diff=39260Inproceedings33702024-01-09T09:59:17Z<p>Stefan Ellmauthaler: Updated Publication</p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Lukas Gerlach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=ADF-BDD.DEV: Insights to undecided Statements in Abstract Dialectical Frameworks<br />
|To appear=0<br />
|Year=2023<br />
|Month=Dezember<br />
|Booktitle=Proceedings of the 7th Workshop on Advances in Argumentation in Artificial Intelligence (AI^3 2023) co-located with the 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), Rome, Italy, November 9, 2023<br />
|Publisher=CEUR-WS.org<br />
|Editor=Gianvincenzo Alfano, Stefano Ferilli<br />
|Series=CEUR Workshop Proceedings<br />
|Volume=3546<br />
}}<br />
{{Publikation Tool<br />
|Tool=Adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract Dialectical Frameworks (ADF) are a well known and understood generalisation of Dung’s Argumentation frameworks. Multiple approaches to solve the computation and enumeration of the semantics have been proposed over the last decade. One recent approach is to solve the computational hard problems by translating the acceptance condition of a given ADF into reduced ordered binary decision diagrams (roBDD). The use of roBDDs lays a foundation for straightforward graphical visualization of the underlying ADFs and their solutions. In this work, we present ADF-BDD.DEV, a web-service that generates graphical representations of ADFs and for different semantics, allowing their comparison and to spot the influence of yet undecided statements. We propose that this is a first steps towards better explainability and understanding of ADFs.<br />
|Download=ai3 2023 cr manuscript.pdf<br />
|Slides=ai3 2023 talk.pdf<br />
|Link=https://ceur-ws.org/Vol-3546/paper11.pdf<br />
|Projekt=CPEC, InnoSale, SECAI, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3370&diff=39034Inproceedings33702023-11-08T10:51:17Z<p>Stefan Ellmauthaler: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Stefan |ErsterAutorNachname=Ellmauthaler |FurtherAuthors=Lukas Gerlach }} {{Inproceedings |Referiert=1 |Title=AD…“</p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Lukas Gerlach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=ADF-BDD.DEV: Insights to undecided Statements in Abstract Dialectical Frameworks<br />
|To appear=1<br />
|Year=2023<br />
|Month=November<br />
|Booktitle=7th Workshop on Advances in Argumentation in Artificial Intelligence (AI³ 2023)<br />
}}<br />
{{Publikation Tool<br />
|Tool=Adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract Dialectical Frameworks (ADF) are a well known and understood generalisation of Dung’s Argumentation frameworks. Multiple approaches to solve the computation and enumeration of the semantics have been proposed over the last decade. One recent approach is to solve the computational hard problems by translating the acceptance condition of a given ADF into reduced ordered binary decision diagrams (roBDD). The use of roBDDs lays a foundation for straightforward graphical visualization of the underlying ADFs and their solutions. In this work, we present ADF-BDD.DEV, a web-service that generates graphical representations of ADFs and for different semantics, allowing their comparison and to spot the influence of yet undecided statements. We propose that this is a first steps towards better explainability and understanding of ADFs.<br />
|Download=ai3 2023 cr manuscript.pdf<br />
|Slides=ai3 2023 talk.pdf<br />
|Projekt=CPEC, InnoSale, SECAI, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Ai3_2023_talk.pdf&diff=39033Datei:Ai3 2023 talk.pdf2023-11-08T10:49:55Z<p>Stefan Ellmauthaler: </p>
<hr />
<div></div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Ai3_2023_cr_manuscript.pdf&diff=39032Datei:Ai3 2023 cr manuscript.pdf2023-11-08T10:49:26Z<p>Stefan Ellmauthaler: </p>
<hr />
<div></div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3367&diff=38620Inproceedings33672023-09-02T11:49:14Z<p>Stefan Ellmauthaler: add slides</p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Lukas Gerlach<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=ADF-BDD.DEV: Debug Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=0<br />
|Year=2023<br />
|Month=September<br />
|Booktitle=The Fourth Workshop on Explainable Logic-Based Knowledge Representation (XLoKR 2023)<br />
}}<br />
{{Publikation Tool<br />
|Tool=Adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract Dialectical Frameworks (ADF) are a well known and understood generalisation of Dung's Argumentation frameworks. Multiple approaches to solve the computation and enumeration of the semantics have been proposed over the last decade. One recent approach is to solve the computational hard problems by translating the acceptance condition of a given ADF into reduced ordered binary decision diagrams (roBDD). While the number of solvers for ADFs is plentyful, they merely give text-based solutions to the problems. The use of roBDDs lays a foundation for straightforward graphical visualization of the underlying ADFs and their solutions. In this work, we present adf-bdd.dev, a web-service that generates graphical solutions to ADFs for different semantics, allowing their comparison and to spot the influence of yet undecided statements. We think that this is a first steps towards better explainability and simplifies debugging of ADFs.<br />
|Download=Xlokr-2023-ellmauthaler-gerlach-submission2105.pdf<br />
|Slides=Talk.pdf<br />
|Link=https://adf-bdd.dev, https://sites.google.com/view/xlokr2023<br />
|Projekt=CPEC, InnoSale, SECAI, ScaDS.AI, Cfaed<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Talk.pdf&diff=38619Datei:Talk.pdf2023-09-02T11:48:49Z<p>Stefan Ellmauthaler: </p>
<hr />
<div></div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2119/en&diff=38133Aktivitaet2119/en2023-05-05T09:53:39Z<p>Stefan Ellmauthaler: Page created automatically by parser function on page Aktivitaet2119</p>
<hr />
<div>#REDIRECT [[Aktivitaet2119]]</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2119&diff=38132Aktivitaet21192023-05-05T09:53:39Z<p>Stefan Ellmauthaler: Die Seite wurde neu angelegt: „{{Aktivität |Beschreibung DE=Programmkomiteemitglied der 26. European Conference on Artificial Intelligence 2023 (ECAI 2023) |Beschreibung EN=Program committe…“</p>
<hr />
<div>{{Aktivität<br />
|Beschreibung DE=Programmkomiteemitglied der 26. European Conference on Artificial Intelligence 2023 (ECAI 2023)<br />
|Beschreibung EN=Program committee member of the 26th European Conference on Artificial Intelligence 2023 (ECAI 2023)<br />
|Person=Stefan Ellmauthaler<br />
|URL=https://ecai2023.eu/<br />
|Start(Jahr)=2023<br />
|Ende(Jahr)=2023<br />
|Rank=★<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Adf-bdd&diff=38121Adf-bdd2023-05-03T13:50:18Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{DataOrTool<br />
|name=adf-bdd<br />
|short description EN=Abstract Dialectical Frameworks solved with Binary Decision Diagrams<br />
|short description DE=Abstract Dialectical Frameworks mit Binary Decision Diagrammen lösen<br />
|contact persons=Stefan Ellmauthaler<br />
|contributors=Stefan Ellmauthaler; Dominik Rusovac; Lukas Gerlach<br />
|link=https://ellmau.github.io/adf-obdd/<br />
|publication date=2022/04/22<br />
|long description EN=Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) is a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD).<br />
Our system is based on the consideration that many otherwise hard to decide problems in ADF semantics (e. g., answering SAT-questions) can be solved in polynomial time on roBDDs. <br />
Our novel approach differs to the currently used systems, like the SAT-based approaches or the wide spectrum of answer set programming (ASP) focused approaches.<br />
ADF -BDD is written in RUST to provide good performance while enforcing a high amount of memory- and type-safety.<br />
In addition the rust-compiler produces highly optimised machine code, while keeping the whole tech stack simple.<br />
|long description DE=Abstract Dialectical Frameworks (ADF) sind eine Generalisierung von Dung Argumentation Frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) ist ein neuer Ansatz, welcher die Akzeptanzfunktionen eines ADF als reduziert geordnete binäre Entscheidungsdiagramme (reduced ordered binary decision diagrams - roBDD) übersetzt.<br />
Das tool basiert auf dem Konzept, dass einige - sonst schwer zu lösende - Entscheidungsprobleme bei der Berechnung der ADF-Semantiken in polynomieller Zeit von roBDDs gelöst werden können.<br />
Aktuelle state-of-the-art solver basieren derzeit auf SAT oder Antwortmengenprogrammierung basierten ansätzen, weshalb adf-bdd ein Alleinstellungsmerkmal besitzt.<br />
ADF-BDD ist in RUST geschrieben, welches gute Performanz und einen hohen Grad an Speicher- sowie Typ-sicherheit bietet.<br />
Zudem bietet der rust-compiler hochgradig optimierten Maschinencode, während der Techstack simple bleibt.<br />
|projekt=InnoSale; ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
|dataOrTool=Tool<br />
|Projektstatus=aktiv<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Nichtmonotones Schließen<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Adf-bdd&diff=38120Adf-bdd2023-05-03T13:49:59Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{DataOrTool<br />
|name=adf-bdd<br />
|short description EN=Abstract Dialectical Frameworks solved with Binary Decision Diagrams<br />
|short description DE=Abstract Dialectical Frameworks mit Binary Decision Diagrammen lösen<br />
|contact persons=Stefan Ellmauthaler<br />
|contributors=Stefan Ellmauthaler; Dominik Rusovac; Lukas Gerlach<br />
|link=https://ellmau.github.io/adf-obdd/<br />
|publication date=2022/04/22<br />
|long description EN=Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) is a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD).<br />
Our system is based on the consideration that many otherwise hard to decide problems in ADF semantics (e. g., answering SAT-questions) can be solved in polynomial time on roBDDs. <br />
Our novel approach differs to the currently used systems, like the SAT-based approaches or the wide spectrum of answer set programming (ASP) focused approaches.<br />
ADF -BDD is written in RUST to provide good performance while enforcing a high amount of memory- and type-safety.<br />
In addition the rust-compiler produces highly optimised machine code, while keeping the whole tech stack simple.<br />
|long description DE=Abstract Dialectical Frameworks (ADF) sind eine Generalisierung von Dung Argumentation Frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) ist ein neuer Ansatz, welcher die Akzeptanzfunktionen eines ADF als reduziert geordnete binäre Entscheidungsdiagramme (reduced ordered binary decision diagrams - roBDD) übersetzt.<br />
Das tool basiert auf dem Konzept, dass einige - sonst schwer zu lösende - Entscheidungsprobleme bei der Berechnung der ADF-Semantiken in polynomieller Zeit von roBDDs gelöst werden können.<br />
Aktuelle state-of-the-art solver basieren derzeit auf SAT oder Antwortmengenprogrammierung basierten ansätzen, weshalb adf-bdd ein Alleinstellungsmerkmal besitzt.<br />
ADF-BDD ist in RUST geschrieben, welches gute Performanz und einen hohen Grad an Speicher- sowie Typ-sicherheit bietet.<br />
Zudem bietet der rust-compiler hochgradig optimierten Maschinencode, während der Techstack simple bleibt.<br />
|projekt=ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
|dataOrTool=Tool<br />
|Projektstatus=aktiv<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Nichtmonotones Schließen<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2108/en&diff=37706Aktivitaet2108/en2023-01-05T08:43:35Z<p>Stefan Ellmauthaler: Page created automatically by parser function on page Aktivitaet2108</p>
<hr />
<div>#REDIRECT [[Aktivitaet2108]]</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2108&diff=37705Aktivitaet21082023-01-05T08:43:35Z<p>Stefan Ellmauthaler: Die Seite wurde neu angelegt: „{{Aktivität |Beschreibung DE=Technical co-chair der 18. European Conference on Logics in Artificial Intelligence (JELIA 2023) in Dresden, Deutschland |Beschre…“</p>
<hr />
<div>{{Aktivität<br />
|Beschreibung DE=Technical co-chair der 18. European Conference on Logics in Artificial Intelligence (JELIA 2023) in Dresden, Deutschland<br />
|Beschreibung EN=Technical co-chair of the 18th European Conference on Logics in Artificial Intelligence (JELIA 2023) in Dresden, Germany<br />
|Person=Stefan Ellmauthaler<br />
|Start(Jahr)=2023<br />
|Ende(Jahr)=2023<br />
|Rank=★★★<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332&diff=37320Inproceedings33322022-10-12T07:42:08Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Representing Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=0<br />
|Year=2022<br />
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)<br />
|Pages=177-198<br />
|Publisher=Springer<br />
|Editor=G. Gottlob, D Inclezan, M. Maratea<br />
|Series=Lecture Notes in Computer Science<br />
|Volume=13416<br />
}}<br />
{{Publikation Tool<br />
|Tool=Adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics<br />
for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.<br />
|ISBN=978-3-031-15707-3<br />
|Download=manuscript lpnmr.pdf<br />
|Link=https://link.springer.com/chapter/10.1007/978-3-031-15707-3_14<br />
|DOI Name=10.1007/978-3-031-15707-3_14<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2106&diff=37255Aktivitaet21062022-10-04T15:00:51Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Aktivität<br />
|Beschreibung DE=Programmkomiteemitglied der 37. AAAI Conference on Artificial Intelligence 2023<br />
|Beschreibung EN=Program committee member of the 37th AAAI Conference on Artifical Intelligence 2023<br />
|Person=Stefan Ellmauthaler<br />
|URL=https://aaai.org/Conferences/AAAI-23/<br />
|Start(Jahr)=2022<br />
|Ende(Jahr)=2022<br />
|Rank=★★★<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2106/en&diff=37254Aktivitaet2106/en2022-10-04T14:59:23Z<p>Stefan Ellmauthaler: Page created automatically by parser function on page Aktivitaet2106</p>
<hr />
<div>#REDIRECT [[Aktivitaet2106]]</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2106&diff=37253Aktivitaet21062022-10-04T14:59:23Z<p>Stefan Ellmauthaler: Die Seite wurde neu angelegt: „{{Aktivität |Beschreibung DE=Programmkomiteemitglied der 37. AAAI Conference on Artificial Intelligence 2023 |Beschreibung EN=Program committee member of the…“</p>
<hr />
<div>{{Aktivität<br />
|Beschreibung DE=Programmkomiteemitglied der 37. AAAI Conference on Artificial Intelligence 2023<br />
|Beschreibung EN=Program committee member of the 37th AAAI Conference on Artifical Intelligence 2023<br />
|Person=Stefan Ellmauthaler<br />
|Start(Jahr)=2022<br />
|Ende(Jahr)=2022<br />
|Rank=★★★<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Stefan_Ellmauthaler&diff=37118Stefan Ellmauthaler2022-09-12T09:25:53Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Mitarbeiter<br />
|Vorname=Stefan<br />
|Nachname=Ellmauthaler<br />
|Akademischer Titel=Dr.<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
|Stellung=Wissenschaftlicher Mitarbeiter<br />
|Ehemaliger=0<br />
|Telefon=+49 351 463 38314<br />
|Email=stefan.ellmauthaler@tu-dresden.de<br />
|Matrix=@stel830c:tu-dresden.de<br />
|Raum=APB 3035<br />
|Sprechstunde Tag=Do<br />
|Sprechstunde Beginn=14:00<br />
|Sprechstunde Ende=15:00<br />
|Bild=stefan ellmauthaler 2.3.png<br />
|Info=Ich bin postdoktoraler wissenschaftlicher Mitarbeiter der [[Wissensbasierte Systeme]] Gruppe von Prof. Dr. [[Markus Krötzsch]]. Mein Bachelorstudium "medizinische Informatik" und mein Diplomingenieursstudium "Computational Intelligence" habe ich beide an der TU Wien in 2009 sowie 2012 abgeschlossen. 2018 verteidigte ich meine von Prof. Dr. Gerhard Brewka betreute Dissertation mit dem Titel "Multi-Content Reasoning in Cotinuous Data-Flow Environments" erfolgreich an der Universität Leipzig. <br />
<br />
Meine Forschungsinteressen liegen im Bereich Wissensrepräsentation, Logikprogrammierung, Regelbasiertem Schließen, Multi-Context Schließen, Nichtmonotones Schließen und Argumentationstheorie.<br />
|Info EN=I am a postdoctoral researcher in the [[Wissensbasierte Systeme/en|Knowledge-based Systems]] group of Prof. Dr. [[Markus Krötzsch]]. I received both, my B.Sc. in "Medicine and Computer Science" in 2009, as well as my diploma in "Computational Intelligence" in 2012, at the Vienna University of Technology. In 2018 I defended my doctoral thesis "Multi-Context Reasoning in Continuous Data-Flow Environments" which has been supervised by Prof. Dr. Gerhard Brewka at Leipzig University.<br />
<br />
My research interests are knowledge representation, logic programming, rule-based reasoning, multi-context reasoning, nonmonotonic reasoning, and (abstract) argumentation theory.<br />
|DBLP=https://dblp.org/pers/hd/e/Ellmauthaler:Stefan<br />
|Google Scholar=http://scholar.google.com/citations?user=HbZcv2EAAAAJ<br />
|Alternative URI=https://stefan.ellmauthaler.net<br />
|Publikationen anzeigen=1<br />
|Abschlussarbeiten anzeigen=1<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Answer Set Programming<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Existenzielle Regeln<br />
}}<br />
{{Forschungsgebiet Auswahl}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332&diff=36976Inproceedings33322022-08-29T08:26:00Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Representing Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)<br />
|Pages=177-198<br />
|Publisher=Springer<br />
|Editor=G. Gottlob, D Inclezan, M. Maratea<br />
|Series=Lecture Notes in Computer Science<br />
|Volume=13416<br />
}}<br />
{{Publikation Tool<br />
|Tool=Adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics<br />
for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.<br />
|ISBN=978-3-031-15707-3<br />
|Download=manuscript lpnmr.pdf<br />
|Link=https://link.springer.com/chapter/10.1007/978-3-031-15707-3_14<br />
|DOI Name=10.1007/978-3-031-15707-3_14<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Manuscript_lpnmr.pdf&diff=36975Datei:Manuscript lpnmr.pdf2022-08-29T08:25:54Z<p>Stefan Ellmauthaler: </p>
<hr />
<div></div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332&diff=36970Inproceedings33322022-08-26T13:30:48Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Representing Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)<br />
|Pages=177-198<br />
|Publisher=Springer<br />
|Editor=G. Gottlob, D Inclezan, M. Maratea<br />
|Series=Lecture Notes in Computer Science<br />
|Volume=13416<br />
}}<br />
{{Publikation Tool<br />
|Tool=Adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics<br />
for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.<br />
|ISBN=978-3-031-15707-3<br />
|Download=cr lpnmr.pdf<br />
|Link=https://link.springer.com/chapter/10.1007/978-3-031-15707-3_14<br />
|DOI Name=10.1007/978-3-031-15707-3_14<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332&diff=36969Inproceedings33322022-08-26T13:15:09Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Representing Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)<br />
|Publisher=Springer<br />
|Editor=G. Gottlob, D Inclezan, M. Maratea<br />
|Series=Lecture Notes in Computer Science<br />
|Volume=13416<br />
}}<br />
{{Publikation Tool<br />
|Tool=Adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics<br />
for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.<br />
|ISBN=978-3-031-15707-3<br />
|Download=cr lpnmr.pdf<br />
|Link=https://link.springer.com/chapter/10.1007/978-3-031-15707-3_14<br />
|DOI Name=10.1007/978-3-031-15707-3_14<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332&diff=36968Inproceedings33322022-08-26T13:14:11Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Representing Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)<br />
|Editor=G. Gottlob, D Inclezan, M. Maratea<br />
|Series=Lecture Notes in Computer Science<br />
|Volume=13416<br />
}}<br />
{{Publikation Tool<br />
|Tool=Adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics<br />
for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.<br />
|ISBN=978-3-031-15707-3<br />
|Download=cr lpnmr.pdf<br />
|Link=https://link.springer.com/chapter/10.1007/978-3-031-15707-3_14<br />
|DOI Name=10.1007/978-3-031-15707-3_14<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Adf-bdd&diff=36920Adf-bdd2022-08-08T09:16:45Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{DataOrTool<br />
|name=adf-bdd<br />
|short description EN=Abstract Dialectical Frameworks solved with Binary Decision Diagrams<br />
|short description DE=Abstract Dialectical Frameworks mit Binary Decision Diagrammen lösen<br />
|contact persons=Stefan Ellmauthaler<br />
|contributors=Stefan Ellmauthaler; Dominik Rusovac<br />
|link=https://ellmau.github.io/adf-obdd/<br />
|publication date=2022/04/22<br />
|long description EN=Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) is a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD).<br />
Our system is based on the consideration that many otherwise hard to decide problems in ADF semantics (e. g., answering SAT-questions) can be solved in polynomial time on roBDDs. <br />
Our novel approach differs to the currently used systems, like the SAT-based approaches or the wide spectrum of answer set programming (ASP) focused approaches.<br />
ADF -BDD is written in RUST to provide good performance while enforcing a high amount of memory- and type-safety.<br />
In addition the rust-compiler produces highly optimised machine code, while keeping the whole tech stack simple.<br />
|long description DE=Abstract Dialectical Frameworks (ADF) sind eine Generalisierung von Dung Argumentation Frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) ist ein neuer Ansatz, welcher die Akzeptanzfunktionen eines ADF als reduziert geordnete binäre Entscheidungsdiagramme (reduced ordered binary decision diagrams - roBDD) übersetzt.<br />
Das tool basiert auf dem Konzept, dass einige - sonst schwer zu lösende - Entscheidungsprobleme bei der Berechnung der ADF-Semantiken in polynomieller Zeit von roBDDs gelöst werden können.<br />
Aktuelle state-of-the-art solver basieren derzeit auf SAT oder Antwortmengenprogrammierung basierten ansätzen, weshalb adf-bdd ein Alleinstellungsmerkmal besitzt.<br />
ADF-BDD ist in RUST geschrieben, welches gute Performanz und einen hohen Grad an Speicher- sowie Typ-sicherheit bietet.<br />
Zudem bietet der rust-compiler hochgradig optimierten Maschinencode, während der Techstack simple bleibt.<br />
|projekt=ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
|dataOrTool=Tool<br />
|Projektstatus=aktiv<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Nichtmonotones Schließen<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Adf-bdd&diff=36919Adf-bdd2022-08-08T09:16:30Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{DataOrTool<br />
|name=adf-bdd<br />
|short description EN=Abstract Dialectical Frameworks solved with Binary Decision Diagrams<br />
|short description DE=Abstract Dialectical Frameworks mit Binary Decision Diagrammen lösen<br />
|contact persons=Stefan Ellmauthaler<br />
|contributors=Stefan Ellmauthaler; Dominik Rusovac<br />
|link=https://ellmau.github.io/adf-obdd/<br />
|publication date=2022/04/22<br />
|long description EN=Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) is a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD).<br />
Our system is based on the consideration that many otherwise hard to decide problems in ADF semantics (e. g., answering SAT-questions) can be solved in polynomial time on roBDDs. <br />
Our novel approach differs to the currently used systems, like the SAT-based approaches or the wide spectrum of answer set programming (ASP) focused approaches.<br />
ADF -BDD is written in RUST to provide good performance while enforcing a high amount of memory- and type-safety.<br />
In addition the rust-compiler produces highly optimised machine code, while keeping the whole tech stack simple.<br />
|long description DE=Abstract Dialectical Frameworks (ADF) sind eine Generalisierung von Dung Argumentation Frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) ist ein neuer Ansatz, welcher die Akzeptanzfunktionen eines ADF als reduziert geordnete binäre Entscheidungsdiagramme (reduced ordered binary decision diagrams - roBDD) übersetzt.<br />
Das tool basiert auf dem Konzept, dass einige - sonst schwer zu lösende - Entscheidungsprobleme bei der Berechnung der ADF-Semantiken in polynomieller Zeit von roBDDs gelöst werden können.<br />
Aktuelle state-of-the-art solver basieren derzeit auf SAT oder Antwortmengenprogrammierung basierten ansätzen, weshalb adf-bdd ein Alleinstellungsmerkmal besitzt.<br />
ADF-BDD ist in RUST geschrieben, welches gute Performanz und einen hohen Grad an Speicher- sowie Typ-sicherheit bietet.<br />
Zudem bietet der rust-compiler hochgradig optimierten Maschinencode, während der Techstack simple bleibt.<br />
|projekt=ScaDS.AI; Cfaed<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
|dataOrTool=Tool<br />
|Projektstatus=aktiv<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Nichtmonotones Schließen<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Adf-bdd&diff=36918Adf-bdd2022-08-08T09:13:22Z<p>Stefan Ellmauthaler: Fix translation mixup</p>
<hr />
<div>{{DataOrTool<br />
|name=adf-bdd<br />
|short description EN=Abstract Dialectical Frameworks solved with Binary Decision Diagrams<br />
|short description DE=Abstract Dialectical Frameworks mit Binary Decision Diagrammen lösen<br />
|contact persons=Stefan Ellmauthaler<br />
|contributors=Stefan Ellmauthaler; Dominik Rusovac<br />
|link=https://ellmau.github.io/adf-obdd/<br />
|publication date=2022/04/22<br />
|long description EN=Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) is a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD).<br />
Our system is based on the consideration that many otherwise hard to decide problems in ADF semantics (e. g., answering SAT-questions) can be solved in polynomial time on roBDDs. <br />
Our novel approach differs to the currently used systems, like the SAT-based approaches or the wide spectrum of answer set programming (ASP) focused approaches.<br />
ADF -BDD is written in RUST to provide good performance while enforcing a high amount of memory- and type-safety.<br />
In addition the rust-compiler produces highly optimised machine code, while keeping the whole tech stack simple.<br />
|long description DE=Abstract Dialectical Frameworks (ADF) sind eine Generalisierung von Dung Argumentation Frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) ist ein neuer Ansatz, welcher die Akzeptanzfunktionen eines ADF als reduziert geordnete binäre Entscheidungsdiagramme (reduced ordered binary decision diagrams - roBDD) übersetzt.<br />
Das tool basiert auf dem Konzept, dass einige - sonst schwer zu lösende - Entscheidungsprobleme bei der Berechnung der ADF-Semantiken in polynomieller Zeit von roBDDs gelöst werden können.<br />
Aktuelle state-of-the-art solver basieren derzeit auf SAT oder Antwortmengenprogrammierung basierten ansätzen, weshalb adf-bdd ein Alleinstellungsmerkmal besitzt.<br />
ADF-BDD ist in RUST geschrieben, welches gute Performanz und einen hohen Grad an Speicher- sowie Typ-sicherheit bietet.<br />
Zudem bietet der rust-compiler hochgradig optimierten Maschinencode, während der Techstack simple bleibt.<br />
|projekt=ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
|dataOrTool=Tool<br />
|Projektstatus=aktiv<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Nichtmonotones Schließen<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332&diff=36892Inproceedings33322022-08-04T11:27:42Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Representing Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)<br />
}}<br />
{{Publikation Tool<br />
|Tool=Adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics<br />
for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.<br />
|Download=cr lpnmr.pdf<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3333&diff=36891Inproceedings33332022-08-04T11:26:34Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=ADF - BDD : An ADF Solver Based on Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 9th International Conference on Computational Models of Argument (COMMA 2022)<br />
}}<br />
{{Publikation Tool<br />
|Tool=adf-bdd<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks [2]. Multiple approaches for reasoning under various semantics have been proposed over the last decade [3,4,5,6]. We present “Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” (ADF - BDD) a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD).<br />
|Download=cr comma.pdf<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Adf-bdd&diff=36890Adf-bdd2022-08-04T11:24:03Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{DataOrTool<br />
|name=adf-bdd<br />
|short description EN=Abstract Dialectical Frameworks solved with Binary Decision Diagrams<br />
|short description DE=Abstract Dialectical Frameworks mit Binary Decision Diagrammen lösen<br />
|contact persons=Stefan Ellmauthaler<br />
|contributors=Stefan Ellmauthaler; Dominik Rusovac<br />
|link=https://ellmau.github.io/adf-obdd/<br />
|publication date=2022/04/22<br />
|long description EN=Abstract Dialectical Frameworks (ADF) sind eine Generalisierung von Dung Argumentation Frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) is a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD).<br />
Our system is based on the consideration that many otherwise hard to decide problems in ADF semantics (e. g., answering SAT-questions) can be solved in polynomial time on roBDDs. <br />
Our novel approach differs to the currently used systems, like the SAT-based approaches or the wide spectrum of answer set programming (ASP) focused approaches.<br />
ADF -BDD is written in RUST to provide good performance while enforcing a high amount of memory- and type-safety.<br />
In addition the rust-compiler produces highly optimised machine code, while keeping the whole tech stack simple.<br />
|long description DE=Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) ist ein neuer Ansatz, welcher die Akzeptanzfunktionen eines ADF als reduziert geordnete binäre Entscheidungsdiagramme (reduced ordered binary decision diagrams - roBDD) übersetzt.<br />
Das tool basiert auf dem Konzept, dass einige - sonst schwer zu lösende - Entscheidungsprobleme bei der Berechnung der ADF-Semantiken in polynomieller Zeit von roBDDs gelöst werden können.<br />
Aktuelle state-of-the-art solver basieren derzeit auf SAT oder Antwortmengenprogrammierung basierten ansätzen, weshalb adf-bdd ein Alleinstellungsmerkmal besitzt.<br />
ADF-BDD ist in RUST geschrieben, welches gute Performanz und einen hohen Grad an Speicher- sowie Typ-sicherheit bietet.<br />
Zudem bietet der rust-compiler hochgradig optimierten Maschinencode, während der Techstack simple bleibt.<br />
|projekt=ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
|dataOrTool=Tool<br />
|Projektstatus=aktiv<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Nichtmonotones Schließen<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Adf-bdd/en&diff=36889Adf-bdd/en2022-08-04T11:23:20Z<p>Stefan Ellmauthaler: Page created automatically by parser function on page Adf-bdd</p>
<hr />
<div>{{DataOrTool/en}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Adf-bdd&diff=36888Adf-bdd2022-08-04T11:23:19Z<p>Stefan Ellmauthaler: Die Seite wurde neu angelegt: „{{DataOrTool |name=adf-bdd |short description EN=Abstract Dialectical Frameworks solved with Binary Decision Diagrams |short description DE=Abstract Dialectica…“</p>
<hr />
<div>{{DataOrTool<br />
|name=adf-bdd<br />
|short description EN=Abstract Dialectical Frameworks solved with Binary Decision Diagrams<br />
|short description DE=Abstract Dialectical Frameworks mit Binary Decision Diagrammen lösen<br />
|link=https://ellmau.github.io/adf-obdd/<br />
|publication date=2022/04/22<br />
|long description EN=Abstract Dialectical Frameworks (ADF) sind eine Generalisierung von Dung Argumentation Frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) is a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD).<br />
Our system is based on the consideration that many otherwise hard to decide problems in ADF semantics (e. g., answering SAT-questions) can be solved in polynomial time on roBDDs. <br />
Our novel approach differs to the currently used systems, like the SAT-based approaches or the wide spectrum of answer set programming (ASP) focused approaches.<br />
ADF -BDD is written in RUST to provide good performance while enforcing a high amount of memory- and type-safety.<br />
In addition the rust-compiler produces highly optimised machine code, while keeping the whole tech stack simple.<br />
|long description DE=Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks.<br />
“Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) ist ein neuer Ansatz, welcher die Akzeptanzfunktionen eines ADF als reduziert geordnete binäre Entscheidungsdiagramme (reduced ordered binary decision diagrams - roBDD) übersetzt.<br />
Das tool basiert auf dem Konzept, dass einige - sonst schwer zu lösende - Entscheidungsprobleme bei der Berechnung der ADF-Semantiken in polynomieller Zeit von roBDDs gelöst werden können.<br />
Aktuelle state-of-the-art solver basieren derzeit auf SAT oder Antwortmengenprogrammierung basierten ansätzen, weshalb adf-bdd ein Alleinstellungsmerkmal besitzt.<br />
ADF-BDD ist in RUST geschrieben, welches gute Performanz und einen hohen Grad an Speicher- sowie Typ-sicherheit bietet.<br />
Zudem bietet der rust-compiler hochgradig optimierten Maschinencode, während der Techstack simple bleibt.<br />
|projekt=ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
|dataOrTool=Tool<br />
|Projektstatus=aktiv<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Abstrakte Argumentation<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Nichtmonotones Schließen<br />
}}<br />
{{Forschungsgebiet Auswahl<br />
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3333&diff=36885Inproceedings33332022-08-01T15:52:33Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=ADF - BDD : An ADF Solver Based on Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 9th International Conference on Computational Models of Argument (COMMA 2022)<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks [2]. Multiple approaches for reasoning under various semantics have been proposed over the last decade [3,4,5,6]. We present “Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” (ADF - BDD) a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD).<br />
|Download=cr comma.pdf<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Cr_comma.pdf&diff=36884Datei:Cr comma.pdf2022-08-01T15:52:25Z<p>Stefan Ellmauthaler: </p>
<hr />
<div></div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332&diff=36873Inproceedings33322022-07-28T10:22:16Z<p>Stefan Ellmauthaler: Add paper</p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Representing Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics<br />
for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.<br />
|Download=cr lpnmr.pdf<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Cr_lpnmr.pdf&diff=36872Datei:Cr lpnmr.pdf2022-07-28T10:21:52Z<p>Stefan Ellmauthaler: </p>
<hr />
<div></div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332&diff=36771Inproceedings33322022-06-28T14:45:41Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Representing Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics<br />
for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3333/en&diff=36770Inproceedings3333/en2022-06-28T14:45:08Z<p>Stefan Ellmauthaler: Page created automatically by parser function on page Inproceedings3333</p>
<hr />
<div>#REDIRECT [[Inproceedings3333]]</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3333&diff=36769Inproceedings33332022-06-28T14:45:07Z<p>Stefan Ellmauthaler: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Stefan |ErsterAutorNachname=Ellmauthaler |FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner…“</p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=ADF - BDD : An ADF Solver Based on Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 9th International Conference on Computational Models of Argument (COMMA 2022)<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks [2]. Multiple approaches for reasoning under various semantics have been proposed over the last decade [3,4,5,6]. We present “Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” (ADF - BDD) a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD).<br />
|Projekt=CPEC, NAVAS, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332&diff=36768Inproceedings33322022-06-28T14:41:31Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Representing Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics<br />
for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.<br />
|Projekt=CPEC, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332/en&diff=36767Inproceedings3332/en2022-06-28T14:38:57Z<p>Stefan Ellmauthaler: Page created automatically by parser function on page Inproceedings3332</p>
<hr />
<div>#REDIRECT [[Inproceedings3332]]</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3332&diff=36766Inproceedings33322022-06-28T14:38:57Z<p>Stefan Ellmauthaler: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Stefan |ErsterAutorNachname=Ellmauthaler |FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner…“</p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Sarah Alice Gaggl; Dominik Rusovac; Johannes P. Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Representing Abstract Dialectical Frameworks with Binary Decision Diagrams<br />
|To appear=1<br />
|Year=2022<br />
|Booktitle=Proceedings of the 9th International Conference on Computational Models of Argument (COMMA 2022)<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics<br />
for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.<br />
|Projekt=CPEC, ScaDS.AI<br />
|Forschungsgruppe=Logische Programmierung und Argumentation, Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3267&diff=36434Inproceedings32672022-05-10T11:54:36Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Johannes Peter Wallner<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=Evaluating Abstract Dialectical Frameworks with ASP<br />
|To appear=0<br />
|Year=2012<br />
|Booktitle=4th International Conference on Computational Models of Argument (COMMA 2012)<br />
|Pages=505-506<br />
|Publisher=IOS Press<br />
|Editor=Bart Verheij, Stefan Szeider, Stefan Woltran<br />
|Series=Frontiers in Artificial Intelligence and Applications<br />
|Volume=245<br />
}}<br />
{{Publikation Details<br />
|Download=FAIA245-0505.pdf<br />
|DOI Name=10.3233/978-1-61499-111-3-505<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3265&diff=36433Inproceedings32652022-05-10T11:46:59Z<p>Stefan Ellmauthaler: </p>
<hr />
<div>{{Publikation Erster Autor<br />
|ErsterAutorVorname=Stefan<br />
|ErsterAutorNachname=Ellmauthaler<br />
|FurtherAuthors=Hannes Strass<br />
}}<br />
{{Inproceedings<br />
|Referiert=1<br />
|Title=The DIAMOND system for argumentation: Preliminary report<br />
|To appear=0<br />
|Year=2013<br />
|Month=September<br />
|Booktitle=Proceedings of the 6th International Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2013)<br />
|Publisher=CoRR<br />
|Editor=Michael Fink, Yuliya Lierler<br />
}}<br />
{{Publikation Details<br />
|Abstract=Abstract dialectical frameworks (ADFs) are a powerful generalisation of Dung's abstract argumentation frameworks. In this paper we present an answer set programming based software system, called DIAMOND (DIAlectical MOdels eNcoDing). It translates ADFs into answer set programs whose stable models correspond to models of the ADF with respect to several semantics (i.e. admissible, complete, stable, grounded).<br />
|Download=ASPOCP13-6.pdf<br />
|Link=https://arxiv.org/abs/1312.6140<br />
|DOI Name=10.48550/arXiv.1312.6140<br />
|Forschungsgruppe=Wissensbasierte Systeme<br />
}}</div>Stefan Ellmauthalerhttps://iccl.inf.tu-dresden.de/w/index.php?title=Aktivitaet2099/en&diff=36335Aktivitaet2099/en2022-04-29T13:17:37Z<p>Stefan Ellmauthaler: Page created automatically by parser function on page Aktivitaet2099</p>
<hr />
<div>#REDIRECT [[Aktivitaet2099]]</div>Stefan Ellmauthaler