We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute i...
Abstract. We show that the description logic SOQ with number restrictions on transitive roles is decidable by a terminating tableau calculus. The language decided by the calculus i...
Context-sensitivity has been for long a subject of study in linguistics, logic and computer science. Recently the problem of representing and reasoning with contextual knowledge ha...
Abstract. Inconsistency handling in expressive description logics is an important problem because inconsistency may naturally occur in an open world. In this paper, we present the ...