The revival of structural subsumption in tableau-based reasoners

We would also like to implement a version similar to the approach described by Halland and Britz [4] where the models are computed in an exhaustive run of the tableau reasoner in

In this paper, we study the problem of forgetting concept symbols in the description logic SIF, an expressive description logic supporting transi- tive roles, inverse roles

Firstly, we introduce a new probabilis- tic extension of the classic DL SHIQ, called SHIQ P , with the statistical semantics inherited from the Type 1 probabilistic FOL

As far as we know, relational dual tableau-based decision procedures can be found in [16] for fragments of RL(1) corresponding to the class of first-order formulae in prenex normal

Just like the similar style (deterministic) procedures for EL and Horn-SHIQ, our procedure explicitly derives subsumptions between concepts, but due to non-deterministic rules, not

it relies on tableau expansion rules working together with an integer programming solver (e.g., simplex solver) and comes with a double exponential worst case complexity. However,

In [10], Nguyen gave the first ExpTime (optimal) tableau decision procedure for check- ing satisfiability of a knowledge base in the DL SHIQ, where the complexity is measured

A comparison was done between the provers generated using the tableau calculus with dynamically generated tableau rules, and a prover with fixed rules for dealing with TBox and