Ali Rezaei Divroodi

  • Citations Per Year
Learn More
We formulate bisimulations for useful description logics. The simplest among the considered logics is a variant of PDL (propositional dynamic logic). The others extend that logic with inverse roles, nominals, quantified number restrictions, the universal role, and/or the concept constructor ∃r.Self. They also allow role axioms. We give results about(More)
We prove that any concept in any description logic that extendsALC with some features amongst I (inverse),Qk (quantified number restrictions with numbers bounded by a constant k), Self (local reflexivity of a role) can be learnt if the training information system is good enough. That is, there exists a learning algorithm such that, for every concept C of(More)
We study comparisons between interpretations in description logics with respect to “logical consequences” of the form of semipositive concepts (like semi-positive concept assertions). Such comparisons are characterized by conditions similar to the ones of bisimulations. The simplest among the considered logics is a variant of PDL (propositional dynamic(More)
In this dissertation, we study bisimulations and bisimulation-based comparisons in a uniform way for a large class of description logics that extend ALCreg (a variant of propositional dynamic logic) with an arbitrary set of features among I (inverse roles), O (nominals), Q (qualified number restrictions), U (the universal role), Self (local reflexivity of a(More)
This work studies the expressiveness of the description logics that extend ALCreg (a variant of PDL) with any combination of the features: inverse roles, nominals, quantified number restrictions, the universal role, the concept constructor for expressing the local reflexivity of a role. We compare the expressiveness of these description logics w.r.t.(More)
Description logics (DLs) are variants of modal logic. They are of particular importance in providing a logical formalism for ontologies and the Semantic Web. DLs represent the domain of interest in terms of concepts, individuals, and roles. A concept is interpreted as a set of individuals, while a role is interpreted as a binary relation among individuals.(More)
It is well known that any Boolean function in classical propositional calculus can be learned correctly if the training information system is good enough. In this paper, we extend that result for description logics. We prove that any concept in any description logic that extends $$\mathcal {ALC}$$ ALC with some features amongst I (inverse roles), $$Q_k$$ Q(More)
  • 1