About the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders: A New Study of Its Computability
- 79 Downloads
This article considers the temporal logic of the lexicographic products of unbounded dense linear orders and provides via mosaics a new proof of the membership in NP of the satisfiability problem it gives rise to.
KeywordsLinear temporal logic Lexicographic product Satisfiability problem Decidability Complexity Mosaic method Decision procedure
The author makes a point of thanking his colleagues of the Institut de recherche en informatique de Toulouse as well as the participants of the 8th International Workshop on Logic and Cognition who, by their comments and their suggestions, contributed to the development of the present paper. We also make a point of thanking the referees for their feedback.
- Balbiani, P. 2008. Time representation and temporal reasoning from the perspective of non-standard analysis. In Eleventh International Conference on Principles of Knowledge Representation and Reasoning. AAAI ed. G. Brewka, and J. Lang, 695–704.Google Scholar
- Balbiani, P. 2009. Axiomatization and completeness of lexicographic products of modal logics. In Frontiers of Combining Systems, ed. S. Ghilardi, and R. Sebastiani, 165–180. Berlin: Springer.Google Scholar
- Balbiani, P. 2010. Axiomatizing the temporal logic defined over the class of all lexicographic products of dense linear orders without endpoints. In Temporal Representation and Reasoning, ed. N. Markey, and J. Wijsen, 19–26. IEEE.Google Scholar
- Balbiani, P., and I. Shapirovsky. 2019. Complete axiomatizations of lexicographic sums and products of modal logics. In preparation. Google Scholar
- Euzenat, J., and A. Montanari. 2005. Time granularity. In Handbook of Temporal Reasoning in Artificial Intelligence, ed. M. Fisher, D. Gabbay, and L. Vila, 59–118. Amsterdam: Elsevier.Google Scholar
- Gabbay, D., A. Pnueli, S. Shelah, and J. Stavi. 1980. On the temporal analysis of fairness. In Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 163–173. New York: ACM.Google Scholar
- Gabbay, D., A. Kurucz, F. Wolter, and M. Zakharyaschev. 2003. Many-Dimensional Modal Logics: Theory and Applications. Amsterdam: Elsevier.Google Scholar
- Kurucz, A. 2007. Combining modal logics. In Handbook of Modal Logic, ed. P. Blackburn, J. van Benthem, and F. Wolter, 869–924. Amsterdam: Elsevier.Google Scholar
- Marx, M., and Y. Venema. 2007. Local variations on a loose theme: Modal logic and decidability. In Finite Model Theory and Its Applications, ed. E. Grädel, P. Kolaitis, L. Libkin, M. Marx, J. Spencer, M. Vardi, Y. Venema, and S. Weinstein, 371–429. Berlin: Springer.Google Scholar
- Marx, M., S. Mikulás, and M. Reynolds. 2000. The mosaic method for temporal logics. In Automated Reasoning with Analytic Tableaux and Related Methods, ed. R. Dyckhoff, 324–340. Berlin: Springer.Google Scholar
- Nakamura, K., and A. Fusaoka. 2007. Reasoning about hybrid systems based on a nonstandard model. In AI 2007: Advances in Artificial Intelligence, ed. M. Orgun, and J. Thornton, 749–754. Berlin: Springer.Google Scholar