On the Relative Expressiveness of Description Logics and Predicate Logics


It is natural to view concept and role definitions in Description Logics as expressing monadic and dyadic predicates in Predicate Calculus. We show that the descriptions built using the constructors usually considered in the DL literature are characterized exactly as the predicates definable by formulas in L̈3, the subset of First Order Predicate Calculus with monadic and dyadic predicates which allows only three variable symbols. In order to handle “number bounds”, we allow numeric quantifiers, and for transitive closure of roles we use infinitary disjunction. Using previous results in the literature concerning languages with limited numbers of variables, we get as corollaries the existence of formulae of FOPC which cannot be expressed as descriptions. We also show that by omitting role composition, descriptions express exactly the formulae in L̈, which is known to be decidable. To appear in Artificial Intelligence Journal Preliminary versions of some results were presented, for a database audience, at the CIKM’94 Conference. Supported in part by NSF Grant IRI 91-19310.

DOI: 10.1016/0004-3702(96)00004-5

Extracted Key Phrases

Citations per Year

418 Citations

Semantic Scholar estimates that this publication has 418 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Borgida1996OnTR, title={On the Relative Expressiveness of Description Logics and Predicate Logics}, author={Alexander Borgida}, journal={Artif. Intell.}, year={1996}, volume={82}, pages={353-367} }