On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues for Propositional Neighborhood Logics (PNLs). We begin by comparing the expressiveness of the different PNLs. Then, we focus on the most expressive one, namely, PNLπ + , and we show that it is decidable over various classes of linear orders by reducing its satisfiability problem to that of the two-variable fragment of first-order logic with binary relations over linearly ordered domains, due to Otto. Next, we prove that PNLπ + is expressively complete with respect to such a fragment. We conclude the paper by comparing PNLπ + expressiveness with that of other interval-based temporal logics.
Keywordsneighbourhood interval logics decidability expressiveness
Unable to display preview. Download preview PDF.
- 4.Bresolin, D., Montanari, A., Sciavicco, G.: An optimal decision procedure for Right Propositional Neighborhood Logic. Journal of Automated Reasoning (2006)Google Scholar
- 14.Kamp, H.: Events, instants and temporal reference. In: Bäuerle, R., Egli, U., Schwarze, C. (eds.) Semantics from different points of view, pp. 376–417. Walter de Gruyter, Berlin (1979)Google Scholar
- 17.Moszkowski, B.: Reasoning about digital circuits. Tech. rep. stan-cs-83-970, Dept. of Computer Science, Stanford University, Stanford, CA (1983)Google Scholar
- 19.Scott, D.: A decision method for validity of sentences in two variables. Journal of Symbolic Logic 27, 377 (1962)Google Scholar
- 20.Shapirovsky, I., Shehtman, V.: Chronological future modality in Minkowski spacetime. In: Balbiani, P., Suzuki, N.Y., Wolter, F., Zakharyaschev, M. (eds.) Advances in Modal Logic, vol. 4, pp. 437–459. King’s College Publications, London (2003)Google Scholar