Skip navigation
Skip navigation

Optimal Tableau Algorithms for Coalgebraic Logics

Gore, Rajeev; Kupke, Clemens; Pattinson, Dirk


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...[Show more]

CollectionsANU Research Publications
Date published: 2010
Type: Conference paper
Source: Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2010)
DOI: 10.1007/978-3-642-12002-2_9


File Description SizeFormat Image
01_Gore_Optimal_Tableau_Algorithms_for_2010.pdf260.53 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator