Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders

Authors:
Dario Della Monica;Valentin Goranko;Guido Sciavicco
Affiliations:
University of Udine, Udine, Italy, and University of Salerno, Salerno, Italy;Technical University of Denmark, Lyngby, Denmark;University of Murcia, Murcia, Spain, and University for Information Science and Technology, Ohrid, Macedonia
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 15
Cited 0

A propositional modal logic of time intervals

Journal of the ACM (JACM)
Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
Maintaining knowledge about temporal intervals

Communications of the ACM
An Adequate First Order Interval Logic

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Linear Duration Invariants

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Decidability of a Hybrid Duration Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Decidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths

SEFM '09 Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
An optimal Tableau-based decision algorithm for propositional neighborhood logic

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Deciding an interval logic with accumulated durations

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A theory of duration calculus with application

Domain modeling and the duration calculus
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Modal strength reduction in quantified discrete duration calculus

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the question of how much hybrid machinery can be added to the interval neighbourhood logic PNL and its metric extension MPNL without losing the decidability of their satisfiability problem in N. In particular, we consider the natural hybrid extension of MPNL obtained by adding binders on integer variables ranging over lengths of intervals, thus enabling storage of the length of the current interval undecidable, which is somewhat surprising, being in contrast with the decidability of MPNL, which can be seen as a hybrid language with length constraints only involving constants over interval lengths. These results show that MPNL itself is, in this sense, a maximal decidable (weakly) hybrid extension of PNL.