The following pages link to Pietro Sala (Q288803):
Displaying 50 items.
- Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\) (Q288804) (← links)
- Mining approximate interval-based temporal dependencies (Q329410) (← links)
- Metric propositional neighborhood logic with an equivalence relation (Q329414) (← 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)
- 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)
- Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts (Q1989336) (← links)
- Reactive synthesis from interval temporal logic specifications (Q2062122) (← links)
- Interval-based temporal functional dependencies: specification and verification (Q2251126) (← links)
- On coarser interval temporal logics (Q2321249) (← links)
- A general tableau method for propositional interval temporal logics: theory and implementation (Q2506829) (← links)
- On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures (Q2799202) (← links)
- Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments (Q2817939) (← links)
- Prompt Interval Temporal Logic (Q2835872) (← links)
- The Importance of the Past in Interval Temporal Logics: The Case of Propositional Neighborhood Logic (Q2900471) (← links)
- ON BEGINS, MEETS AND BEFORE (Q2909218) (← links)
- Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals (Q2922038) (← links)
- Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders (Q3010361) (← links)
- (Q3113783) (← links)
- (Q3384174) (← links)
- Tableaux for Logics of Subinterval Structures over Dense Orderings (Q3406687) (← links)
- (Q3457215) (← links)
- A decidable weakening of Compass Logic based on cone-shaped cardinal directions (Q3460410) (← links)
- Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders (Q3532458) (← links)
- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals (Q3587451) (← links)
- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic (Q3590963) (← links)
- A Decidable Spatial Logic with Cone-Shaped Cardinal Directions (Q3644762) (← links)
- A Tableau-Based System for Spatial Reasoning about Directional Relations (Q3648726) (← links)
- Interval vs. Point Temporal Logic Model Checking (Q4617981) (← links)
- Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison (Q4636573) (← links)
- Interval Logics and ωB-Regular Languages (Q4910481) (← links)
- (Q4964728) (← links)
- (Q4986512) (← links)
- Checking Sets of Pure Evolving Association Rules (Q4991927) (← links)
- (Q4995362) (← links)
- (Q5015270) (← links)
- (Q5028481) (← links)
- On a Temporal Logic of Prefixes and Infixes. (Q5089182) (← links)
- Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption (Q5111452) (← links)
- (Q5151001) (← links)
- Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness (Q5271056) (← links)
- Tableau Systems for Logics of Subinterval Structures over Dense Orderings (Q5434480) (← links)
- \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes (Q6077844) (← links)
- Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes (Q6080273) (← links)
- An interval temporal logic characterization of extended \(\omega\)-regular languages (Q6159024) (← links)
- The addition of temporal neighborhood makes the logic of prefixes and sub-intervals \textsc{ExpSpace-complete} (Q6563047) (← links)
- Predictive mining of multi-temporal relations (Q6647763) (← links)
- Adding the relation \textit{Meets} to the temporal logic of prefixes and infixes makes it EXPSPACE-complete (Q6649523) (← links)