HSHannes Strass

Hannes Strass

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hannes Strass has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the Complexity of Initial Models in Abstract Dialectical Frameworks

    by Hannes Strass, Johannes P. Wallner

    Dialectical frameworks (ADFs) constitute one of the most general formal approaches within abstract argumentation. Recently, Bengel and Thimm (2025) proposed so-called initial models in ADFs as a suitable concept for “serializing” reasoning, i.e., decomposing reasoning in ADFs step by step. They showed several complexity results of reasoning with initial models. Our contributions in this paper are (i) that we close a gap in their complexity results of verifying initial models by showing DP-completeness, and (ii) based on our complexity results we provide an answer set programming (ASP) implementation to support systems utilizing initial models.

  • Open Access

    Assumption-Based Argumentation Through the Lens of Approximation Fixpoint Theory

    by Iosif Apostolakis, Hannes Strass, Johannes P. Wallner

    Approximation fixpoint theory (AFT) was successfully employed as a uniform approach to define the semantics of major formalisms in abstract argumentation, such as argumentation frameworks and abstract dialectical frameworks. So far AFT was not directly applied for capturing formalisms in structured argumentation. We take up this opportunity and place flat assumption-based argumentation (ABA) in AFT.

  • Open Access

    Approximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics

    by Pascal Kettmann, Jesse Heyninck, Hannes Strass

    Fuzzy logic programming is an established approach for reasoning under uncertainty. Several semantics from classical, two-valued logic programming have been generalized to the case of fuzzy logic programs. In this paper, we show that two of the most prominent classical semantics, namely the stable model and the well-founded semantics, can be reconstructed within the general framework of approximation fixpoint theory (AFT). This not only widens the scope of AFT from two- to many-valued logics, but allows a wide range of existing AFT results to be applied to fuzzy logic programming. As first examples of such applications, we clarify the formal relationship between existing semantics, generalize the notion of stratification from classical to fuzzy logic programs, and devise “more precise” variants of the semantics.

  • Open Access

    Approximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics (Extended Version)

    by Pascal Kettmann, Jesse Heyninck, Hannes Strass

    Fuzzy logic programming is an established approach for reasoning under uncertainty. Several semantics from classical, two-valued logic programming have been generalized to the case of fuzzy logic programs. In this paper, we show that two of the most prominent classical semantics, namely the stable model and the well-founded semantics, can be reconstructed within the general framework of approximation fixpoint theory (AFT). This not only widens the scope of AFT from two- to many-valued logics, but allows a wide range of existing AFT results to be applied to fuzzy logic programming. As first examples of such applications, we clarify the formal relationship between existing semantics, generalize the notion of stratification from classical to fuzzy logic programs, and devise "more precise" variants of the semantics.

  • Open Access

    Tractable Diversity: Scalable Multiperspective Ontology Management via Standpoint EL

    by Lucía Gómez Álvarez, Sebastian Rudolph, Hannes Strass

    Electronic proceedings of IJCAI 2023


  • Open Access

    Pushing the Boundaries of Tractable Multiperspective Reasoning: A Deduction Calculus for Standpoint EL+

    by Lucía Gómez Álvarez, Sebastian Rudolph, Hannes Strass

    Standpoint EL is a multi-modal extension of the popular description logic EL that allows for the integrated representation of domain knowledge relative to diverse standpoints or perspectives. Advantageously, its satisfiability problem has recently been shown to be in PTime, making it a promising framework for large-scale knowledge integration. In this paper, we show that we can further push the expressivity of this formalism, arriving at an extended logic, called Standpoint EL+, which allows for axiom negation, role chain axioms, self-loops, and other features, while maintaining tractability. This is achieved by designing a satisfiability-checking deduction calculus, which at the same time addresses the need for practical algorithms. We demonstrate the feasibility of our calculus by presenting a prototypical Datalog implementation of its deduction rules.

  • Open Access

    Tractable Diversity: Scalable Multiperspective Ontology Management via Standpoint EL

    by Lucía Gómez Álvarez, Sebastian Rudolph, Hannes Strass

    The tractability of the lightweight description logic EL has allowed for the construction of large and widely used ontologies that support semantic interoperability. However, comprehensive domains with a broad user base are often at odds with strong axiomatisations otherwise useful for inferencing, since these are usually context-dependent and subject to diverging perspectives. In this paper we introduce Standpoint EL, a multi-modal extension of EL that allows for the integrated representation of domain knowledge relative to diverse, possibly conflicting standpoints (or contexts), which can be hierarchically organised and put in relation to each other. We establish that Standpoint EL still exhibits EL's favourable PTime standard reasoning, whereas introducing additional features like empty standpoints, rigid roles, and nominals makes standard reasoning tasks intractable.

  • Open Access

    How to Agree to Disagree

    by Lucía Gómez Álvarez, Sebastian Rudolph, Hannes Strass

    The importance of taking individual, potentially conflicting perspectives into account when dealing with knowledge has been widely recognised. Many existing ontology management approaches fully merge knowledge perspectives, which may require weakening in order to maintain consistency; others represent the distinct views in an entirely detached way.As an alternative, we proposeStandpoint Logic, a simple, yet versatile multi-modal logic “add-on” for existing KR languages intended for the integrated representation of domain knowledge relative to diverse, possibly conflictingstandpoints, which can be hierarchically organised, combined, and put in relation with each other.Starting from the generic framework ofFirst-Order Standpoint Logic(FOSL), we subsequently focus our attention on the fragment ofsententialformulas, for which we provide a polytime translation into the standpoint-free version. This result yields decidability and favourable complexities for a variety of highly expressive decidable fragments of first-order logic. Using some elaborate encoding tricks, we then establish a similar translation for the very expressive description logic $$\mathcal {SROIQ}b_s$$SROIQbs underlying the OWL 2 DL ontology language. By virtue of this result, existing highly optimised OWL reasoners can be used to provide practical reasoning support for ontology languages extended by standpoint modelling.


  • Open Access

    How to Agree to Disagree: Managing Ontological Perspectives using Standpoint Logic

    by Lucía Gómez Álvarez, Sebastian Rudolph, Hannes Strass

    The importance of taking individual, potentially conflicting perspectives into account when dealing with knowledge has been widely recognised. Many existing ontology management approaches fully merge knowledge perspectives, which may require weakening in order to maintain consistency; others represent the distinct views in an entirely detached way. As an alternative, we propose Standpoint Logic, a simple, yet versatile multi-modal logic "add-on" for existing KR languages intended for the integrated representation of domain knowledge relative to diverse, possibly conflicting standpoints, which can be hierarchically organised, combined and put in relation to each other. Starting from the generic framework of First-Order Standpoint Logic (FOSL), we subsequently focus our attention on the fragment of sentential formulas, for which we provide a polytime translation into the standpoint-free version. This result yields decidability and favourable complexities for a variety of highly expressive decidable fragments of first-order logic. Using some elaborate encoding tricks, we then establish a similar translation for the very expressive description logic SROIQb_s underlying the OWL 2 DL ontology language. By virtue of this result, existing highly optimised OWL reasoners can be used to provide practical reasoning support for ontology languages extended by standpoint modelling.