Optimal Tableau Algorithms for Coalgebraic Logics
Date
2010
Authors
Gore, Rajeev
Kupke, Clemens
Pattinson, Dirk
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Abstract
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer science. Tableau methods have proved extremely versatile for solving this problem for many different individual logics but they typically do not meet the known complexity bounds for the logics in question. Recently, it has been shown that optimality can be obtained for some logics while retaining practicality by using a technique called "global caching". Here, we show that global caching is applicable to all logics that can be equipped with coalgebraic semantics, for example, classical modal logic, graded modal logic, probabilistic modal logic and coalition logic. In particular, the coalgebraic approach also covers logics that combine these various features. We thus show that global caching is a widely applicable technique and also provide foundations for optimal tableau algorithms that uniformly apply to a large class of modal logics.
Description
Keywords
Keywords: Coalgebraic; Coalgebraic logic; Coalgebraic semantics; Complexity bounds; Large class; Logic in computer science; Modal formulas; Modal logic; Optimality; Tableau algorithm; Tableau method; Algorithms; Computer software; Probabilistic logics
Citation
Collections
Source
Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2010)
Type
Conference paper
Book Title
Entity type
Access Statement
License Rights
DOI
10.1007/978-3-642-12002-2_9
Restricted until
2037-12-31