Pages that link to "Item:Q3587451"

The following pages link to Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals (Q3587451):

Displaying 22 items.

• A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases (Q266861) (← links)
• Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\) (Q288804) (← links)
• Checking interval properties of computations (Q329413) (← links)
• Interval temporal logics over strongly discrete linear orders: expressiveness and complexity (Q477203) (← links)
• Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives (Q1706170) (← links)
• Which fragments of the interval temporal logic HS are tractable in model checking? (Q1731517) (← links)
• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals (Q1740653) (← links)
• Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
• Reactive synthesis from interval temporal logic specifications (Q2062122) (← links)
• The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT (Q2251124) (← links)
• The dark side of interval temporal logic: marking the undecidability border (Q2251125) (← links)
• Interval-based temporal functional dependencies: specification and verification (Q2251126) (← links)
• On coarser interval temporal logics (Q2321249) (← links)
• Two-sorted Point-Interval Temporal Logics (Q2825405) (← links)
• Complexity Hierarchies beyond Elementary (Q2828216) (← links)
• Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations (Q2938489) (← links)
• On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders (Q2938500) (← links)
• Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders (Q3010361) (← links)
• Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders (Q4917076) (← links)
• (Q5079773) (← links)
• The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
• An interval temporal logic characterization of extended \(\omega\)-regular languages (Q6159024) (← links)