Fuzzy Description Logics (DLs) are a family of logics which allow the representation of (and the reasoning within) structured knowledge affected by vagueness. Although a relativel...
Abstract. In this paper, we introduce a paraconsistent extension of Rough Description Logics which allows the representation of incomplete and contradictory concepts, as well as th...
Chemical Entities of Biological Interest (ChEBI) is a database and ontology that represents biochemical knowledge about small molecules. Recent changes to the ontology have created...
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires reasoning at the meta-level. There is a particularly elegan...
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...