Abstract
We present a simple ExpTime (complexity-optimal) tableau decision procedure based on and-or graphs with sound global caching for checking satisfiability of a concept w.r.t. a TBox in $\mathcal{ALC}$. Our algorithm is easy to implement and provides a foundation for ExpTime (complexity-optimal) tableau-based decision procedures for many modal and description logics, to which various optimisation techniques can be applied.
| Original language | English |
|---|---|
| Pages (from-to) | 355-381 |
| Number of pages | 27 |
| Journal | Journal of Automated Reasoning |
| Volume | 50 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Apr 2013 |