A parameterized view on the complexity of dependence logic (Q2151403): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies in Dependence Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the space and circuit complexity of parameterized problems: classes and completeness / 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: On Strongly First-Order Dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2958528 / 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: Dependence and independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive complexity of real computation and probabilistic independence logic / 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: Coherence and computational complexity of quantifier-free dependence logic formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for modal dependence logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5376653 / 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: First-Order Model Checking Problems Parameterized by the Model / 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: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3446107 / rank
 
Normal rank

Latest revision as of 12:16, 29 July 2024

scientific article
Language Label Description Also known as
English
A parameterized view on the complexity of dependence logic
scientific article

    Statements

    A parameterized view on the complexity of dependence logic (English)
    0 references
    0 references
    0 references
    0 references
    1 July 2022
    0 references
    team semantics
    0 references
    dependence logic
    0 references
    parameterized complexity
    0 references
    model checking
    0 references

    Identifiers