Complexity of validity for propositional dependence logics

@inproceedings{Virtema2014ComplexityOV,
  title={Complexity of validity for propositional dependence logics},
  author={J. Virtema},
  booktitle={GandALF},
  year={2014}
}
  • J. Virtema
  • Published in GandALF 2014
  • Mathematics, Computer Science
  • We study the validity problem for propositional dependence logic, modal dependence logic and extended modal dependence logic. We show that the validity problem for propositional dependence logic is NEXPTIME-complete. In addition, we establish that the corresponding problem for modal dependence logic and extended modal dependence logic is NEXPTIME-hard and in NEXPTIME^NP. 
    Propositional logics of dependence
    • 50
    • PDF
    Complexity of validity for propositional dependence logics
    • 21
    Axiomatizing Propositional Dependence Logics
    • 21
    • PDF
    Expressivity and Complexity of Dependence Logic
    • 27
    • PDF
    Model Checking and Validity in Propositional and Modal Inclusion Logics
    • 16
    • PDF
    The expressive power of modal logic with inclusion atoms
    • 19
    • PDF
    Team Semantics for the Specification and Verification of Hyperproperties
    • 7
    • PDF
    Canonical Models and the Complexity of Modal Team Logic
    • M. Lück
    • Computer Science, Mathematics
    • 2018
    • 4
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES
    The complexity of theorem-proving procedures
    • S. Cook
    • Mathematics, Computer Science
    • 1971
    • 5,803
    • PDF
    Compositional Semantics for a Language of Imperfect Information
    • 291
    • PDF
    Dependence Logic - A New Approach to Independence Friendly Logic
    • 206
    • PDF
    Henkin quantifiers and complete problems
    • 99
    • PDF
    Modal Dependence Logic
    • 61
    • PDF
    The Expressive Power of Modal Dependence Logic
    • 37
    • PDF
    Model-theoretic and Computational Properties of Modal Dependence Logic
    • 50
    Inquisitive Semantics: Two Possibilities for Disjunction
    • 127
    • PDF