作者: Bariş Sertkaya , Rafael Peñaloza
DOI:
关键词:
摘要: We investigate the computational complexity of axiom pinpointing, which is task finding minimal subsets a Description Logic knowledge base that have given consequence. consider problems enumerating such with and without order, show hardness results already hold for propositional Horn fragment, or EL. several other related decision enumeration these fragments extend to more expressive logics. In particular we depends not only on expressivity fragment but also shape axioms used.