International Center for Computational Logic - Benutzerbeiträge [de]

Inproceedings3439

2026-02-18T10:16:22Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Martin
|ErsterAutorNachname=Diller
|FurtherAuthors=Piotr Gorczyca
}}
{{Inproceedings
|Referiert=1
|Title=ABA Disputes in ASP: Advancing Argument Games through Multi-Shot Solving
|To appear=0
|Year=2025
|Month=November
|Booktitle=Proceedings of the 23rd International Workshop on Nonmonotonic Reasoning (NMR)
}}
{{Publikation Details
|Abstract=Argumentation games, which model reasoning as adversarial dialogue, offer intuitive and explainable mechanisms for decision-making in AI. However, their implementation has lagged behind inference-focused approaches, particularly in structured argumentation frameworks like assumption-based argumentation (ABA). This work presents, to our knowledge, the first application of multi-shot answer set programming (ASP) for implementing argument games, focusing on ABA dispute derivations. Leveraging a recent rule-based representation of ABA disputes, our method combines a declarative program with lightweight script-based control of multi-shot aspects, yielding a modular and adaptable system. We extend this core approach to support alternative games and show how it can also be used to implement argument games for Dung’s abstract argumentation formalism. Empirical results show that our implementation outperforms existing ABA dispute systems. We also introduce an approximate variant that further improves efficiency – reaching the level of the best current inference-focused ABA system – while maintaining perfect specificity (i.e. true negative rate), demonstrating the practical value of multi-shot ASP, particularly in interactive settings where explainability is key.
|Download=Nmr-diller-gorczyca2.pdf
|Projekt=KIMEDS, MEDGE, SEMECO-Q2
|Forschungsgruppe=Computational Logic, Logische Programmierung und Argumentation
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}

Inproceedings3450

2026-02-02T10:31:38Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Piotr
|ErsterAutorNachname=Gorczyca
|FurtherAuthors=Hannes Straß
}}
{{Inproceedings
|Referiert=1
|Title=Non-Monotonic S4F Standpoint Logic
|To appear=0
|Year=2026
|Month=Januar
|Booktitle=Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26)
}}
{{Publikation Details
|Abstract=Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics — in particular using the modal logic S4F.
In this work, we propose a novel formalism called S4F Standpoint Logic, which generalises both S4F and propositional standpoint logic and is therefore capable of expressing multi-viewpoint, non-monotonic semantic commitments. We define its syntax and semantics and analyze its computational complexity, obtaining the result that S4F Standpoint Logic is not computationally harder than its constituent logics, whether in monotonic or non-monotonic form. We also outline mechanisms for credulous and sceptical acceptance and illustrate the framework with an example.
|Download=Gorczyca-strass2025non-monotonic-s4f-standpoint-logic.pdf
|Slides=Gorczyca-strass-aaai-2026.pdf
|Projekt=KIMEDS, MEDGE, SECAI, SEMECO-Q2
|Forschungsgruppe=Computational Logic
}}
Access the live presentation at https://cl-tud.github.io/talks/2026/aaai/non-mon-s4f-standpoint-logic

Datei:Gorczyca-strass-aaai-2026.pdf

2026-02-02T09:39:07Z

Piotr Gorczyca:

Inproceedings3440

2025-12-17T10:57:26Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Martin
|ErsterAutorNachname=Diller
|FurtherAuthors=Piotr Gorczyca
}}
{{Inproceedings
|Referiert=1
|Title=ABA Disputes in ASP: Advancing Argument Games through Multi-Shot Solving
|To appear=0
|Year=2025
|Month=Dezember
|Booktitle=Proceedings of the 26th International Conference on Principles and Practice of Multi-Agent Systems
}}
{{Publikation Details
|Abstract=Argumentation games, which model reasoning as adversarial dialogue, offer intuitive and explainable mechanisms for decision-making in AI. However, their implementation has lagged behind inference-focused approaches, particularly in structured argumentation frameworks like assumption-based argumentation (ABA). This work presents, to our knowledge, the first application of multi-shot answer set programming (ASP) for implementing argument games, focusing on ABA dispute derivations. Leveraging a recent rule-based representation of ABA disputes, our method combines a declarative program with lightweight script-based control of multi-shot aspects, yielding a modular and adaptable system. We extend this core approach to support alternative games and show how it can also be used to implement argument games for Dung's abstract argumentation formalism. Empirical results show that our implementation outperforms existing ABA dispute systems.
We also introduce an approximate variant that further improves efficiency — reaching the level of the best current inference-focused ABA system — while maintaining perfect specificity (i.e. true negative rate), demonstrating the practical value of multi-shot ASP, particularly in interactive settings where explainability is key.
|Download=diller-gorczyca2025aba-disputes-in-asp.pdf
|Slides=Diller-gorczyca-aba-disputes-in-asp-prima2025-slides.pdf
|Projekt=KIMEDS, SEMECO-Q2
|Forschungsgruppe=Computational Logic, Logische Programmierung und Argumentation
}}
Access the live presentation at https://cl-tud.github.io/talks/2025/prima/aba-disputes-in-asp/

Inproceedings3440

2025-12-17T10:56:10Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Martin
|ErsterAutorNachname=Diller
|FurtherAuthors=Piotr Gorczyca
}}
{{Inproceedings
|Referiert=1
|Title=ABA Disputes in ASP: Advancing Argument Games through Multi-Shot Solving
|To appear=0
|Year=2025
|Month=Dezember
|Booktitle=Proceedings of the 26th International Conference on Principles and Practice of Multi-Agent Systems
}}
{{Publikation Details
|Abstract=Argumentation games, which model reasoning as adversarial dialogue, offer intuitive and explainable mechanisms for decision-making in AI. However, their implementation has lagged behind inference-focused approaches, particularly in structured argumentation frameworks like assumption-based argumentation (ABA). This work presents, to our knowledge, the first application of multi-shot answer set programming (ASP) for implementing argument games, focusing on ABA dispute derivations. Leveraging a recent rule-based representation of ABA disputes, our method combines a declarative program with lightweight script-based control of multi-shot aspects, yielding a modular and adaptable system. We extend this core approach to support alternative games and show how it can also be used to implement argument games for Dung's abstract argumentation formalism. Empirical results show that our implementation outperforms existing ABA dispute systems.
We also introduce an approximate variant that further improves efficiency — reaching the level of the best current inference-focused ABA system — while maintaining perfect specificity (i.e. true negative rate), demonstrating the practical value of multi-shot ASP, particularly in interactive settings where explainability is key.
|Download=diller-gorczyca2025aba-disputes-in-asp.pdf
|Slides=Diller-gorczyca-aba-disputes-in-asp-prima2025-slides.pdf
|Link=https://cl-tud.github.io/talks/2025/prima/aba-disputes-in-asp/
|Projekt=KIMEDS, SEMECO-Q2
|Forschungsgruppe=Computational Logic, Logische Programmierung und Argumentation
}}
Access the live presentation at https://cl-tud.github.io/talks/2025/prima/aba-disputes-in-asp/

Inproceedings3440

2025-12-17T10:55:26Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Martin
|ErsterAutorNachname=Diller
|FurtherAuthors=Piotr Gorczyca
}}
{{Inproceedings
|Referiert=1
|Title=ABA Disputes in ASP: Advancing Argument Games through Multi-Shot Solving
|To appear=0
|Year=2025
|Month=Dezember
|Booktitle=Proceedings of the 26th International Conference on Principles and Practice of Multi-Agent Systems
}}
{{Publikation Details
|Abstract=Argumentation games, which model reasoning as adversarial dialogue, offer intuitive and explainable mechanisms for decision-making in AI. However, their implementation has lagged behind inference-focused approaches, particularly in structured argumentation frameworks like assumption-based argumentation (ABA). This work presents, to our knowledge, the first application of multi-shot answer set programming (ASP) for implementing argument games, focusing on ABA dispute derivations. Leveraging a recent rule-based representation of ABA disputes, our method combines a declarative program with lightweight script-based control of multi-shot aspects, yielding a modular and adaptable system. We extend this core approach to support alternative games and show how it can also be used to implement argument games for Dung's abstract argumentation formalism. Empirical results show that our implementation outperforms existing ABA dispute systems.
We also introduce an approximate variant that further improves efficiency — reaching the level of the best current inference-focused ABA system — while maintaining perfect specificity (i.e. true negative rate), demonstrating the practical value of multi-shot ASP, particularly in interactive settings where explainability is key.
|Download=diller-gorczyca2025aba-disputes-in-asp.pdf
|Slides=Diller-gorczyca-aba-disputes-in-asp-prima2025-slides.pdf
|Link=Live presentation: https://cl-tud.github.io/talks/2025/prima/aba-disputes-in-asp/
|Projekt=KIMEDS, SEMECO-Q2
|Forschungsgruppe=Computational Logic, Logische Programmierung und Argumentation
}}
Access the live presentation at https://cl-tud.github.io/talks/2025/prima/aba-disputes-in-asp/

Inproceedings3440

2025-12-17T10:54:22Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Martin
|ErsterAutorNachname=Diller
|FurtherAuthors=Piotr Gorczyca
}}
{{Inproceedings
|Referiert=1
|Title=ABA Disputes in ASP: Advancing Argument Games through Multi-Shot Solving
|To appear=0
|Year=2025
|Month=Dezember
|Booktitle=Proceedings of the 26th International Conference on Principles and Practice of Multi-Agent Systems
}}
{{Publikation Details
|Abstract=Argumentation games, which model reasoning as adversarial dialogue, offer intuitive and explainable mechanisms for decision-making in AI. However, their implementation has lagged behind inference-focused approaches, particularly in structured argumentation frameworks like assumption-based argumentation (ABA). This work presents, to our knowledge, the first application of multi-shot answer set programming (ASP) for implementing argument games, focusing on ABA dispute derivations. Leveraging a recent rule-based representation of ABA disputes, our method combines a declarative program with lightweight script-based control of multi-shot aspects, yielding a modular and adaptable system. We extend this core approach to support alternative games and show how it can also be used to implement argument games for Dung's abstract argumentation formalism. Empirical results show that our implementation outperforms existing ABA dispute systems.
We also introduce an approximate variant that further improves efficiency — reaching the level of the best current inference-focused ABA system — while maintaining perfect specificity (i.e. true negative rate), demonstrating the practical value of multi-shot ASP, particularly in interactive settings where explainability is key.
|Download=diller-gorczyca2025aba-disputes-in-asp.pdf
|Slides=Diller-gorczyca-aba-disputes-in-asp-prima2025-slides.pdf
|Projekt=KIMEDS, SEMECO-Q2
|Forschungsgruppe=Computational Logic, Logische Programmierung und Argumentation
}}
Access the live presentation at https://cl-tud.github.io/talks/2025/prima/aba-disputes-in-asp/

Inproceedings3440

2025-12-17T10:23:08Z

Piotr Gorczyca:

Datei:Diller-gorczyca-aba-disputes-in-asp-prima2025-slides.pdf

2025-12-17T10:23:04Z

Piotr Gorczyca:

Inproceedings3440

2025-12-17T10:17:09Z

Piotr Gorczyca:

Datei:Diller-gorczyca2025aba-disputes-in-asp.pdf

2025-12-17T10:16:58Z

Piotr Gorczyca:

Inproceedings3450

2025-11-25T10:15:38Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Piotr
|ErsterAutorNachname=Gorczyca
|FurtherAuthors=Hannes Straß
}}
{{Inproceedings
|Referiert=1
|Title=Non-Monotonic S4F Standpoint Logic
|To appear=1
|Year=2025
|Month=Januar
|Booktitle=Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26)
}}
{{Publikation Details
|Abstract=Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics — in particular using the modal logic S4F.
In this work, we propose a novel formalism called S4F Standpoint Logic, which generalises both S4F and propositional standpoint logic and is therefore capable of expressing multi-viewpoint, non-monotonic semantic commitments. We define its syntax and semantics and analyze its computational complexity, obtaining the result that S4F Standpoint Logic is not computationally harder than its constituent logics, whether in monotonic or non-monotonic form. We also outline mechanisms for credulous and sceptical acceptance and illustrate the framework with an example.
|Download=Gorczyca-strass2025non-monotonic-s4f-standpoint-logic.pdf
|Projekt=KIMEDS, MEDGE, SECAI, SEMECO-Q2
|Forschungsgruppe=Computational Logic
}}

Datei:Gorczyca-strass2025non-monotonic-s4f-standpoint-logic.pdf

2025-11-25T10:11:04Z

Piotr Gorczyca:

Inproceedings3450

2025-11-24T12:56:23Z

Piotr Gorczyca: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Piotr |ErsterAutorNachname=Gorczyca |FurtherAuthors=Hannes Straß }} {{Inproceedings |Referiert=1 |Title=Non-Monotonic S4F Standpoint Logic |To appear=1 |Year=2025 |Month=Januar |Booktitle=Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26) }} {{Publikation Details |Abstract=Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous vie…“

{{Publikation Erster Autor
|ErsterAutorVorname=Piotr
|ErsterAutorNachname=Gorczyca
|FurtherAuthors=Hannes Straß
}}
{{Inproceedings
|Referiert=1
|Title=Non-Monotonic S4F Standpoint Logic
|To appear=1
|Year=2025
|Month=Januar
|Booktitle=Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26)
}}
{{Publikation Details
|Abstract=Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics — in particular using the modal logic S4F.
In this work, we propose a novel formalism called S4F Standpoint Logic, which generalises both S4F and propositional standpoint logic and is therefore capable of expressing multi-viewpoint, non-monotonic semantic commitments. We define its syntax and semantics and analyze its computational complexity, obtaining the result that S4F Standpoint Logic is not computationally harder than its constituent logics, whether in monotonic or non-monotonic form. We also outline mechanisms for credulous and sceptical acceptance and illustrate the framework with an example.
|Download=Single.pdf
|Projekt=KIMEDS, MEDGE, SECAI, SEMECO-Q2
|Forschungsgruppe=Computational Logic
}}

Datei:Single.pdf

2025-11-24T12:51:29Z

Piotr Gorczyca:

Inproceedings3424

2025-09-04T15:17:24Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Piotr
|ErsterAutorNachname=Gorczyca
|FurtherAuthors=Dörthe Arndt; Martin Diller; Jochen Hampe; Georg Heidenreich; Pascal Kettmann; Markus Krötzsch; Stephan Mennicke; Sebastian Rudolph; Hannes Straß
}}
{{Inproceedings
|Referiert=1
|Title=Supporting Risk Management for Medical Devices via the Riskman Ontology and Shapes
|To appear=1
|Year=2025
|Month=September
|Booktitle=Proceedings of the 21st International Conference on Semantic Systems (SEMANTiCS 2025)
}}
{{Publikation Details
|Abstract=We propose the Riskman ontology and shapes for representing and analysing information about risk management for medical devices.
Risk management is concerned with taking necessary precautions to ensure that a medical device does not cause harms for users or the environment. To date, risk management documentation is submitted to notified bodies (for certification) in the form of semi-structured natural language text. We propose to use terms from the Riskman ontology to provide a formal, logical underpinning for risk management documentation, and to use the included SHACL constraints to check whether the provided data is in accordance with the requirements of the two relevant norms, i.e. ISO 14971 and VDE Spec 90025.
|Download=Gorczyca-et-al2025supporting-risk-management-for-medical-devices-via-the-riskman-ontology-and-shapes.pdf
|Slides=Gorczyca-riskman-slides.pdf
|Projekt=KIMEDS, MEDGE, SEMECO-Q2
|Forschungsgruppe=Computational Logic, Wissensbasierte Systeme
}}
Access the live presentation at https://gorczyca.github.io/semantics-25-slides/

Datei:Gorczyca-riskman-slides.pdf

2025-09-04T15:17:18Z

Piotr Gorczyca:

Piotr Gorczyca

2025-08-18T11:23:33Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=APB 2039
|Bild=Pg-cropped.jpg
|Info=I joined the [https://iccl.inf.tu-dresden.de/web/Computational_Logic Computational Logic] group in September 2022 as a research associate within the [https://iccl.inf.tu-dresden.de/web/KIMEDS/en KIMEDS] project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related to answer set programming and assumption-based argumentation in the [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] group.
|Info EN=I joined the [https://iccl.inf.tu-dresden.de/web/Computational_Logic Computational Logic] group in September 2022 as a research associate within the [https://iccl.inf.tu-dresden.de/web/KIMEDS/en KIMEDS] project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related to answer set programming and assumption-based argumentation in the [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] group.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
|Projekte anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Piotr Gorczyca

2025-08-18T11:18:55Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=APB 2039
|Bild=Pgorczyca photo.jpg
|Info=I joined the [https://iccl.inf.tu-dresden.de/web/Computational_Logic Computational Logic] group in September 2022 as a research associate within the [https://iccl.inf.tu-dresden.de/web/KIMEDS/en KIMEDS] project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related to answer set programming and assumption-based argumentation in the [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] group.
|Info EN=I joined the [https://iccl.inf.tu-dresden.de/web/Computational_Logic Computational Logic] group in September 2022 as a research associate within the [https://iccl.inf.tu-dresden.de/web/KIMEDS/en KIMEDS] project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related to answer set programming and assumption-based argumentation in the [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] group.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
|Projekte anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Datei:Pg-cropped.jpg

2025-08-18T11:17:20Z

Piotr Gorczyca:

Inproceedings3400

2025-08-16T12:26:27Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Piotr
|ErsterAutorNachname=Gorczyca
|FurtherAuthors=Hannes Straß
}}
{{Inproceedings
|Referiert=1
|Title=Adding Standpoint Modalities to Non-Monotonic S4F: Preliminary Results
|To appear=0
|Year=2024
|Month=November
|Booktitle=Proceedings of the 22nd International Workshop on Non-Monotonic Reasoning
|Editor=Nina Gierasimczuk, Jesse Heyninck
}}
{{Publikation Details
|Abstract=Standpoint logics allow to represent multiple heterogeneous viewpoints in a unifying framework based on modal logic. We propose to combine standpoint modalities with the single modality of the non-monotonic modal logic S4F, thus defining standpoint S4F. The resulting language allows to express semantic commitments based on default reasoning. We define syntax and semantics of the logic, study the computational complexity of reasoning problems in the fragment of simple theories, and showcase standpoint S4F by exemplifying two concrete instantiations of the general language — standpoint default logic and standpoint argumentation frameworks.
|Download=Nmr-13-submission-camera-ready.pdf
|Slides=standpointssf.pdf
|Projekt=KIMEDS, MEDGE, SEMECO-Q2
|Forschungsgruppe=Computational Logic
}}

Inproceedings3424

2025-08-16T12:25:41Z

Piotr Gorczyca: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Piotr |ErsterAutorNachname=Gorczyca |FurtherAuthors=Dörthe Arndt; Martin Diller; Jochen Hampe; Georg Heidenreich; Pascal Kettmann; Markus Krötzsch; Stephan Mennicke; Sebastian Rudolph; Hannes Straß }} {{Inproceedings |Referiert=1 |Title=Supporting Risk Management for Medical Devices via the Riskman Ontology and Shapes |To appear=1 |Year=2025 |Month=September |Booktitle=Proceedings of the 21st International…“

{{Publikation Erster Autor
|ErsterAutorVorname=Piotr
|ErsterAutorNachname=Gorczyca
|FurtherAuthors=Dörthe Arndt; Martin Diller; Jochen Hampe; Georg Heidenreich; Pascal Kettmann; Markus Krötzsch; Stephan Mennicke; Sebastian Rudolph; Hannes Straß
}}
{{Inproceedings
|Referiert=1
|Title=Supporting Risk Management for Medical Devices via the Riskman Ontology and Shapes
|To appear=1
|Year=2025
|Month=September
|Booktitle=Proceedings of the 21st International Conference on Semantic Systems (SEMANTiCS 2025)
}}
{{Publikation Details
|Abstract=We propose the Riskman ontology and shapes for representing and analysing information about risk management for medical devices.
Risk management is concerned with taking necessary precautions to ensure that a medical device does not cause harms for users or the environment. To date, risk management documentation is submitted to notified bodies (for certification) in the form of semi-structured natural language text. We propose to use terms from the Riskman ontology to provide a formal, logical underpinning for risk management documentation, and to use the included SHACL constraints to check whether the provided data is in accordance with the requirements of the two relevant norms, i.e. ISO 14971 and VDE Spec 90025.
|Download=Gorczyca-et-al2025supporting-risk-management-for-medical-devices-via-the-riskman-ontology-and-shapes.pdf
|Projekt=KIMEDS, MEDGE, SEMECO-Q2
|Forschungsgruppe=Computational Logic, Wissensbasierte Systeme
}}

Datei:Gorczyca-et-al2025supporting-risk-management-for-medical-devices-via-the-riskman-ontology-and-shapes.pdf

2025-08-16T12:24:29Z

Piotr Gorczyca:

Inproceedings3400

2024-11-07T05:15:46Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Piotr
|ErsterAutorNachname=Gorczyca
|FurtherAuthors=Hannes Straß
}}
{{Inproceedings
|Referiert=1
|Title=Adding Standpoint Modalities to Non-Monotonic S4F: Preliminary Results
|To appear=1
|Year=2024
|Month=November
|Booktitle=Proceedings of the 22nd International Workshop on Non-Monotonic Reasoning
|Editor=Nina Gierasimczuk, Jesse Heyninck
}}
{{Publikation Details
|Abstract=Standpoint logics allow to represent multiple heterogeneous viewpoints in a unifying framework based on modal logic. We propose to combine standpoint modalities with the single modality of the non-monotonic modal logic S4F, thus defining standpoint S4F. The resulting language allows to express semantic commitments based on default reasoning. We define syntax and semantics of the logic, study the computational complexity of reasoning problems in the fragment of simple theories, and showcase standpoint S4F by exemplifying two concrete instantiations of the general language — standpoint default logic and standpoint argumentation frameworks.
|Download=Nmr-13-submission-camera-ready.pdf
|Slides=standpointssf.pdf
|Projekt=KIMEDS, MEDGE, SEMECO-Q2
|Forschungsgruppe=Computational Logic
}}

Datei:Standpointssf.pdf

2024-11-07T05:15:42Z

Piotr Gorczyca:

Inproceedings3337

2024-11-07T05:13:44Z

Piotr Gorczyca:

{{Publikation Erster Autor
|ErsterAutorVorname=Ridhwan
|ErsterAutorNachname=Dewoprabowo
|FurtherAuthors=Johannes Klaus Fichte; Piotr Gorczyca; Markus Hecher
}}
{{Inproceedings
|Referiert=1
|Title=A Practical Account into Counting Dung’s Extensions by Dynamic Programming
|To appear=0
|Year=2022
|Booktitle=Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)
|Pages=387-400
|Publisher=Springer
|Editor=Georg Gottlob, Daniela Inclezan, Marco Maratea
|Series=Lecture Notes in Computer Science
|Volume=13416
}}
{{Publikation Details
|Slides=Dpdb argu LPNMR 2022.pdf
|Link=https://doi.org/10.1007/978-3-031-15707-3\_30
|DOI Name=10.1007/978-3-031-15707-3\_30
|Projekt=CPEC, NAVAS
|Forschungsgruppe=Computational Logic, Logische Programmierung und Argumentation
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Datei:Dpdb argu LPNMR 2022.pdf

2024-11-07T05:13:38Z

Piotr Gorczyca:

Inproceedings3400/en

2024-10-11T08:43:52Z

Piotr Gorczyca: Page created automatically by parser function on page Inproceedings3400

#REDIRECT [[Inproceedings3400]]

Inproceedings3400

2024-10-11T08:43:52Z

Piotr Gorczyca: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Piotr |ErsterAutorNachname=Gorczyca |FurtherAuthors=Hannes Straß }} {{Inproceedings |Referiert=1 |Title=Adding Standpoint Modalities to Non-Monotonic S4F: Preliminary Results |To appear=1 |Year=2024 |Month=November |Booktitle=Proceedings of the 22nd International Workshop on Non-Monotonic Reasoning |Editor=Nina Gierasimczuk, Jesse Heyninck }} {{Publikation Details |Abstract=Standpoint logics allow to represe…“

{{Publikation Erster Autor
|ErsterAutorVorname=Piotr
|ErsterAutorNachname=Gorczyca
|FurtherAuthors=Hannes Straß
}}
{{Inproceedings
|Referiert=1
|Title=Adding Standpoint Modalities to Non-Monotonic S4F: Preliminary Results
|To appear=1
|Year=2024
|Month=November
|Booktitle=Proceedings of the 22nd International Workshop on Non-Monotonic Reasoning
|Editor=Nina Gierasimczuk, Jesse Heyninck
}}
{{Publikation Details
|Abstract=Standpoint logics allow to represent multiple heterogeneous viewpoints in a unifying framework based on modal logic. We propose to combine standpoint modalities with the single modality of the non-monotonic modal logic S4F, thus defining standpoint S4F. The resulting language allows to express semantic commitments based on default reasoning. We define syntax and semantics of the logic, study the computational complexity of reasoning problems in the fragment of simple theories, and showcase standpoint S4F by exemplifying two concrete instantiations of the general language — standpoint default logic and standpoint argumentation frameworks.
|Download=Nmr-13-submission-camera-ready.pdf
|Projekt=KIMEDS, MEDGE
|Forschungsgruppe=Computational Logic
}}

Datei:Nmr-13-submission-camera-ready.pdf

2024-10-11T08:38:59Z

Piotr Gorczyca:

APB 2039/en

2023-01-20T13:42:46Z

Piotr Gorczyca: Page created automatically by parser function on page APB 2039

APB 2039

2023-01-20T13:42:46Z

Piotr Gorczyca: Die Seite wurde neu angelegt: „{{Raum}}“

Piotr Gorczyca

2023-01-20T13:35:56Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=APB 2039
|Bild=Pgorczyca photo.jpg
|Info=I joined the [https://iccl.inf.tu-dresden.de/web/Computational_Logic Computational Logic] group in September 2022 as a research associate within the [https://iccl.inf.tu-dresden.de/web/KIMEDS/en KIMEDS] project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related to answer set programming and assumption-based argumentation in the [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] group.
|Info EN=I joined the [https://iccl.inf.tu-dresden.de/web/Computational_Logic Computational Logic] group in September 2022 as a research associate within the [https://iccl.inf.tu-dresden.de/web/KIMEDS/en KIMEDS] project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related to answer set programming and assumption-based argumentation in the [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] group.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Piotr Gorczyca

2023-01-20T13:33:51Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=APB 2039
|Bild=Pgorczyca photo.jpg
|Info=I joined the [https://iccl.inf.tu-dresden.de/web/Computational_Logic Computational Logic] group in September 2022 as a research associate within the [https://iccl.inf.tu-dresden.de/web/KIMEDS/en KIMEDS] project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related answer set programming and assumption-based argumentation in the [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] group.
|Info EN=I joined the [https://iccl.inf.tu-dresden.de/web/Computational_Logic Computational Logic] group in September 2022 as a research associate within the [https://iccl.inf.tu-dresden.de/web/KIMEDS/en KIMEDS] project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related answer set programming and assumption-based argumentation in the [https://iccl.inf.tu-dresden.de/web/Logische_Programmierung_und_Argumentation Logic Programming and Argumentation] group.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Piotr Gorczyca

2023-01-20T13:28:02Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=APB 2039
|Bild=Pgorczyca photo.jpg
|Info=I joined the Computational Logic group in September 2022 as a research associate within the KIMEDS project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related answer set programming and assumption-based argumentation in the Logic Programming and Argumentation group.
|Info EN=I joined the Computational Logic group in September 2022 as a research associate within the KIMEDS project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related answer set programming and assumption-based argumentation in the Logic Programming and Argumentation group.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Piotr Gorczyca

2023-01-20T13:25:18Z

Piotr Gorczyca:

Piotr Gorczyca

2023-01-20T13:22:50Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=APB 2039
|Bild=Pgorczyca photo.jpg
|Info=I joined the Computational Logic group in September 2022 as a research associate within the KIMEDS project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related answer set programming and assumption-based argumentation in the Logic Programming and Argumentation group.
|Info EN=I joined the Computational Logic group in September 2022 as a research associate within the KIMEDS project and a PhD student.

Prior to that, I completed my master's degree in Computational Logic at the TU Dresden where I simultaneously worked as a student assistant on topics related answer set programming and assumption-based argumentation in the Logic Programming and Argumentation group.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Piotr Gorczyca

2023-01-20T13:12:28Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=APB 2039
|Bild=Pgorczyca photo.jpg
|Info=Piotr Gorczyca arbeitet in der Gruppe Logische Programmierung und Argumentation im Sonderforschungsbereich 248 '''Grundlagen verständlicher Softwaresysteme''' ([[CPEC|Center for Perspicuous Computing, CPEC]]), Teilprojekt E3 an der Entwicklung eines Systems für Dispute Derivations von Assumption-based Argumentation Frameworks.
|Info EN=Piotr Gorczyca develops a system for dispute derivations of Assumption-based Argumentation Frameworks at the logic programming and argumentation group, within the Transregional Collaborative Research Centre 248 [[CPEC |Center for Perspicuous Computing (CPEC)]]. The software will be used for further research related to Answer Set Programming.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Piotr Gorczyca

2023-01-20T13:12:15Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=APB 2036
|Bild=Pgorczyca photo.jpg
|Info=Piotr Gorczyca arbeitet in der Gruppe Logische Programmierung und Argumentation im Sonderforschungsbereich 248 '''Grundlagen verständlicher Softwaresysteme''' ([[CPEC|Center for Perspicuous Computing, CPEC]]), Teilprojekt E3 an der Entwicklung eines Systems für Dispute Derivations von Assumption-based Argumentation Frameworks.
|Info EN=Piotr Gorczyca develops a system for dispute derivations of Assumption-based Argumentation Frameworks at the logic programming and argumentation group, within the Transregional Collaborative Research Centre 248 [[CPEC |Center for Perspicuous Computing (CPEC)]]. The software will be used for further research related to Answer Set Programming.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Piotr Gorczyca

2023-01-20T13:11:43Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=APB_2039
|Bild=Pgorczyca photo.jpg
|Info=Piotr Gorczyca arbeitet in der Gruppe Logische Programmierung und Argumentation im Sonderforschungsbereich 248 '''Grundlagen verständlicher Softwaresysteme''' ([[CPEC|Center for Perspicuous Computing, CPEC]]), Teilprojekt E3 an der Entwicklung eines Systems für Dispute Derivations von Assumption-based Argumentation Frameworks.
|Info EN=Piotr Gorczyca develops a system for dispute derivations of Assumption-based Argumentation Frameworks at the logic programming and argumentation group, within the Transregional Collaborative Research Centre 248 [[CPEC |Center for Perspicuous Computing (CPEC)]]. The software will be used for further research related to Answer Set Programming.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Piotr Gorczyca

2023-01-20T13:09:29Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=APB 2039
|Bild=Pgorczyca photo.jpg
|Info=Piotr Gorczyca arbeitet in der Gruppe Logische Programmierung und Argumentation im Sonderforschungsbereich 248 '''Grundlagen verständlicher Softwaresysteme''' ([[CPEC|Center for Perspicuous Computing, CPEC]]), Teilprojekt E3 an der Entwicklung eines Systems für Dispute Derivations von Assumption-based Argumentation Frameworks.
|Info EN=Piotr Gorczyca develops a system for dispute derivations of Assumption-based Argumentation Frameworks at the logic programming and argumentation group, within the Transregional Collaborative Research Centre 248 [[CPEC |Center for Perspicuous Computing (CPEC)]]. The software will be used for further research related to Answer Set Programming.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}

Piotr Gorczyca

2023-01-20T13:07:38Z

Piotr Gorczyca:

{{Mitarbeiter
|Vorname=Piotr
|Nachname=Gorczyca
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Telefon=+49 351 463 43549
|Email=piotr.gorczyca@tu-dresden.de
|Matrix=@pigo271b:tu-dresden.de
|Raum=2039
|Bild=Pgorczyca photo.jpg
|Info=Piotr Gorczyca arbeitet in der Gruppe Logische Programmierung und Argumentation im Sonderforschungsbereich 248 '''Grundlagen verständlicher Softwaresysteme''' ([[CPEC|Center for Perspicuous Computing, CPEC]]), Teilprojekt E3 an der Entwicklung eines Systems für Dispute Derivations von Assumption-based Argumentation Frameworks.
|Info EN=Piotr Gorczyca develops a system for dispute derivations of Assumption-based Argumentation Frameworks at the logic programming and argumentation group, within the Transregional Collaborative Research Centre 248 [[CPEC |Center for Perspicuous Computing (CPEC)]]. The software will be used for further research related to Answer Set Programming.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Abstrakte Argumentation
}}