Christian Straßer
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
Christian Straßer has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Dunja Šešelja
Philosophy and Ethics Group, TU Eindhoven, Eindhoven, The Netherlands
13 shared publications - AnneMarie Borg
Utrecht University
9 shared publications - Ofer Arieli
School of Computer Science, Tel-Aviv Academic College, Tel-Aviv, Israel
8 shared publications - Jesse Heyninck
Open Universiteit, The Netherlands
5 shared publications Mathieu Beirlaen
Ruhr University Bochum
5 shared publicationsOfer Arieli
The Academic College of Tel-Aviv
4 shared publications
Latest Publications
- 2 March 2026
- Published by SAGE Publications in Argument & Computation
- Vol. 17 (2) , 107-140
Representation considerations for logical argumentation frameworks: Minimality, consistency, compactness, and logical preservation
This paper considers various aspects of representing arguments and logical argumentation frameworks. We investigate different approaches to address consistency and minimality within such frameworks, arguing that these properties can, and in some cases should, be omitted from the definition of an argument. We analyze the relationship between how consistency is verified and the selection of attack rules, showing that this choice should align with the underlying logic. Based on these results, we propose compact representations of logical argumentation frameworks and examine methods for transforming one framework into another (e.g., a more concise version) without losing logical entailments.
- 2 March 2026
- Published by SAGE Publications in Argument & Computation
- Vol. 17 (2) , 107-140
Representation considerations for logical argumentation frameworks: Minimality, consistency, compactness, and logical preservation
This paper considers various aspects of representing arguments and logical argumentation frameworks. We investigate different approaches to address consistency and minimality within such frameworks, arguing that these properties can, and in some cases should, be omitted from the definition of an argument. We analyze the relationship between how consistency is verified and the selection of attack rules, showing that this choice should align with the underlying logic. Based on these results, we propose compact representations of logical argumentation frameworks and examine methods for transforming one framework into another (e.g., a more concise version) without losing logical entailments.
- Open Access
- 1 November 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 22 (1) , 46-55
Compactness and Preservation in Logical Argumentation Frameworks
Logic-based argumentation is a formal method for constructing, evaluating and comparing arguments. In this paper we address two (related) key issues concerning the representation of logical argumentation frameworks: how to describe them in a compact way, and how to move from one framework to another while preserving their basic logical characteristics. The results are applied to various forms of attack rules and different kinds of argumentative semantics, and are demonstrated for transitions between several 3-valued logics and classical logic. As a byproduct, our results are also used for converting logic-based argumentation frameworks to assumption-based argumentation frameworks.
- 1 November 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 22 (1) , 46-55
Open AccessCompactness and Preservation in Logical Argumentation Frameworks
Logic-based argumentation is a formal method for constructing, evaluating and comparing arguments. In this paper we address two (related) key issues concerning the representation of logical argumentation frameworks: how to describe them in a compact way, and how to move from one framework to another while preserving their basic logical characteristics. The results are applied to various forms of attack rules and different kinds of argumentative semantics, and are demonstrated for transitions between several 3-valued logics and classical logic. As a byproduct, our results are also used for converting logic-based argumentation frameworks to assumption-based argumentation frameworks.
- 3 October 2025
- Published by Springer Nature
- p. 179-194
Hypothesis-Driven Disjunctive Reasoning in Logical Argumentation
- 3 October 2025
- Published by Springer Nature
- p. 179-194
Hypothesis-Driven Disjunctive Reasoning in Logical Argumentation
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 4687-4695
Decomposing Inconsistencies: Marginal Contributions and Pooling Techniques
Inconsistency measures quantify the degree of conflict within a set of propositions. They can be broadly categorized into global measures, which assess the overall inconsistency of a set, and local measures, which evaluate the contribution of single formulas to the overall inconsistency. This paper investigates the relationship between these two classes of measures through the lens of marginal contributions and pooling mechanisms. We propose a systematic framework for deriving local inconsistency measures from global ones by employing notions of marginal contributions inspired by cooperative game theory, including Shapley and Banzhaf values. Conversely, we explore methods for constructing global inconsistency measures by aggregating local contributions using various pooling techniques. A key research question arises: which combinations of marginal contribution notions (maC) and pooling mechanisms (P) are compatible? Compatibility is defined such that, given a global measure I, applying (P) to the marginal contributions derived from I yields the same result as directly applying I, and vice versa. We analyze this compatibility condition and identify specific pairs of methods, (maC) and (P), that satisfy it across various inconsistency frameworks. Our findings provide a deeper understanding of the interplay between global and local inconsistency measures, providing a foundation for designing principled and interpretable inconsistency evaluation methods in logic-based systems.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 5, 4687-4695
Open AccessDecomposing Inconsistencies: Marginal Contributions and Pooling Techniques
Inconsistency measures quantify the degree of conflict within a set of propositions. They can be broadly categorized into global measures, which assess the overall inconsistency of a set, and local measures, which evaluate the contribution of single formulas to the overall inconsistency. This paper investigates the relationship between these two classes of measures through the lens of marginal contributions and pooling mechanisms. We propose a systematic framework for deriving local inconsistency measures from global ones by employing notions of marginal contributions inspired by cooperative game theory, including Shapley and Banzhaf values. Conversely, we explore methods for constructing global inconsistency measures by aggregating local contributions using various pooling techniques. A key research question arises: which combinations of marginal contribution notions (maC) and pooling mechanisms (P) are compatible? Compatibility is defined such that, given a global measure I, applying (P) to the marginal contributions derived from I yields the same result as directly applying I, and vice versa. We analyze this compatibility condition and identify specific pairs of methods, (maC) and (P), that satisfy it across various inconsistency frameworks. Our findings provide a deeper understanding of the interplay between global and local inconsistency measures, providing a foundation for designing principled and interpretable inconsistency evaluation methods in logic-based systems.
- 2 February 2025
- Published by Springer Nature
- p. 78-114
A Tutorial in Proof-Theoretic Approaches to Logical Argumentation
- 2 February 2025
- Published by Springer Nature
- p. 78-114
A Tutorial in Proof-Theoretic Approaches to Logical Argumentation
- Open Access
- 1 February 2025
- Published by Victoria University of Wellington Library in The Australasian Journal of Logic
- Vol. 22 (3) , 308-365
Minimal-Inconsistency Tolerant Logics: A Quantitative Approach
In order to reason in a non-trivializing way with contradictions, paraconsistent logics reject some classically valid inferences. As a way to recover some of these inferences, Graham Priest proposed to nonmonotonically strengthen the Logic of Paradox by allowing the selection of “less inconsistent” models via a comparison of their respective inconsistent parts. This move recaptures a good portion of classical logic in that it does not block, e.g., disjunctive syllogism, unless it is applied to contradictory assumptions. In Priest’s approach the inconsistent parts of models are compared in an extensional way by consid- ering their inconsistent objects. This distinguishes his system from the standard format of (inconsistency-)adaptive logics pioneered by Diderik Batens, according to which (atomic) contradictions validated in models form the basis of their comparison. A well-known prob- lem for Priest’s extensional approach is its lack of the Strong Reassurance property, i.e., for specific settings there may be infinitely descending chains of less and less inconsistent models, thus never reaching a minimally inconsistent model. In the following paper, we show that Strong Reassurance holds for the extensional ap- proach under a cardinality-based comparison of the inconsistent parts of models. We develop and study the meta-theory of a class of nonmonotonic inconsistency-tolerant logics based on the extensional and the quantitative comparisons of their respective models, including important model-theoretic properties, such as the Löwenheim-Skolem theorems, as well as principles of nonmonotonic inference.
- 1 February 2025
- Published by Victoria University of Wellington Library in The Australasian Journal of Logic
- Vol. 22 (3) , 308-365
Open AccessMinimal-Inconsistency Tolerant Logics: A Quantitative Approach
In order to reason in a non-trivializing way with contradictions, paraconsistent logics reject some classically valid inferences. As a way to recover some of these inferences, Graham Priest proposed to nonmonotonically strengthen the Logic of Paradox by allowing the selection of “less inconsistent” models via a comparison of their respective inconsistent parts. This move recaptures a good portion of classical logic in that it does not block, e.g., disjunctive syllogism, unless it is applied to contradictory assumptions. In Priest’s approach the inconsistent parts of models are compared in an extensional way by consid- ering their inconsistent objects. This distinguishes his system from the standard format of (inconsistency-)adaptive logics pioneered by Diderik Batens, according to which (atomic) contradictions validated in models form the basis of their comparison. A well-known prob- lem for Priest’s extensional approach is its lack of the Strong Reassurance property, i.e., for specific settings there may be infinitely descending chains of less and less inconsistent models, thus never reaching a minimally inconsistent model. In the following paper, we show that Strong Reassurance holds for the extensional ap- proach under a cardinality-based comparison of the inconsistent parts of models. We develop and study the meta-theory of a class of nonmonotonic inconsistency-tolerant logics based on the extensional and the quantitative comparisons of their respective models, including important model-theoretic properties, such as the Löwenheim-Skolem theorems, as well as principles of nonmonotonic inference.
- 31 August 2024
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 80, 1703-1759
The Goal after Tomorrow: Offline Goal Reasoning with Norms
Recent studies have focused on autonomous agents that select their own goals and then select actions to achieve these goals, using online Goal Reasoning (GR). GR agents can revise goals and plans at execution time if unexpected outcomes occur. However, for ethical or legal agent design, even the partial execution of an online plan may result in foreseeable norm violations. To prevent these violations, it is crucial to incorporate GR already at the planning phase. To this end, we design an offline GR system that can harbour normative systems or deontic logics for goal generation. Our main results include a characterization and comparison of the completeness classes for a variety of offline GR planners, and a discussion of the irreducibility of offline GR to pure planning methods.
- 31 August 2024
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 80, 1703-1759
The Goal after Tomorrow: Offline Goal Reasoning with Norms
Recent studies have focused on autonomous agents that select their own goals and then select actions to achieve these goals, using online Goal Reasoning (GR). GR agents can revise goals and plans at execution time if unexpected outcomes occur. However, for ethical or legal agent design, even the partial execution of an online plan may result in foreseeable norm violations. To prevent these violations, it is crucial to incorporate GR already at the planning phase. To this end, we design an offline GR system that can harbour normative systems or deontic logics for goal generation. Our main results include a characterization and comparison of the completeness classes for a variety of offline GR planners, and a discussion of the irreducibility of offline GR to pure planning methods.
- Open Access
- 27 August 2024
- Published by IOS Press
- p. 313-324
Towards an Argumentative Unification of Default Reasoning
We propose a novel knowledge representation method for the Default Logic paradigm by developing a proof calculus that yields arguments and counter-arguments in which defaults serve as explicit objects of reasoning. The proposed formalism allows for more transparent default reasoning and the use of explain-ability methods in formal argumentation. In particular, we provide a sound and complete argumentative characterization of Default Logic, by demonstrating that argumentation frameworks instantiated by the arguments derivable in our calculus yields the same inference relation as that of Default Logic. The modularity of our approach allows for various modifications of Default Logic. We demonstrate this by extending our calculus with a rule that enables disjunctive defeasible reasoning.
- 27 August 2024
- Published by IOS Press
- p. 313-324
Open AccessTowards an Argumentative Unification of Default Reasoning
We propose a novel knowledge representation method for the Default Logic paradigm by developing a proof calculus that yields arguments and counter-arguments in which defaults serve as explicit objects of reasoning. The proposed formalism allows for more transparent default reasoning and the use of explain-ability methods in formal argumentation. In particular, we provide a sound and complete argumentative characterization of Default Logic, by demonstrating that argumentation frameworks instantiated by the arguments derivable in our calculus yields the same inference relation as that of Default Logic. The modularity of our approach allows for various modifications of Default Logic. We demonstrate this by extending our calculus with a rule that enables disjunctive defeasible reasoning.
- Open Access
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 4, 3525-3533
Revealing Concept Shift in Spatio-Temporal Graphs via State Learning
Dynamic graphs are ubiquitous in the real world, presenting the temporal evolution of individuals within spatial associations. Recently, dynamic graph learning research is flourishing, striving to more effectively capture evolutionary patterns and spatial correlations. However, existing methods still fail to address the issue of concept shift in dynamic graphs. Concept shift manifests as a distribution shift in the mapping pattern between historical observations and future evolution. The reason is that some environment variables in dynamic graphs exert varying effects on evolution patterns, but these variables are not effectively captured by the models, leading to the intractable concept shift issue. To tackle this issue, we propose a State-driven environment inference framework (Samen) to achieve a dynamic graph learning framework equipped with concept generalization ability. Firstly, we propose a two-stage environment inference and compression strategy. From the perspective of state space, we introduce a prefix-suffix collaborative state learning mechanism to bidirectionally model the spatio-temporal states. A hierarchical state compressor is further designed to refine the state information resulting in concept shift. Secondly, we propose a skip-connection spatio-temporal prediction module, which effectively utilizes the inferred environments to improve the model's generalization capability. Finally, we select seven datasets from different domains to validate the effectiveness of our model. By comparing the performance of different models on samples with concept shift, we verify that our Samen gains generalization capacity that existing methods fail to capture.
- 1 August 2024
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 4, 3525-3533
Open AccessRevealing Concept Shift in Spatio-Temporal Graphs via State Learning
Dynamic graphs are ubiquitous in the real world, presenting the temporal evolution of individuals within spatial associations. Recently, dynamic graph learning research is flourishing, striving to more effectively capture evolutionary patterns and spatial correlations. However, existing methods still fail to address the issue of concept shift in dynamic graphs. Concept shift manifests as a distribution shift in the mapping pattern between historical observations and future evolution. The reason is that some environment variables in dynamic graphs exert varying effects on evolution patterns, but these variables are not effectively captured by the models, leading to the intractable concept shift issue. To tackle this issue, we propose a State-driven environment inference framework (Samen) to achieve a dynamic graph learning framework equipped with concept generalization ability. Firstly, we propose a two-stage environment inference and compression strategy. From the perspective of state space, we introduce a prefix-suffix collaborative state learning mechanism to bidirectionally model the spatio-temporal states. A hierarchical state compressor is further designed to refine the state information resulting in concept shift. Secondly, we propose a skip-connection spatio-temporal prediction module, which effectively utilizes the inferred environments to improve the model's generalization capability. Finally, we select seven datasets from different domains to validate the effectiveness of our model. By comparing the performance of different models on samples with concept shift, we verify that our Samen gains generalization capacity that existing methods fail to capture.
- Open Access
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (9) , 10450-10458
Defeasible Normative Reasoning: A Proof-Theoretic Integration of Logical Argumentation
We present a novel computational approach to resolving conflicts among norms by nonmonotonic normative reasoning (in constrained I/O logics). Our approach extends standard sequent-based proof systems and makes them more adequate to nonmonotonic reasoning by adding to the sequents annotations that keep track of what is known about the defeasible status of the derived sequents. This makes transparent the reasons according to which norms should be applicable or inapplicable, and accordingly the sequents that make use of such norms are accepted or retracted. We also show that this proof theoretic method has tight links to the semantics of formal argumentation frameworks. The outcome of this paper is thus a threefold characterization result that relates, in the context of nonmonotonic normative reasoning, three traditional ingredients of AI-based reasoning methods: maximally consistent sets of premises (in constrained I/O logics), derived sequents (which are accepted in corresponding annotated sequent calculi), and logical arguments (that belong to the grounded extensions of the induced logical argumentation frameworks).
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (9) , 10450-10458
Open AccessDefeasible Normative Reasoning: A Proof-Theoretic Integration of Logical Argumentation
We present a novel computational approach to resolving conflicts among norms by nonmonotonic normative reasoning (in constrained I/O logics). Our approach extends standard sequent-based proof systems and makes them more adequate to nonmonotonic reasoning by adding to the sequents annotations that keep track of what is known about the defeasible status of the derived sequents. This makes transparent the reasons according to which norms should be applicable or inapplicable, and accordingly the sequents that make use of such norms are accepted or retracted. We also show that this proof theoretic method has tight links to the semantics of formal argumentation frameworks. The outcome of this paper is thus a threefold characterization result that relates, in the context of nonmonotonic normative reasoning, three traditional ingredients of AI-based reasoning methods: maximally consistent sets of premises (in constrained I/O logics), derived sequents (which are accepted in corresponding annotated sequent calculi), and logical arguments (that belong to the grounded extensions of the induced logical argumentation frameworks).