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

DOI10.1007/978-3-662-54069-5_17MaRDI QIDQ5224503zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Computational complexity of a core fragment of Halpern-Shoham logic
• The complexity of Horn fragments of linear logic
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• Hybrid fragments of Halpern-Shoham logic and their expressive power
• The complexity of satisfiability for fragments of hybrid logic. I.
• scientific article; zbMATH DE number 4085614
• On expressiveness of Halpern-Shoham logic and its Horn fragments
• Complexity of hybrid logics over transitive frames
• The complexity of hybrid logics over equivalence relations
• scientific article; zbMATH DE number 1114332

Cites work

• A propositional modal logic of time intervals
• A Road Map of Interval Temporal Logics and Duration Calculi
• Horn fragments of the Halpern-Shoham interval temporal logic
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 6131597 (Why is no real title available?)
• Maintaining knowledge about temporal intervals
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• Sub-propositional fragments of the interval temporal logic of Allen's relations
• The computational complexity of hybrid temporal logics

Cited in

(7)

• Computational complexity of hybrid interval temporal logics
• Hybrid fragments of Halpern-Shoham logic and their expressive power
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• The computational complexity of hybrid temporal logics
• Computational complexity of a core fragment of Halpern-Shoham logic
• Horn fragments of the Halpern-Shoham interval temporal logic
• On expressiveness of Halpern-Shoham logic and its Horn fragments

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

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