Journal of Logic, Language and Information 11 (1):67-77 (2002)
|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.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Franz Baader & Ulrike Sattler (2001). An Overview of Tableau Algorithms for Description Logics. Studia Logica 69 (1):5-40.
Patrick Blackburn & Edith Spaan (1993). A Modal Perspective on the Computational Complexity of Attribute Value Grammar. Journal of Logic, Language and Information 2 (2):129-169.
Riccardo Rosati (2001). A Sound and Complete Tableau Calculus for Reasoning About Only Knowing and Knowing at Most. Studia Logica 69 (1):171-191.
Claudio Cerrato (1994). Decidability by Filtrations for Graded Normal Logics (Graded Modalities V). Studia Logica 53 (1):61 - 73.
Carsten Lutz, Holger Sturm, Frank Wolter & Michael Zakharyaschev (2002). A Tableau Decision Algorithm for Modalized ALC with Constant Domains. Studia Logica 72 (2):199-232.
Maarten De Rijke (2000). A Note on Graded Modal Logic. Studia Logica 64 (2):271 - 283.
Maarten de Rijke (2000). A Note on Graded Modal Logic. Studia Logica 64 (2):271-283.
M. Fattorosi-Barnaba & F. Caro (1985). Graded Modalities. I. Studia Logica 44 (2):197 - 221.
Francesco Caro (1988). Graded Modalities, II (Canonical Models). Studia Logica 47 (1):1 - 10.
Francesco Caro (1988). Normal Predicative Logics with Graded Modalities. Studia Logica 47 (1):11 - 22.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads3 ( #202,008 of 549,124 )
Recent downloads (6 months)0
How can I increase my downloads?