Skip navigation
Skip navigation

Reasoning with Global Assumptions in Arithmetic Modal Logics

Kupke, Clemens; Pattinson, Dirk; Schroder, Lutz

Description

We establish a generic upper bound ExpTime for reasoning with global assumptions in coalgebraic modal logics. Unlike earlier results of this kind, we do not require a tractable set of tableau rules for the instance logics, so that the result applies to wider classes of logics. Examples are Presburger modal logic, which extends graded modal logic with linear inequalities over numbers of successors, and probabilistic modal logic with polynomial inequalities over probabilities. We establish the...[Show more]

CollectionsANU Research Publications
Date published: 2015
Type: Journal article
URI: http://hdl.handle.net/1885/98894
Source: Lecture Notes in Computer Science (LNCS)
DOI: 10.1007/978-3-319-22177-9_28

Download

File Description SizeFormat Image
01_Kupke_Reasoning_with_Global_2015.pdf231.35 kBAdobe PDF    Request a copy


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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator