Claudia Schulz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Claudia Schulz has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Jorge Fandinno
University of Nebraska Omaha
1 shared publication - Martin Caminada
Cardiff University
1 shared publication - Stefan Ellmauthaler
Leipzig University
1 shared publication T U Darmstadt
Cardiff School of Computer Science & Informatics Cardiff University UK
1 shared publication
Latest Publications
- 15 February 2019
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (2) , 109-113
Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms
With the rise of machine learning, and more recently the overwhelming interest in deep learning, knowledge representation and reasoning (KRR) approaches struggle to maintain their position within the wider Artificial Intelligence (AI) community. Often considered as part of thegood old-fashioned AI(Haugeland 1985) – like a memory of glorious old days that have come to an end – many consider KRR as no longer applicable (on its own) to the problems faced by AI today (Blackwell 2015; Garneloet al.2016). What they see are logical languages with symbols incomprehensible by most, inference mechanisms that even experts have difficulties tracing and debugging, and the incapability to process unstructured data like text.
- 15 February 2019
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (2) , 109-113
Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms
With the rise of machine learning, and more recently the overwhelming interest in deep learning, knowledge representation and reasoning (KRR) approaches struggle to maintain their position within the wider Artificial Intelligence (AI) community. Often considered as part of thegood old-fashioned AI(Haugeland 1985) – like a memory of glorious old days that have come to an end – many consider KRR as no longer applicable (on its own) to the problems faced by AI today (Blackwell 2015; Garneloet al.2016). What they see are logical languages with symbols incomprehensible by most, inference mechanisms that even experts have difficulties tracing and debugging, and the incapability to process unstructured data like text.
- 15 January 2019
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (2) , 114-203
Answering the “why” in answer set programming – A survey of explanation approaches
Artificial intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the understandability of solutions. The European Union’s new General Data Protection Regulation tries to tackle this problem by stipulating a “right to explanation” for decisions made by AI systems. One of the AI paradigms that may be affected by this new regulation is answer set programming (ASP). Thanks to the emergence of efficient solvers, ASP has recently been used for problem-solving in a variety of domains, including medicine, cryptography, and biology. To ensure the successful application of ASP as a problem-solving paradigm in the future, explanations of ASP solutions are crucial. In this survey, we give an overview of approaches that provide an answer to the question ofwhyan answer set is a solution to a given problem, notably off-line justifications, causal graphs, argumentative explanations, and why-not provenance, and highlight their similarities and differences. Moreover, we review methods explaining why a set of literals isnotan answer set or why no solution exists at all.
- 15 January 2019
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (2) , 114-203
Answering the “why” in answer set programming – A survey of explanation approaches
Artificial intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the understandability of solutions. The European Union’s new General Data Protection Regulation tries to tackle this problem by stipulating a “right to explanation” for decisions made by AI systems. One of the AI paradigms that may be affected by this new regulation is answer set programming (ASP). Thanks to the emergence of efficient solvers, ASP has recently been used for problem-solving in a variety of domains, including medicine, cryptography, and biology. To ensure the successful application of ASP as a problem-solving paradigm in the future, explanations of ASP solutions are crucial. In this survey, we give an overview of approaches that provide an answer to the question ofwhyan answer set is a solution to a given problem, notably off-line justifications, causal graphs, argumentative explanations, and why-not provenance, and highlight their similarities and differences. Moreover, we review methods explaining why a set of literals isnotan answer set or why no solution exists at all.
- Open Access
- 14 December 2017
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 60, 779-825
On the Equivalence between Assumption-Based Argumentation and Logic Programming
Assumption-Based Argumentation (ABA) has been shown to subsume various other non-monotonic reasoning formalisms, among them normal logic programming (LP). We re-examine the relationship between ABA and LP and show that normal LP also subsumes (flat) ABA. More precisely, we specify a procedure that given a (flat) ABA framework yields an associated logic program with almost the same syntax whose semantics coincide with those of the ABA framework. That is, the 3-valued stable (respectively well-founded, regular, 2-valued stable, and ideal) models of the associated logic program coincide with the complete (respectively grounded, preferred, stable, and ideal) assumption labellings and extensions of the ABA framework. Moreover, we show how our results on the translation from ABA to LP can be reapplied for a reverse translation from LP to ABA, and observe that some of the existing results in the literature are in fact special cases of our work. Overall, we show that (flat) ABA frameworks can be seen as normal logic programs with a slightly different syntax. This implies that methods developed for one of these formalisms can be equivalently applied to the other by simply modifying the syntax.
- 14 December 2017
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 60, 779-825
Open AccessOn the Equivalence between Assumption-Based Argumentation and Logic Programming
Assumption-Based Argumentation (ABA) has been shown to subsume various other non-monotonic reasoning formalisms, among them normal logic programming (LP). We re-examine the relationship between ABA and LP and show that normal LP also subsumes (flat) ABA. More precisely, we specify a procedure that given a (flat) ABA framework yields an associated logic program with almost the same syntax whose semantics coincide with those of the ABA framework. That is, the 3-valued stable (respectively well-founded, regular, 2-valued stable, and ideal) models of the associated logic program coincide with the complete (respectively grounded, preferred, stable, and ideal) assumption labellings and extensions of the ABA framework. Moreover, we show how our results on the translation from ABA to LP can be reapplied for a reverse translation from LP to ABA, and observe that some of the existing results in the literature are in fact special cases of our work. Overall, we show that (flat) ABA frameworks can be seen as normal logic programs with a slightly different syntax. This implies that methods developed for one of these formalisms can be equivalently applied to the other by simply modifying the syntax.