Skip to main content

Table 3 Complexity results of GTAP for \({\boldsymbol{\mathcal {EL}}^{++}}\)

From: Completing the is-a structure in light-weight ontologies

Decision problems

Existence

Relevance

Necessity

General

NP-complete

NP-complete

co-NP-complete

Subset minimality

NP-complete

NP-complete

co-NP-complete

Semantic maximality

NP-complete

NP-complete

co-NP-complete

Minmax

NP-complete

\({\Sigma _{2}^{P}}\)-complete

\({\Pi _{2}^{P}}\)-complete

Maxmin

NP-complete

NP-complete

co-NP-complete

Skyline

NP-complete

NP-complete

co-NP-complete