We give a comprehensive account on the parameterized complexity of model checking and satisfiability of propositional inclusion and independence logic. We discover that for most parameterizations the problems are either in FPT or paraNP-complete
AbstractMany relevant intractable problems become tractable if some problem parameter is fixed. Howe...
AbstractThis paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with lo...
In this paper, we investigate the parameterized complexity of model checking for Dependence Logic wh...
We give a comprehensive account on the parameterized complexity of model checking and satisfiability...
Propositional and modal inclusion logic are formalisms that belong to the family of logics based on ...
Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this ...
We classify the computational complexity of the satisfiability, validity, and model-checking problem...
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are n...
AbstractLiberatore and Schaerf (Proceedings of the ECAI’ 98, 1998) give a proof that model checking ...
We analyze the complexity of deciding whether a propositional interpretation is a model of a default...
We investigate the complexity of the model checking problem forintuitionistic and modal propositiona...
In this paper, we investigate the parameterized complexity of model checking for Dependence and Inde...
Abstract. We investigate the complexity of the model checking problem for intuitionistic and modal p...
We study the complexity of model checking in propositional nonmonotonic logics. Specifically, we fir...
Abstract. We investigate the application of Courcelle’s Theorem and the logspace version of Elberfel...
AbstractMany relevant intractable problems become tractable if some problem parameter is fixed. Howe...
AbstractThis paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with lo...
In this paper, we investigate the parameterized complexity of model checking for Dependence Logic wh...
We give a comprehensive account on the parameterized complexity of model checking and satisfiability...
Propositional and modal inclusion logic are formalisms that belong to the family of logics based on ...
Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this ...
We classify the computational complexity of the satisfiability, validity, and model-checking problem...
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are n...
AbstractLiberatore and Schaerf (Proceedings of the ECAI’ 98, 1998) give a proof that model checking ...
We analyze the complexity of deciding whether a propositional interpretation is a model of a default...
We investigate the complexity of the model checking problem forintuitionistic and modal propositiona...
In this paper, we investigate the parameterized complexity of model checking for Dependence and Inde...
Abstract. We investigate the complexity of the model checking problem for intuitionistic and modal p...
We study the complexity of model checking in propositional nonmonotonic logics. Specifically, we fir...
Abstract. We investigate the application of Courcelle’s Theorem and the logspace version of Elberfel...
AbstractMany relevant intractable problems become tractable if some problem parameter is fixed. Howe...
AbstractThis paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with lo...
In this paper, we investigate the parameterized complexity of model checking for Dependence Logic wh...
DOI
Add to ORKG