Beyond regularity for Presburger modal logics

MaRDI QIDQ5419877zbMATH OpenFDO

Authors Facundo Carreiro, Stéphane Demri

Publication date 11 June 2014

zbMATH Keywords

context-free constraintdecidabilityPresburger constraint

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45)

Recommendations

• Complexity of modal logics with Presburger constraints
• Presburger Modal Logic Is PSPACE-Complete
• An automata-theoretic approach to constraint LTL
• The effects of bounding syntactic resources on Presburger LTL
• Propositional dynamic logic with recursive programs

Cited in

(4)

• Complexity of modal logics with Presburger constraints
• Presburger Modal Logic Is PSPACE-Complete
• scientific article; zbMATH DE number 6287612 (Why is no real title available?)
• Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features

This page was built for publication: Beyond regularity for Presburger modal logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419877)