Computational complexity of hybrid interval temporal logics

DOI10.1016/j.apal.2022.103165OpenAlexW4285009574MaRDI QIDQ2084954

Przemysław Andrzej Wałęga

Publication date: 14 October 2022

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2022.103165

zbMATH Keywords

computational complexityhybrid logictemporal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Logic in computer science (03B70) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases
• Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
• Arthur Prior and `now'
• Dual tableaux. Foundations, methodology, case studies
• Towards a general theory of action and time
• Temporal constraint networks
• Modal logic with names
• The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT
• Expressiveness and completeness of an interval tense logic
• Computational complexity of core fragments of modal logics \(\mathrm{t}\), \(\mathrm{K4}\), and \(\mathrm{S4}\)
• Hybrid fragments of Halpern-Shoham logic and their expressive power
• A general tableau method for propositional interval temporal logics: theory and implementation
• On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures
• Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations
• The complexity of temporal constraint satisfaction problems
• Relational dual tableaux for interval temporal logics ★
• A Modal Logic for Chopping Intervals
• Hybrid languages and temporal logic
• A propositional modal logic of time intervals
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• The computational complexity of hybrid temporal logics
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
• Horn Fragments of the Halpern-Shoham Interval Temporal Logic
• The Undecidability of the Logic of Subintervals
• A Road Map of Interval Temporal Logics and Duration Calculi

This page was built for publication: Computational complexity of hybrid interval temporal logics