Metric propositional neighborhood logic with an equivalence relation

DOI10.1007/S00236-016-0256-3MaRDI QIDQ329414zbMATH OpenOpenAlexFDO

Authors Angelo Montanari, Marco Pazzaglia, Pietro Sala

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

Mathematics Subject Classification ID

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)

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

Cites work

• A Modal Logic for Chopping Intervals
• A general tableau method for propositional interval temporal logics
• Adding an equivalence relation to the interval logic \(AB\bar{B}\): complexity and expressiveness
• An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
• An optimal decision procedure for right propositional neighborhood logic
• Decidability of the interval temporal logic \(\operatorname{AB\overline{B}}\) over the natural numbers
• LTL with the freeze quantifier and register automata
• Metric propositional neighborhood logics: expressiveness, decidability, and undecidability
• On languages with two variables
• On the Decision Problem for Two-Variable First-Order Logic
• On the decidability and complexity of Metric Temporal Logic over finite words
• On the reachability problem for 5-dimensional vector addition systems
• Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
• Parallel program schemata
• Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
• Small substructures and decidability issues for first-order logic with two variables
• Two variable first-order logic over ordered domains
• Two-variable first-order logic with equivalence closure
• Two-variable logic on data words
• Weak MSO with the unbounding quantifier

Cited in

(7)

• The importance of the past in interval temporal logics: the case of propositional neighborhood logic
• Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
• An optimal decision procedure for MPNL over the integers
• A Note on C² Interpreted over Finite Data-Words
• Hybrid metric propositional neighborhood logics with interval length binders
• Bounded variability of metric temporal logic
• Metric propositional neighborhood logics: expressiveness, decidability, and undecidability

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)