Terminating Tableaux for $\mathcal{SOQ}$ with Number Restrictions on Transitive Roles

Mark Kaminski (1) , Gert Smolka (1)

1 Saarland University [Saarbrücken]

We show that the description logic $\mathcal{SOQ}$ with number restrictions on transitive roles is decidable by a terminating tableau calculus. The language decided by the calculus includes the universal role, which allows us to internalize TBox axioms. Termination of the system is achieved through pattern-based blocking.

Domaines: Bibliothèque électronique [cs.DL]

Mark Kaminski, Gert Smolka. Terminating Tableaux for $\mathcal{SOQ}$ with Number Restrictions on Transitive Roles. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.213-228, ⟨10.1007/978-3-642-15240-5_16⟩. ⟨hal-01054458⟩