NP Reasoning in the Monotone μ-Calculus

02/12/2020
by   Daniel Hausmann, et al.
0

Satisfiability checking for monotone modal logic is known to be (only) NP-complete. We show that this remains true when the logic is extended with aconjunctive and alternation-free fixpoint operators as well as the universal modality; the resulting logic – the aconjunctive alternation-free monotone μ-calculus with the universal modality – contains both concurrent propositional dynamic logic (CPDL) and the alternation-free fragment of game logic as fragments. We obtain our result from a characterization of satisfiability by means of Büchi games with polynomially many Eloise nodes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2019

Completeness for Game Logic

Game logic was introduced by Rohit Parikh in the 1980s as a generalisati...
research
04/27/2023

Pushing the Boundaries of Tractable Multiperspective Reasoning: A Deduction Calculus for Standpoint EL+

Standpoint EL is a multi-modal extension of the popular description logi...
research
08/07/2014

A Logic for Reasoning about Upper Probabilities

We present a propositional logic to reason about the uncertainty of even...
research
05/30/2023

The Alternating-Time μ-Calculus With Disjunctive Explicit Strategies

Alternating-time temporal logic (ATL) and its extensions, including the ...
research
03/08/2021

The Modal Logic of Stepwise Removal

We investigate the modal logic of stepwise removal of objects, both for ...
research
09/11/2021

NP Satisfiability for Arrays as Powers

We show that the satisfiability problem for the quantifier-free theory o...
research
01/19/2019

Moss' logic for ordered coalgebras

We present a finitary coalgebraic logic for T-coalgebras, where T is a l...

Please sign up or login with your details

Forgot password? Click here to reset