The following pages link to Nicola Gigante (Q2029607):
Displayed 15 items.
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\) (Q2029608) (← links)
- \(\mathsf{GR}(1)\) is equivalent to \(\mathsf{R}(1)\) (Q2094389) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- A SAT-based encoding of the one-pass and tree-shaped tableau system for LTL (Q2180503) (← links)
- On timeline-based games and their complexity (Q2310766) (← links)
- Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform (Q2799209) (← links)
- (Q3384889) (← links)
- A One-Pass Tree-Shaped Tableau for LTL+Past (Q4645753) (← links)
- (Q5079781) (← links)
- Fairness, assumptions, and guarantees for extended bounded response \textsf{LTL+P} synthesis (Q6045063) (← links)
- Complexity of qualitative timeline-based planning (Q6060102) (← links)
- Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker (Q6080272) (← links)
- A first-order logic characterization of safety and co-safety languages (Q6135783) (← links)
- A first-order logic characterisation of safety and co-safety languages (Q6181931) (← links)
- (Q6191013) (← links)