On P/NP Dichotomies for EL Subsumption under Relational Constraints

Abstract. We consider the problem of characterising relational constraints under which TBox reasoning in EL is tractable. We obtain P vs. coNP-hardness dichotomies for tabular constraints and constraints imposed on a single reflexive role.

• Type: Journal
• Year: 2011
• Where: DLOG
• Authors: Agi Kurucz, Frank Wolter, Michael Zakharyaschev
• Keywords: Automated Reasoning, Dichotomies, DLOG 2011, Relational Constraints