An overview of tableau algorithms for description logics
Studia Logica 69 (1):5-40 (2001)
| Abstract | Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description logics have turned out to be closely related to propositional modal logics and logics of programs (such as propositional dynamic logic), for which tableau procedures have been quite successful.Nevertheless, due to different underlying institutions and applications, most description logics differ significantly from run-of-the-mill modal and program logics. Consequently, the research on tableau algorithms in description logics led to new techniques and results, which are, however, also of interest for modal logicians. In this article, we will focus on three features that play an important rôle in description logics (number restrictions, terminological axioms, and role constructors), and show how they can be taken into account by tableau algorithms | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesGiambattista Amati & Fiora Pirri (1994). A Uniform Tableau Method for Intuitionistic Modal Logics I. Studia Logica 53 (1):29 - 60.
Diderik Batens & Joke Meheus (2001). Shortcuts and Dynamic Marking in the Tableau Method for Adaptive Logics. Studia Logica 69 (2):221-248.
Vladimir V. Rybakov (2011). Best Unifiers in Transitive Modal Logics. Studia Logica 99 (1-3):321-336.
Martin Amerbauer (1996). Cut-Free Tableau Calculi for Some Propositional Normal Modal Logics. Studia Logica 57 (2-3):359 - 372.
Linh Anh Nguyen & Andrzej Szałas (2011). ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse. Studia Logica 98 (3):387-428.
Ian P. Gent (1993). Theory Matrices (for Modal Logics) Using Alphabetical Monotonicity. Studia Logica 52 (2):233 - 257.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads6 ( #145,673 of 549,119 )Recent downloads (6 months)1 ( #63,361 of 549,119 )How can I increase my downloads? |
My notes
Discussion
