Abstract
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checking are formulated in terms of modal logic and an algorithm for their solution is provided. An axiomatization for a restricted graded modal language with intersection of modalities (the modal counterpart of the concept language we examine)is given and used in the proposed algorithm.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nenkova, A. A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages. Journal of Logic, Language and Information 11, 67–77 (2002). https://doi.org/10.1023/A:1013097911573
Issue Date:
DOI: https://doi.org/10.1023/A:1013097911573