The complexity of identifying characteristic formulae
From MaRDI portal
Publication:1987735
DOI10.1016/J.JLAMP.2020.100529zbMath1433.68163OpenAlexW3008129045MaRDI QIDQ1987735
Adrian Francalanza, Luca Aceto, Anna Ingólfsdóttir, Antonis Achilleos
Publication date: 15 April 2020
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2020.100529
computational complexitymodal logic\(\mu\)-calculuscompletenesscharacteristic formulaeHennessy-Milner logic with recursion
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- An automata theoretic decision procedure for the propositional mu- calculus
- A guide to completeness and complexity for modal logics of knowledge and belief
- Relative complexity of checking and evaluating
- Propositional dynamic logic of regular programs
- Characteristic formulae for processes with divergence
- The completeness problem for modal logic
- Parameterized modal satisfiability
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
- Single step tableaux for modal logics. Computational properties, complexity and methodology
- Finite models constructed from canonical formulas
- Tableau methods of proof for modal logics
- Normal forms in modal logic
- Characteristic formulae for fixed-point semantics: a general framework
- On the unique satisfiability problem
- The extensions of the modal logic K5
- A modal characterization of observational congruence on finite terms of CCS
- Algebraic laws for nondeterminism and concurrency
- Three Partition Refinement Algorithms
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- Towards Syntactic Epistemic Logic
- Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
- Bounded model checking using satisfiability solving
This page was built for publication: The complexity of identifying characteristic formulae
