Computational complexity of a core fragment of Halpern-Shoham logic

DOI10.4230/LIPICS.TIME.2018.23MaRDI QIDQ5079792zbMATHFDO

Authors Przemysław Andrzej Wałęga

Publication date 28 May 2022

zbMATH Keywords

computational complexitytemporal logichybrid logicinterval logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Temporal logic (03B44)

Recommendations

• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
• On expressiveness of Halpern-Shoham logic and its Horn fragments
• Horn fragments of the Halpern-Shoham interval temporal logic
• Hybrid fragments of Halpern-Shoham logic and their expressive power
• On the complexity of fragments of the modal logic of Allen's relations over dense structures

Cites work

• scientific article; zbMATH DE number 67448 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 6131597 (Why is no real title available?)
• A Road Map of Interval Temporal Logics and Duration Calculi
• A propositional modal logic of time intervals
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
• Expressiveness and completeness of an interval tense logic
• On expressiveness of Halpern-Shoham logic and its Horn fragments

Cited in

(4)

• Computational complexity of hybrid interval temporal logics
• Horn fragments of the Halpern-Shoham interval temporal logic
• On expressiveness of Halpern-Shoham logic and its Horn fragments
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic

This page was built for publication: Computational complexity of a core fragment of Halpern-Shoham logic

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