Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10472-021-09730-w / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4241215655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependence Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Armstrong Relations for Functional Dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4634389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Logic of Information Exchange / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and dependence via multiteam semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic team semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural tractability of counting of solutions to conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting tractable fragments of abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Model Checking for Modal Dependence Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Armstrong databases for functional and inclusion dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Backdoors for Default Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to Normality for Disjunctive Logic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to tractable answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors into heterogeneous classes of SAT and CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-checking games for logics of imperfect information / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is the evaluation of conjunctive queries tractable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyteam semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Propositional Logics in Team Semantic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking and validity in propositional and modal inclusion logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal independence logic: / rank
 
Normal rank
Property / cites work
 
Property / cites work: Team semantics for the specification and verification of hyperproperties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for modal dependence logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrised Complexity of Satisfiability in Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterised complexity of model checking and satisfiability in propositional dependence logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors for Linear Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration complexity of poor man's propositional dependence logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for propositional model counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3446107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4599513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of validity for propositional dependence logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional logics of dependence / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10472-021-09730-W / rank
 
Normal rank

Latest revision as of 23:40, 16 December 2024

scientific article; zbMATH DE number 7473202
Language Label Description Also known as
English
Parameterised complexity of model checking and satisfiability in propositional dependence logic
scientific article; zbMATH DE number 7473202

    Statements

    Parameterised complexity of model checking and satisfiability in propositional dependence logic (English)
    0 references
    0 references
    0 references
    14 February 2022
    0 references
    propositional dependence logic
    0 references
    parameterised complexity
    0 references
    model checking
    0 references
    satisfiability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers