The following pages link to Angelo Montanari (Q266859):
Displaying 50 items.
- A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases (Q266861) (← links)
- 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)
- 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)
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions (Q636267) (← links)
- Embedding time granularity in a logical specification language for synchronous real-time systems (Q685609) (← links)
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- Constraining cycle alternations in model checking for interval temporal logic (Q737106) (← links)
- Complexity analysis of a unifying algorithm for model checking interval temporal logic (Q821561) (← links)
- Compact and tractable automaton-based representations of time granularities (Q875518) (← links)
- An optimal decision procedure for right propositional neighborhood logic (Q877892) (← links)
- Two-sorted metric temporal logics (Q1391098) (← links)
- Modal deduction in second-order logic and set theory. II (Q1577355) (← links)
- Temporal representation and reasoning in artificial intelligence: Issues and approaches (Q1601842) (← links)
- A graph-theoretic approach to efficiently reason about partially ordered events in (Modal) Event Calculus (Q1601877) (← links)
- Alternative translation techniques for propositional and first-order modal logics (Q1610677) (← 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)
- Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals (Q1740653) (← links)
- Branching within time: An expressively complete and elementarily decidable temporal logic for time granularity (Q1768798) (← links)
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
- Decidability results for metric and layered temporal logics (Q1815429) (← links)
- A set-theoretic translation method for polymodal logics (Q1904398) (← links)
- Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts (Q1989336) (← links)
- Timeline-based planning over dense temporal domains (Q1989337) (← links)
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\) (Q2029608) (← links)
- Reactive synthesis from interval temporal logic specifications (Q2062122) (← links)
- Complexity issues for timeline-based planning over dense time under future and minimal semantics (Q2067619) (← 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)
- Model checking interval temporal logics with regular expressions (Q2182727) (← 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 timeline-based games and their complexity (Q2310766) (← links)
- Definability and decidability of binary predicates for time granularity (Q2495389) (← links)
- A general tableau method for propositional interval temporal logics: theory and implementation (Q2506829) (← links)
- (Q2772445) (← 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)
- A Tableau System for Right Propositional Neighborhood Logic over Finite Linear Orders: An Implementation (Q2851934) (← links)
- An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics (Q2870111) (← links)
- The Importance of the Past in Interval Temporal Logics: The Case of Propositional Neighborhood Logic (Q2900471) (← links)
- Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals (Q2922038) (← links)
- On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders (Q2938500) (← links)
- A graph-theoretic approach to map conceptual designs to XML schemas (Q2943526) (← links)
- Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability (Q2999204) (← links)
