Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Kamp (1979)
Events, Instants and Temporal Reference
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Expressiveness of the Interval Logics of Allen’s Relations on the Class of all Linear Orders: Complete Classification ∗
Davide Bresolin, Dario Monica, V. Goranko, A. Montanari, G. Sciavicco (2009)
Undecidability of Interval Temporal Logics with the Overlap Modality2009 16th International Symposium on Temporal Representation and Reasoning
A. Montanari, G. Puppis, P. Sala (2009)
A Decidable Spatial Logic with Cone-Shaped Cardinal Directions
V Goranko, A Montanari, P Sala, G Sciavicco (2006)
A general tableau method for propositional interval temporal logics: theory and implementationJournal of Applied Logic, 4
K. Etessami, Moshe Vardi, T. Wilke (1997)
First-order logic with two variables and unary temporal logicProceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
K Etessami, MY Vardi, T Wilke (2002)
First-order logic with two variables and unary temporal logicInf. Comput., 179
V. Goranko, A. Montanari, G. Sciavicco (2004)
A Road Map of Interval Temporal Logics and Duration CalculiJournal of Applied Non-Classical Logics, 14
James Allen (1983)
Maintaining knowledge about temporal intervalsCommun. ACM, 26
W. Szwast, Lidia Tendera (2004)
The guarded fragment with transitive guardsAnn. Pure Appl. Log., 128
M. Otto (2001)
Two variable first-order logic over ordered domainsJournal of Symbolic Logic, 66
Davide Bresolin, A. Montanari, P. Sala, G. Sciavicco (2011)
What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL2011 IEEE 26th Annual Symposium on Logic in Computer Science
J. Marcinkowski, Jakub Michaliszyn (2011)
The Ultimate Undecidability Result for the Halpern-Shoham Logic2011 IEEE 26th Annual Symposium on Logic in Computer Science
J. Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski (2010)
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable
D. Gabbay, A. Pnueli, S. Shelah, J. Stavi (1980)
On the temporal analysis of fairness
E. Grädel (2001)
Why are Modal Logics so Robustly Decidable?
V. Goranko, A. Montanari, G. Sciavicco (2003)
Propositional Interval Neighborhood Temporal LogicsJ. Univers. Comput. Sci., 9
I. Hodkinson, A. Montanari, G. Sciavicco (2008)
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
A. Montanari, G. Puppis, P. Sala (2010)
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals
Y. Venema (1991)
A Modal Logic for Chopping IntervalsJ. Log. Comput., 1
Dario Monica (2011)
Expressiveness, decidability, and undecidability of interval temporal logic
Davide Bresolin, Dario Monica, V. Goranko, A. Montanari, G. Sciavicco (2008)
Decidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification
N. Immerman, D. Kozen (1989)
Definability with Bounded Number of Bound VariablesInf. Comput., 83
A. Montanari, A. Peron, A. Policriti (2002)
Extending Kamp's Theorem to Model Time GranularityJ. Log. Comput., 12
Georgios Fainekos, H. Kress-Gazit, George Pappas (2005)
Temporal Logic Motion Planning for Mobile RobotsProceedings of the 2005 IEEE International Conference on Robotics and Automation
Y. Venema (1990)
Expressiveness and Completeness of an Interval Tense LogicNotre Dame J. Formal Log., 31
Joseph Halpern, Y. Shoham (1991)
A propositional modal logic of time intervals
A. Montanari, G. Puppis, P. Sala, G. Sciavicco (2009)
Decidability of the Interval Temporal Logic ABB over the Natural Numbers
H. Andréka, J. Benthem, I. Németi (1995)
Back and Forth Between Modal Logic and Classical LogicLog. J. IGPL, 3
D Bresolin, D Della Monica, V Goranko, A Montanari, G Sciavicco (2012)
Metric propositional neighborhood logicsJ. Soft. Syst. Mod.
E. Börger, E. Grädel, Y. Gurevich (1997)
The Classical Decision Problem
Davide Bresolin, A. Montanari, P. Sala, G. Sciavicco (2008)
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
D. Gabbay, I. Hodkinson, Mark Reynolds (1994)
Temporal Logic Mathematical Foundations and Computational Aspects
V. Goranko, A. Montanari, G. Sciavicco (2003)
A General Tableau Method for Propositional Interval Temporal Logics
Davide Bresolin, V. Goranko, A. Montanari, G. Sciavicco (2009)
Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensionsAnn. Pure Appl. Log., 161
Dario Monica, V. Goranko, G. Sciavicco (2011)
Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders
Decidability and complexity of the satisfiability problem for the logics of time intervals have been extensively studied in the recent years. Even though most interval logics turn out to be undecidable, meaningful exceptions exist, such as the logics of temporal neighborhood and (some of) the logics of the subinterval relation. In this paper, we explore a different path to decidability: instead of restricting the set of modalities or imposing severe semantic restrictions, we take the most expressive interval temporal logic studied so far, namely, Venema’s CDT, and we suitably limit the negation depth of modalities. The decidability of the satisfiability problem for the resulting fragment, called CDTBS, over the class of all linear orders, is proved by embedding it into a well-known decidable quantifier prefix class of first-order logic, namely, Bernays-Schönfinkel class. In addition, we show that CDTBS is in fact NP-complete (Bernays-Schönfinkel class is NEXPTIME-complete), and we prove its expressive completeness with respect to a suitable fragment of Bernays-Schönfinkel class. Finally, we show that any increase in the negation depth of CDTBS modalities immediately yields undecidability.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Mar 9, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.