Hybrid fragments of Halpern-Shoham logic and their expressive power
From MaRDI portal
Publication:2334600
Recommendations
- On expressiveness of Halpern-Shoham logic and its Horn fragments
- Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
- Bounded-Variable Fragments of Hybrid Logics
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
- The expressibility of fragments of hybrid graph logic on finite digraphs
- The bounded fragment and hybrid logic with polyadic modalities
- The complexity of satisfiability for fragments of hybrid logic. I.
- Hybridized paracomplete and paraconsistent logics
- Hybrid logics: Characterization, interpolation and complexity
- A Hybrid Intuitionistic Logic: Semantics and Decidability
Cites work
- A propositional modal logic of time intervals
- A Road Map of Interval Temporal Logics and Duration Calculi
- Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
- Expressiveness and completeness of an interval tense logic
- Fast(er) reasoning in interval temporal logic
- Horn fragments of the Halpern-Shoham interval temporal logic
- scientific article; zbMATH DE number 67448 (Why is no real title available?)
- scientific article; zbMATH DE number 6131597 (Why is no real title available?)
- Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
- Maintaining knowledge about temporal intervals
- On the complexity of fragments of the modal logic of Allen's relations over dense structures
- On the expressiveness of the interval logic of Allen's relations over finite and discrete linear orders
- 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
- The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT
Cited in
(6)- Computational complexity of hybrid interval temporal logics
- The expressibility of fragments of hybrid graph logic on finite digraphs
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
- Computational complexity of a core fragment of Halpern-Shoham logic
- Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic
- On expressiveness of Halpern-Shoham logic and its Horn fragments
This page was built for publication: Hybrid fragments of Halpern-Shoham logic and their expressive power
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334600)