Parametrised Complexity of Satisfiability in Temporal Logic - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Martin Lück, Arne Meier, Irena Schindler. Parametrised Complexity of Satisfiability in Temporal Logic. ACM Trans. Comput. Log., 18(1), 2017. [doi]

The following publications are possibly variants of this publication:

The complexity of satisfiability for fragments of hybrid logic - Part IArne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Volker Weber, Felix Weiss. japll, 8(4):409-421, 2010. [doi]

The Complexity of Satisfiability for Fragments of Hybrid Logic-Part IArne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss. mfcs 2009: 587-599 [doi]

runs on WebDSL