Presburger Modal Logic Is PSPACE-Complete

DOI10.1007/11814771_44zbMath1222.03024OpenAlexW1590721921MaRDI QIDQ3613433

Stéphane P. Demri, Denis Lugiez

Publication date: 12 March 2009

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11814771_44

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Complexity of modal logics with Presburger constraints ⋮ A finite model construction for coalgebraic modal logic ⋮ Reasoning with Global Assumptions in Arithmetic Modal Logics ⋮ Coalgebraic semantics of modal logics: an overview ⋮ \(\mathcal{ALCQPI}_{R^+}\): rational grading in an expressive description logic with inverse and transitive roles and counting ⋮ Coalgebraic Hybrid Logic ⋮ CoLoSS: The Coalgebraic Logic Satisfiability Solver

This page was built for publication: Presburger Modal Logic Is PSPACE-Complete