Constraint LTL satisfiability checking without automata

Journal of Applied Logic 12 (4):522-557 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,830

External links

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

Through your library

Similar books and articles

Reasoning about sequences of memory states.Rémi Brochenin, Stéphane Demri & Etienne Lozes - 2010 - Annals of Pure and Applied Logic 161 (3):305-323.
Defeasible linear temporal logic.Anasse Chafik, Fahima Cheikh-Alili, Jean-François Condotta & Ivan Varzinczak - 2023 - Journal of Applied Non-Classical Logics 33 (1):1-51.
Galileo Engineer - by Matteo Valleriani.Neil Tarrant - 2011 - Centaurus 53 (4):334-336.

Analytics

Added to PP
2016-06-30

Downloads
27 (#818,040)

6 months
9 (#464,038)

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

Decidable fragments of first-order temporal logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.
Tense Logic and the Theory of Linear Order.Johan Anthony Wilem Kamp - 1968 - Dissertation, University of California, Los Angeles

Add more references