The following pages link to Arne Meier (Q393135):
Displaying 43 items.
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (Q393137) (← links)
- Probabilistic team semantics (Q1647487) (← links)
- Enumeration complexity of poor man's propositional dependence logic (Q1647499) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Approximation and dependence via multiteam semantics (Q1783737) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Parameterised complexity of abduction in Schaefer's framework (Q2177589) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- The expressiveness of looping terms in the semantic programming (Q2306056) (← links)
- The model checking fingerprints of CTL operators (Q2317834) (← links)
- Weak completeness notions for exponential time (Q2322715) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- Parameterized Enumeration for Modification Problems (Q2799203) (← links)
- Parameterized Complexity of CTL (Q2799205) (← links)
- Erratum to: ``The complexity of satisfiability for fragments of CTL and \(\mathrm{CTL}^\star\)'' (Q2800418) (← links)
- Approximation and Dependence via Multiteam Semantics (Q2807084) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Extended Modal Dependence Logic $\mathcal{EMDL}$ (Q2849427) (← links)
- Paradigms for Parameterized Enumeration (Q2849918) (← links)
- On the Parameterized Complexity of Default Logic and Autoepistemic Logic (Q2890211) (← links)
- The complexity of reasoning for fragments of default logic (Q2893324) (← links)
- Modal Inclusion Logic: Being Lax is Simpler than Being Strict (Q2946343) (← links)
- Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ (Q3010434) (← links)
- (Q4584892) (← links)
- Backdoors for Linear Temporal Logic (Q4634407) (← links)
- Satisfiability of Modal Inclusion Logic (Q4972171) (← links)
- Team semantics for the specification and verification of hyperproperties (Q5005106) (← links)
- Parameterized complexity of abduction in Schaefer’s framework (Q5028318) (← links)
- Model Checking and Validity in Propositional and Modal Inclusion Logics (Q5111246) (← links)
- Model checking and validity in propositional and modal inclusion logics (Q5213388) (← links)
- Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205) (← links)
- A parameterized view on the complexity of dependence and independence logic (Q5872871) (← links)
- (Q5884956) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918987) (← links)
- Parameterised counting in logspace (Q6093373) (← links)
- Logics with probabilistic team semantics and the Boolean negation (Q6545573) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- Strong backdoors for default logic (Q6610193) (← links)
- Parameterized complexity of weighted team definability (Q6620025) (← links)
- Temporal team semantics revisited (Q6649479) (← links)
