Computational complexity of a core fragment of Halpern-Shoham logic

DOI10.4230/LIPICS.TIME.2018.23zbMATH Open1487.68221MaRDI QIDQ5079792FDOQ5079792

Authors: Przemysław Andrzej Wałęga 

Publication date: 28 May 2022

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

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)

Cites Work

• Title not available (Why is that?)
• Expressiveness and completeness of an interval tense logic
• Title not available (Why is that?)
• A propositional modal logic of time intervals
• Title not available (Why is that?)
• A Road Map of Interval Temporal Logics and Duration Calculi
• On expressiveness of Halpern-Shoham logic and its Horn fragments
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic

Cited In (3)

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

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)