Conservative Rewritability of Description Logic TBoxes: First Results.
Description Logics(2015)
摘要
We want to understand when a given TBox T in a description logic L can be rewritten into a TBox T′ in a weaker description logic L′. Two notions of rewritability are considered: model-conservative rewritability (T′ entails T and all models of T can be expanded to models of T′) and L-conservative rewritability (T′ entails T and every L-consequence of T′ in the signature of T is a consequence of T ) and investigate rewritability of TBoxes in ALCI to ALC, ALCQ to ALC, ALC to EL⊥, and ALCI to DL-Litehorn. We compare conservative rewritability with equivalent rewritability, give model-theoretic characterizations of conservative rewritability, prove complexity results for deciding rewritability, and provide some rewriting algorithms.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络