Pushing the Boundaries of Tractable Multiperspective Reasoning: A Deduction Calculus for Standpoint EL+
This work provides a more expressive yet tractable framework for large-scale knowledge integration from multiple perspectives, which is incremental as it builds on existing Standpoint EL.
The paper tackled the challenge of extending the expressivity of Standpoint EL, a tractable multi-modal description logic, by introducing Standpoint EL+ with features like axiom negation and role chain axioms while maintaining polynomial-time complexity, and they demonstrated feasibility through a Datalog implementation.
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.