Pages that link to "Item:Q1889855"
From MaRDI portal
The following pages link to Past is for free: On the complexity of verifying linear temporal properties with past (Q1889855):
Displaying 12 items.
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Social bot detection as a temporal logic model checking problem (Q2148829) (← links)
- Past is for free: on the complexity of verifying linear temporal properties with past (Q2842605) (← links)
- Some modal aspects of XPath (Q2901192) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ (Q3646173) (← links)
- Results on the glory of the past (Q3976046) (← links)
- The Complexity of Satisfiability for Fragments of CTL and CTL⋆ (Q4982095) (← links)
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (Q4982126) (← links)
- AN NP-COMPLETE FRAGMENT OF LTL (Q5462673) (← links)