Parameterised complexity of model checking and satisfiability in propositional dependence logic
From MaRDI portal
Recommendations
- Parameterised complexity of model checking and satisfiability in propositional dependence logic
- A parameterized view on the complexity of dependence logic
- A parameterized view on the complexity of dependence and independence logic
- Complexity results for modal dependence logic
- Complexity Results for Modal Dependence Logic
Cites work
- A trichotomy in the complexity of counting answers to conjunctive queries
- Algorithms for propositional model counting
- Approximation and dependence via multiteam semantics
- Armstrong databases for functional and inclusion dependencies
- Augmenting tractable fragments of abstract argumentation
- Backdoors for linear temporal logic
- Backdoors into heterogeneous classes of SAT and CSP
- Backdoors to normality for disjunctive logic programs
- Backdoors to planning
- Backdoors to tractable answer set programming
- Complexity of Finding Embeddings in a k-Tree
- Complexity of model checking for modal dependence logic
- Complexity of propositional logics in team semantic
- Complexity of validity for propositional dependence logics
- Complexity results for modal dependence logic
- Dependence Logic
- Dependence logic. A new approach to independence friendly logic
- Enumeration complexity of poor man's propositional dependence logic
- Fundamentals of parameterized complexity
- Graph minors. V. Excluding a planar graph
- scientific article; zbMATH DE number 3489106 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1061261 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Modal dependence logic
- Modal independence logic
- Model checking and validity in propositional and modal inclusion logics
- Model-checking games for logics of imperfect information
- On the Structure of Armstrong Relations for Functional Dependencies
- Parameterised complexity of model checking and satisfiability in propositional dependence logic
- Parameterized algorithms
- Parametrised complexity of satisfiability in temporal logic
- Parametrized complexity theory.
- Polyteam semantics
- Probabilistic team semantics
- Propositional logics of dependence
- Strong Backdoors for Default Logic
- Structural tractability of counting of solutions to conjunctive queries
- Team semantics for the specification and verification of hyperproperties
- The complexity of theorem-proving procedures
- The fine classification of conjunctive queries and parameterized logarithmic space
- The logic of counting query answers
- The parameterized complexity of dependency detection in relational databases
- Towards a Logic of Information Exchange
- When is the evaluation of conjunctive queries tractable?
Cited in
(6)- A parameterized view on the complexity of dependence logic
- A fragment of dependence logic capturing polynomial time
- A parameterized view on the complexity of dependence and independence logic
- Parameterised complexity of model checking and satisfiability in propositional dependence logic
- Parameterized complexity of propositional inclusion and independence logic
- Parameterized complexity of weighted team definability
This page was built for publication: Parameterised complexity of model checking and satisfiability in propositional dependence logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918486)
