Thema3421: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Sarah Gaggl (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Abschlussarbeit |Titel DE=Implementierung des Dekompositionsschemas für Abstract Dialectical Frameworks |Titel EN=Implementing the Decomposition Schema for…“) |
Sarah Gaggl (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 5: | Zeile 5: | ||
|Betreuer=Sarah Alice Gaggl | |Betreuer=Sarah Alice Gaggl | ||
|Forschungsgruppe=Computational Logic | |Forschungsgruppe=Computational Logic | ||
|Abschlussarbeitsstatus= | |Abschlussarbeitsstatus=Nicht mehr verfügbar | ||
|Beschreibung DE=Abstract Dialecital Frameworks (ADFs) are a generalization of Dungs AFs. As the computational complexity of the dedicated reasoning problems is in general higher than for AFs, a common approach is to decompose the framework into smaller subproblems and compose the solutions of the subproblems to an overall solution. The task of the project is to implement a system which computes the models of various semantics based on a given decomposition schema for ADFs. | |Beschreibung DE=Abstract Dialecital Frameworks (ADFs) are a generalization of Dungs AFs. As the computational complexity of the dedicated reasoning problems is in general higher than for AFs, a common approach is to decompose the framework into smaller subproblems and compose the solutions of the subproblems to an overall solution. The task of the project is to implement a system which computes the models of various semantics based on a given decomposition schema for ADFs. | ||
|Beschreibung EN=Abstract Dialecital Frameworks (ADFs) are a generalization of Dungs AFs. As the computational complexity of the dedicated reasoning problems is in general higher than for AFs, a common approach is to decompose the framework into smaller subproblems and compose the solutions of the subproblems to an overall solution. The task of the project is to implement a system which computes the models of various semantics based on a given decomposition schema for ADFs. | |Beschreibung EN=Abstract Dialecital Frameworks (ADFs) are a generalization of Dungs AFs. As the computational complexity of the dedicated reasoning problems is in general higher than for AFs, a common approach is to decompose the framework into smaller subproblems and compose the solutions of the subproblems to an overall solution. The task of the project is to implement a system which computes the models of various semantics based on a given decomposition schema for ADFs. | ||
}} | }} | ||
Aktuelle Version vom 19. April 2021, 10:25 Uhr
Implementierung des Dekompositionsschemas für Abstract Dialectical Frameworks
Thema nicht mehr verfügbar
- Betreuer Sarah Alice Gaggl
- Computational Logic
- Beginn
Abstract Dialecital Frameworks (ADFs) are a generalization of Dungs AFs. As the computational complexity of the dedicated reasoning problems is in general higher than for AFs, a common approach is to decompose the framework into smaller subproblems and compose the solutions of the subproblems to an overall solution. The task of the project is to implement a system which computes the models of various semantics based on a given decomposition schema for ADFs.
