Metric propositional neighborhood logic with an equivalence relation
From MaRDI portal
Publication:329414
DOI10.1007/s00236-016-0256-3zbMath1350.68185OpenAlexW2038872532MaRDI QIDQ329414
Pietro Sala, Angelo Montanari, Marco Pazzaglia
Publication date: 21 October 2016
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11390/1110493
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)
Related Items
Cites Work
- Unnamed Item
- Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
- Weak MSO with the unbounding quantifier
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
- An optimal decision procedure for right propositional neighborhood logic
- On the reachability problem for 5-dimensional vector addition systems
- Parallel program schemata
- Two variable first-order logic over ordered domains
- Small substructures and decidability issues for first-order logic with two variables
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
- A Modal Logic for Chopping Intervals
- On languages with two variables
- On the Decision Problem for Two-Variable First-Order Logic
- Automated Reasoning with Analytic Tableaux and Related Methods
- Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
- On the decidability and complexity of Metric Temporal Logic over finite words
- Two-Variable First-Order Logic with Equivalence Closure
