The following pages link to (Q2766545):
Displaying 16 items.
- 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)
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions (Q636267) (← links)
- Complexity analysis of a unifying algorithm for model checking interval temporal logic (Q821561) (← links)
- An optimal decision procedure for right propositional neighborhood logic (Q877892) (← links)
- Which fragments of the interval temporal logic HS are tractable in model checking? (Q1731517) (← links)
- The dark side of interval temporal logic: marking the undecidability border (Q2251125) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments (Q2817939) (← links)
- Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings (Q3185763) (← links)
- A Decidable Spatial Logic with Cone-Shaped Cardinal Directions (Q3644762) (← links)
- Interval vs. Point Temporal Logic Model Checking (Q4617981) (← links)
- Complete and Terminating Tableau for the Logic of Proper Subinterval Structures Over Dense Orderings (Q4982118) (← links)
- (Q5028481) (← links)
- \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes (Q6077844) (← links)
- An interval temporal logic characterization of extended \(\omega\)-regular languages (Q6159024) (← links)
