Pages that link to "Item:Q5902190"

The following pages link to A Road Map of Interval Temporal Logics and Duration Calculi (Q5902190):

Displaying 40 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)
• Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers (Q391115) (← links)
• Interval temporal logics over strongly discrete linear orders: expressiveness and complexity (Q477203) (← links)
• Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions (Q636267) (← links)
• An optimal decision procedure for right propositional neighborhood logic (Q877892) (← links)
• On the interpretability of arithmetic in temporal logic (Q915718) (← links)
• Algebraic neighbourhood logic (Q929966) (← links)
• Developing bounded reasoning (Q1006510) (← 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)
• Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
• Computational complexity of hybrid interval temporal logics (Q2084954) (← links)
• Guest editors' preface to special issue on interval temporal logics (Q2251123) (← 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)
• On coarser interval temporal logics (Q2321249) (← links)
• Hybrid fragments of Halpern-Shoham logic and their expressive power (Q2334600) (← links)
• Logic of simultaneity (Q2390846) (← links)
• A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
• Temporal prepositions and their logic (Q2457655) (← links)
• A general tableau method for propositional interval temporal logics: theory and implementation (Q2506829) (← links)
• Why Systems of Temporal Logic Are Sometimes (Un)useful? (Q2814135) (← links)
• Two-sorted point-interval temporal logics (Q2825405) (← links)
• Dyck algebras, interval temporal logic, and posets of intervals (Q2827488) (← links)
• Decidability of a hybrid duration calculus (Q2867952) (← links)
• Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders (Q3010361) (← links)
• (Q4904145) (← links)
• Computational complexity of a core fragment of Halpern-Shoham logic (Q5079792) (← links)
• On a Temporal Logic of Prefixes and Infixes. (Q5089182) (← links)
• Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic (Q5224503) (← links)
• Interval Temporal Logic Semantics of Box Algebra (Q5404934) (← links)
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5918962) (← links)
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5925549) (← links)
• Correction (Q6044359) (← links)
• Expressive completeness by separation for discrete time interval temporal logic with expanding modalities (Q6551701) (← links)
• A temporal logic for successive events (Q6562543) (← links)
• Unary and two-variable interval logics (Q6601763) (← links)
• Neural-symbolic temporal decision trees for multivariate time series classification (Q6647752) (← links)
• Adding the relation \textit{Meets} to the temporal logic of prefixes and infixes makes it EXPSPACE-complete (Q6649523) (← links)