SAT-based explicit LTL f satisfiability checking

Artificial Intelligence 289 (C):103369 (2020)
  Copy   BIBTEX


This article has no associated abstract. (fix it)



    Upload a copy of this work     Papers currently archived: 91,202

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

The complexity of hybrid logics over equivalence relations.Martin Mundhenk & Thomas Schneider - 2009 - Journal of Logic, Language and Information 18 (4):493-514.
Knowing and Checking: An Epistemological Investigation.Guido Melchior - 2019 - New York City, New York, USA: Routledge.
Hypergraph Satisfiability.R. Cowen - 1991 - Reports on Mathematical Logic.
A decidable timeout-based extension of linear temporal logic.Janardan Misra & Suman Roy - 2014 - Journal of Applied Non-Classical Logics 24 (3):262-291.
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.
Combinatorial Analytic Tableaux.Robert Cowen - 1993 - Reports on Mathematical Logic:29-39.


Added to PP

15 (#893,994)

6 months
6 (#431,022)

Historical graph of downloads
How can I increase my downloads?

Author's Profile