We give model-theoretic characterizations of conserva- tive rewritability via bisimulations, inverse p-mor- phisms and generated subinterpretations, and use.

Abstract. We want to understand when a given TBox T in a descrip- tion logic L can be rewritten into a TBox T 0 in a weaker description logic L0.

We give model-theoretic characterizations of conserva- tive rewritability via bisimulations, inverse p-mor- phisms and generated subinterpretations, and use.

Abstract. We want to understand when a given TBox T in a descrip- tion logic L can be rewritten into a TBox T 0 in a weaker description logic L0.

This work gives model-theoretic characterizations of conservative rewritability via bisimulations, inverse p-morphisms and generated subinterpretations, ...

We investigate the problem of conservative rewritability of a TBox T in a description logic (DL) L into a TBox T′ in a weaker DL L′.

Abstract. 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′.

We investigate the problem of conservative rewritability of a TBox T in a description logic L into a TBox T' in a weaker description logic L'. We focus on model ...

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′.

Boris Konev, Carsten Lutz, Frank Wolter, Michael Zakharyaschev: Conservative Rewritability of Description Logic TBoxes: First Results.