CSChristian Straßer

Christian Straßer

*This is an algorithmically generated author record based on publicly available information.

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


Christian Straßer has a total of 38 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Representation considerations for logical argumentation frameworks: Minimality, consistency, compactness, and logical preservation

    by Ofer Arieli, Christian Straßer

    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

    Compactness and Preservation in Logical Argumentation Frameworks

    by Ofer Arieli, Christian Strasser

    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.


  • Hypothesis-Driven Disjunctive Reasoning in Logical Argumentation

    by Zheng Zhou, Christian Straßer, Kees van Berkel

  • Open Access

    Decomposing Inconsistencies: Marginal Contributions and Pooling Techniques

    by Christian Straßer, Badran Raddaoui, Said Jabbour

    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.

  • Open Access

    Minimal-Inconsistency Tolerant Logics: A Quantitative Approach

    by Christian Strasser, Sanderson Molick Silva

    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.

  • The Goal after Tomorrow: Offline Goal Reasoning with Norms

    by Pere Pardo, Christian Strasser

    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

    Towards an Argumentative Unification of Default Reasoning

    by Kees van Berkel, Christian Strasser, Zheng Zhou

    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

    Revealing Concept Shift in Spatio-Temporal Graphs via State Learning

    by Badran Raddaoui, Christian Straßer, Said Jabbour

    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

    Defeasible Normative Reasoning: A Proof-Theoretic Integration of Logical Argumentation

    by Ofer Arieli, Kees Van Berkel, Christian Straßer

    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).