Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic

DOI10.1007/978-3-662-54069-5_17zbMath1485.03044OpenAlexW2558767970MaRDI QIDQ5224503

Przemysław Andrzej Wałęga

Publication date: 24 July 2019

Published in: Logic and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54069-5_17

zbMATH Keywords

computational complexityhybrid logicinterval logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Temporal logic (03B44)

Related Items (3)

Unnamed Item ⋮ Computational complexity of hybrid interval temporal logics ⋮ Hybrid fragments of Halpern-Shoham logic and their expressive power

Cites Work

• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations
• A propositional modal logic of time intervals
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• The computational complexity of hybrid temporal logics
• Horn Fragments of the Halpern-Shoham Interval Temporal Logic
• A Road Map of Interval Temporal Logics and Duration Calculi

This page was built for publication: Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic