Computational complexity of hybrid interval temporal logics

Annals of Pure and Applied Logic 174 (1):103165 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2022.103165

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Proof complexity of substructural logics.Raheleh Jalali - 2021 - Annals of Pure and Applied Logic 172 (7):102972.
Fragments of rst-order temporal logics.I. Hodkinson, F. Wolter & M. Zakharyaschev - forthcoming - Annals of Pure and Applied Logic.
The computational complexity of module socles.Huishan Wu - 2022 - Annals of Pure and Applied Logic 173 (5):103089.
The computational complexity of hybrid temporal logics.C. Areces, P. Blackburn & M. Marx - 2000 - Logic Journal of the IGPL 8 (5):653-679.
On the proof complexity of logics of bounded branching.Emil Jeřábek - 2023 - Annals of Pure and Applied Logic 174 (1):103181.
On the computational complexity of the theory of Abelian groups.Libo Lo - 1988 - Annals of Pure and Applied Logic 37 (3):205-248.
Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity.Daniel Leivant - 1999 - Annals of Pure and Applied Logic 96 (1-3):209-229.
Arithmetical complexity of fuzzy predicate logics—a survey II.Petr Hájek - 2010 - Annals of Pure and Applied Logic 161 (2):212-219.
The complexity of temporal logic over the reals.Mark Reynolds - 2010 - Annals of Pure and Applied Logic 161 (8):1063-1096.
Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions.Davide Bresolin, Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2010 - Annals of Pure and Applied Logic 161 (3):289-304.

Analytics

Added to PP
2022-07-13

Downloads
39 (#421,361)

6 months
23 (#124,937)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Modal logic with names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
Towards a general theory of action and time.James F. Allen - 1984 - Artificial Intelligence 23 (2):123-154.
Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.

View all 12 references / Add more references