Search filters

Authors whose works are in public domain in at least one jurisdiction

List of works by Michael Thomas

Model Checking CTL is Almost Always Inherently Sequential ⬇️

article by Olaf Beyersdorff et al published 17 May 2011 in Logical Methods in Computer Science

Model Checking CTL is Almost Always Inherently Sequential ⬇️

scholarly article published July 2009

On the Parameterized Complexity of Default Logic and Autoepistemic Logic

On the parameterized complexity of non-monotonic logics

Proof Complexity of Propositional Default Logic ⬇️

Proof complexity of propositional default logic ⬇️

The Complexity of Reasoning for Fragments of Autoepistemic Logic

The Complexity of Reasoning for Fragments of Default Logic ⬇️

The Complexity of Satisfiability for Fragments of CTL and CTL⋆

The complexity of propositional implication

The complexity of satisfiability for fragments of hybrid logic—Part I

Verifying Proofs in Constant Depth ⬇️

Verifying proofs in constant depth ⬇️

Paulina is supported by:

About Paulina

Help