Putting Perspective into OWL [sic]: Complexity-Neutral Standpoint Reasoning for Ontology Languages via Monodic S5 over Counting Two-Variable First-Order Logic (Extended Version with Appendix)

2025-08-01

AI Summary

This paper addresses the challenge of integrating multi-perspective modeling—specifically knowledge attribution and stance expression—into the OWL ontology language without increasing reasoning complexity. Methodologically, it introduces a stance extension of C² (two-variable counting first-order logic), built upon a tight coupling of monadic S5 modal logic with C², and devises a polynomial-time modal translation algorithm. Theoretical contributions include: (i) the first demonstration that standard reasoning remains NExpTime-complete under this stance extension; (ii) a proof that relaxing monadicity—when nominals or inverse roles are present—leads to undecidability; and (iii) formal extensions of SHOIQBs and SROIQBs to support rigid concepts and other advanced modeling features. Collectively, these results establish a complexity-neutral, semantically rigorous foundation for multi-perspective reasoning in OWL.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Semantics and Knowledge: Scalable techniques for the creation, curation, publication, maintenance, and consumption of large, Web-based, structured, reusable, knowledge graphs and ontologies
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for heterogeneous, signed, attributed, multi-relational, temporal, higher-order, and annotated Web-related graphs
• Security and Privacy: Data transparency and provenance

Abstract

Standpoint extensions of knowledge representation formalisms have been recently introduced as a means to incorporate multi-perspective modelling and reasoning through modal operators that attribute pieces of knowledge to specific entities or agents. In these extensions, the integration between conceptual modelling and perspective annotations can vary in strength, with monodic standpoint extensions offering a well-balanced approach. They allow for advanced modelling features, such as the expression of rigid concepts, while maintaining desirable reasoning complexity. We consider the extension of C2--the counting two-variable fragment of first-order logic--by monodic standpoints. At the heart of our work is a polynomial-time translation of formulas in this extended formalism into standard, standpoint-free C2, a result that relies on intricate model-theoretic arguments. Thanks to this translation, the satisfiability problem remains at the same complexity level: NExpTime-complete, as in plain C2. Since our formalism subsumes monodic S5 over C2, this result also marks a substantial advancement in the study of first-order modal logics. From a practical standpoint, this means that highly expressive description logics such as SHOIQBs and SROIQBs--which underpin the widely adopted OWL 1 and OWL 2 ontology languages standardised by the W3C--can be extended with monodic standpoints without increasing the standard reasoning complexity. We further prove that NExpTime-hardness arises even in significantly less expressive description logics, as long as they include both nominals and monodic standpoints. Moreover, we show that if the monodicity restriction is relaxed even slightly in the presence of inverse roles, functionality, and nominals, the satisfiability problem becomes undecidable.

Problem

• Extends C2 logic with monodic standpoints for multi-perspective reasoning
• Maintains NExpTime complexity despite expressive standpoint extensions
• Enables practical OWL ontology enhancements without complexity overhead

Innovation

• Monodic standpoint extensions for C2 logic
• Polynomial-time translation to standpoint-free C2
• Maintains NExpTime-complete reasoning complexity