Arne Meier

J. Artif. Intell. Res., 2024

Synchronous Team Semantics for Temporal Logics.

[BibT_eX]

[DOI]

CoRR, 2024

A SUBSET-SUM Characterisation of the A-Hierarchy.

[BibT_eX]

[DOI]

Jan Gutleben

CoRR, 2024

Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Rejection in Abstract Argumentation: Harder Than Acceptance?

[BibT_eX]

[DOI]

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Submodel Enumeration for CTL Is Hard.

[BibT_eX]

[DOI]

Nicolas Fröhlich

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Parameterised Counting in Logspace.

[BibT_eX]

[DOI]

Anselm Haak

Om Prakash

B. V. Raghavendra Rao

Algorithmica, October, 2023

Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2023

Parameterized Complexity of Weighted Team Definability.

[BibT_eX]

[DOI]

CoRR, 2023

Logics with Probabilistic Team Semantics and the Boolean Negation.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

A parameterized view on the complexity of dependence and independence logic.

[BibT_eX]

[DOI]

Juha Kontinen

J. Log. Comput., 2022

Enumerating teams in first-order team logics.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2022

Parameterised complexity of model checking and satisfiability in propositional dependence logic.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2022

Temporal Team Semantics Revisited.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

A Parameterized View on the Complexity of Dependence Logic.

[BibT_eX]

[DOI]

Juha Kontinen

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

Submodel Enumeration of Kripke Structures in Modal Logic.

[BibT_eX]

[DOI]

Nicolas Fröhlich

Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022

2021

Parameterized complexity of abduction in Schaefer's framework.

[BibT_eX]

[DOI]

J. Log. Comput., 2021

Decomposition-Guided Reductions for Argumentation and Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Knowledge-Base Degrees of Inconsistency: Complexity and Counting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2020

Incremental FPT Delay.

[BibT_eX]

[DOI]

Algorithms, 2020

Parameterised Complexity of Abduction in Schaefer's Framework.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

Parametrised enumeration.

[BibT_eX]

[DOI]

, 2020

2019

Model checking and validity in propositional and modal inclusion logics.

[BibT_eX]

[DOI]

J. Log. Comput., 2019

Parameterised Complexity for Abduction.

[BibT_eX]

[DOI]

CoRR, 2019

Parameterised Counting Classes with Bounded Nondeterminism.

[BibT_eX]

[DOI]

Anselm Haak

Om Prakash

B. V. Raghavendra Rao

CoRR, 2019

Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.

[BibT_eX]

[DOI]

CoRR, 2019

Parameterised Enumeration for Modification Problems.

[BibT_eX]

[DOI]

Raïda Ktari

Frédéric Olive

Algorithms, 2019

Backdoors for Linear Temporal Logic.

[BibT_eX]

[DOI]

Algorithmica, 2019

The model checking fingerprints of CTL operators.

[BibT_eX]

[DOI]

Andreas Krebs

Martin Mundhenk

Acta Informatica, 2019

2018

Enumeration in Incremental FPT-Time.

[BibT_eX]

[DOI]

CoRR, 2018

Approximation and dependence via multiteam semantics.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2018

Team Semantics for the Specification and Verification of Hyperproperties.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Enumeration Complexity of Poor Man's Propositional Dependence Logic.

[BibT_eX]

[DOI]

Christian Reinbold

Proceedings of the Foundations of Information and Knowledge Systems, 2018

Probabilistic Team Semantics.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2018

2017

Parametrised Complexity of Satisfiability in Temporal Logic.

[BibT_eX]

[DOI]

Irena Schindler

ACM Trans. Comput. Log., 2017

Paradigms for Parameterized Enumeration.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

2016

Strong Backdoors for Linear Temporal Logic.

[BibT_eX]

[DOI]

CoRR, 2016

Strong Backdoors for Default Logic.

[BibT_eX]

[DOI]

Irina Schindler

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015

Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

Parallel Computational Tree Logic.

[BibT_eX]

[DOI]

Andreas Krebs

Jonni Virtema

CoRR, 2015

On the parameterized complexity of non-monotonic logics.

[BibT_eX]

[DOI]

Arch. Math. Log., 2015

LTL Fragments are Hard for Standard Parameterisations.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

A Team Based Variant of CTL.

[BibT_eX]

[DOI]

Andreas Krebs

Jonni Virtema

Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

Modal Inclusion Logic: Being Lax is Simpler than Being Strict.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem.

[BibT_eX]

[DOI]

Irina Schindler

Proceedings of the Language and Automata Theory and Applications, 2015

Parameterized Enumeration for Modification Problems.

[BibT_eX]

[DOI]

Raïda Ktari

Frédéric Olive

Proceedings of the Language and Automata Theory and Applications, 2015

Komplexität von Algorithmen.

[BibT_eX]

[DOI]

Mathematik für Anwendungen 4, Lehmanns Media, ISBN: 978-3-86541-761-9, 2015

2014

Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies.

[BibT_eX]

[DOI]

Irina Schindler

Electron. Colloquium Comput. Complex., 2014

2013

Generalized satisfiability for the description logic ALC.

[BibT_eX]

[DOI]

Thomas Schneider

Theor. Comput. Sci., 2013

Parameterized Enumeration with Ordering.

[BibT_eX]

[DOI]

Raïda Ktari

Frédéric Olive

CoRR, 2013

Extended Modal Dependence Logic.

[BibT_eX]

[DOI]

Johannes Ebbing

Lauri Hella

Jonni Virtema

Proceedings of the Logic, Language, Information, and Computation, 2013

2012

The Complexity of Reasoning for Fragments of Autoepistemic Logic.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2012

The complexity of reasoning for fragments of default logic.

[BibT_eX]

[DOI]

J. Log. Comput., 2012

Complexity of Model Checking for Logics over Kripke models.

[BibT_eX]

[DOI]

Martin Mundhenk

Bull. EATCS, 2012

Generalized Complexity of ALC Subsumption

[BibT_eX]

[DOI]

CoRR, 2012

On the Parameterized Complexity of Default Logic and Autoepistemic Logic.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Modal Logic 9, 2012

2011

Model Checking CTL is Almost Always Inherently Sequential

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2011

Proof complexity of propositional default logic.

[BibT_eX]

[DOI]

Arch. Math. Log., 2011

Generalized Satisfiability for the Description Logic ALC - (Extended Abstract).

[BibT_eX]

[DOI]

Thomas Schneider

Proceedings of the Theory and Applications of Models of Computation, 2011

On the Complexity of Modal Logic Variants and their Fragments.

[BibT_eX]

[DOI]

Cuvillier, ISBN: 978-3-86955-929-2, 2011

2010

The complexity of satisfiability for fragments of hybrid logic - Part I.

[BibT_eX]

[DOI]

J. Appl. Log., 2010

The Complexity of Satisfiability for Sub-Boolean Fragments of ALC.

[BibT_eX]

[DOI]