Journal of Logic, Language and Information 11 (1):67-77 (2002)
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.
|Keywords||axiomatization graded modalities proof theory|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
An Overview of Tableau Algorithms for Description Logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
A Tableau Decision Algorithm for Modalized ALC with Constant Domains.Carsten Lutz, Holger Sturm, Frank Wolter & Michael Zakharyaschev - 2002 - Studia Logica 72 (2):199-232.
Decidability by Filtrations for Graded Normal Logics (Graded Modalities V).Claudio Cerrato - 1994 - Studia Logica 53 (1):61 - 73.
A Sound and Complete Tableau Calculus for Reasoning About Only Knowing and Knowing at Most.Riccardo Rosati - 2001 - Studia Logica 69 (1):171-191.
A Modal Perspective on the Computational Complexity of Attribute Value Grammar.Patrick Blackburn & Edith Spaan - 1993 - Journal of Logic, Language and Information 2 (2):129-169.
Added to index2009-01-28
Total downloads20 ( #248,475 of 2,171,811 )
Recent downloads (6 months)1 ( #326,702 of 2,171,811 )
How can I increase my downloads?