Computational complexity and expressive power are two important theoretical considerations in the design of knowledge representation languages.
Description logics are a family of knowledge representation languages.
The complexity of reasoning tasks such as satisfiability and subsumption problems for description logics has been studied extensively, and, recently, the issue of expressiveness of such logics has also been addressed by means of model-theoretic tools. This talk is based on joint work with Carlos Areces and Natasha Kurtonina. All rights reserved. Unauthorized reproduction of this page is prohibited.