Metric propositional neighborhood logic with an equivalence relation
DOI10.1007/S00236-016-0256-3zbMATH Open1350.68185OpenAlexW2038872532MaRDI QIDQ329414FDOQ329414
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
Recommendations
- Metric propositional neighborhood logics: expressiveness, decidability, and undecidability
- scientific article; zbMATH DE number 6602207
- Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
- An optimal decision procedure for MPNL over the integers
- On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cites Work
- Parallel program schemata
- Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
- Title not available (Why is that?)
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
- LTL with the freeze quantifier and register automata
- On the decidability and complexity of Metric Temporal Logic over finite words
- Two variable first-order logic over ordered domains
- Two-variable logic on data words
- A Modal Logic for Chopping Intervals
- On the Decision Problem for Two-Variable First-Order Logic
- Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
- An optimal decision procedure for right propositional neighborhood logic
- On the reachability problem for 5-dimensional vector addition systems
- On languages with two variables
- Two-Variable First-Order Logic with Equivalence Closure
- Small substructures and decidability issues for first-order logic with two variables
- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
- Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
- Automated Reasoning with Analytic Tableaux and Related Methods
- Weak MSO with the unbounding quantifier
Cited In (2)
This page was built for publication: Metric propositional neighborhood logic with an equivalence relation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329414)
