Arne Meier

From MaRDI portal
Revision as of 12:40, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:393135

Available identifiers

zbMath Open meier.arneDBLP38/5700WikidataQ57435594 ScholiaQ57435594MaRDI QIDQ393135

List of research outcomes





PublicationDate of PublicationType
Temporal team semantics revisited2024-12-06Paper
Parameterized complexity of weighted team definability2024-10-16Paper
Strong backdoors for default logic2024-09-25Paper
Strong backdoors for default logic2024-07-10Paper
Logics with probabilistic team semantics and the Boolean negation2024-05-29Paper
Parameterised counting in logspace2023-10-06Paper
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework2023-07-18Paper
https://portal.mardi4nfdi.de/entity/Q58849562023-03-24Paper
A parameterized view on the complexity of dependence and independence logic2023-01-04Paper
A parameterized view on the complexity of dependence logic2022-07-01Paper
Parameterised complexity of model checking and satisfiability in propositional dependence logic2022-02-14Paper
Parameterized complexity of abduction in Schaefer’s framework2022-02-08Paper
Team semantics for the specification and verification of hyperproperties2021-08-04Paper
Parameterised complexity of model checking and satisfiability in propositional dependence logic2020-10-26Paper
Model Checking and Validity in Propositional and Modal Inclusion Logics2020-05-26Paper
Parameterised complexity of abduction in Schaefer's framework2020-05-06Paper
Model checking and validity in propositional and modal inclusion logics2020-02-03Paper
Satisfiability of Modal Inclusion Logic2019-11-22Paper
The model checking fingerprints of CTL operators2019-08-13Paper
Backdoors for linear temporal logic2019-02-14Paper
Approximation and dependence via multiteam semantics2018-09-21Paper
https://portal.mardi4nfdi.de/entity/Q45848922018-09-04Paper
Probabilistic team semantics2018-06-26Paper
Enumeration complexity of poor man's propositional dependence logic2018-06-26Paper
Backdoors for Linear Temporal Logic2018-04-10Paper
Paradigms for parameterized enumeration2017-08-15Paper
Parametrised Complexity of Satisfiability in Temporal Logic2017-07-13Paper
Strong Backdoors for Default Logic2016-09-05Paper
Approximation and Dependence via Multiteam Semantics2016-05-19Paper
Erratum to: ``The complexity of satisfiability for fragments of CTL and \(\mathrm{CTL}^\star\)2016-04-15Paper
Parameterized Enumeration for Modification Problems2016-04-08Paper
Parameterized Complexity of CTL2016-04-08Paper
Modal Inclusion Logic: Being Lax is Simpler than Being Strict2015-09-16Paper
Generalized satisfiability for the description logic \(\mathcal{ALC}\)2014-01-16Paper
Paradigms for Parameterized Enumeration2013-09-20Paper
Extended Modal Dependence Logic $\mathcal{EMDL}$2013-09-17Paper
The complexity of reasoning for fragments of default logic2012-06-20Paper
On the Parameterized Complexity of Default Logic and Autoepistemic Logic2012-06-08Paper
Generalized Satisfiability for the Description Logic $\mathcal{ALC}$2011-07-01Paper

Research outcomes over time

This page was built for person: Arne Meier