A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages

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. Key words: Axiomatization, graded modalities, proof theory

• Type: Journal
• Year: 2002
• Where: JOLLI
• Authors: Ani Nenkova
• Keywords: Concept Language, JOLLI 2002, Main Reasoning Tasks, Modal Equivalent