Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders

DOI10.1016/j.entcs.2011.06.009zbMath1260.03040OpenAlexW2114803784WikidataQ113318258 ScholiaQ113318258MaRDI QIDQ4917076

Guido Sciavicco, Dario Della Monica, Valentin F. Goranko

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.06.009

zbMATH Keywords

undecidabilitytilinghybrid logicsinterval length bindersinterval neighbourhood logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Combined logics (03B62)

Uses Software

• IDLVALID

Cites Work

• Maintaining knowledge about temporal intervals
• Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
• A calculus of durations
• Reversibility and surjectivity problems of cellular automata
• Duration calculus: Logical foundations
• Duration calculus. A formal approach to real-time systems.
• Interval Duration Logic
• Decidability of a Hybrid Duration Calculus
• Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
• A Theory of Duration Calculus with Application
• Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals
• An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
• A propositional modal logic of time intervals
• On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
• Decidable and Undecidable Fragments of Halpern and Shoham’s Interval Temporal Logic: Towards a Complete Classification
• Deciding an Interval Logic with Accumulated Durations
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Computer Aided Verification