2026-08-16T16:04:55Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2524 2024-03-06T11:09:09Z ddc:004 open_access

Complexity Results for Modal Dependence Logic Lohmann, Peter Vollmer, Heribert Dependence logic satisfiability problem computational complexity poor man's logic Modal dependence logic was introduced very recently by Väänänen. It enhances the basic modal language by an operator dep. For propositional variables p_1,...,p_n, dep(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n only depends on those of p_1,...,p_(n-1). Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministic exponential time. In this paper we consider fragments of modal dependence logic obtained by restricting the set of allowed propositional connectives. We show that satisfibility for poor man's dependence logic, the language consisting of formulas built from literals and dependence atoms using conjunction, necessity and possibility (i.e., disallowing disjunction), remains NEXPTIME-complete. If we only allow monotone formulas (without negation, but with disjunction), the complexity drops to PSPACE-completeness. We also extend Väänänen's language by allowing classical disjunction besides dependence disjunction and show that the satisfiability problem remains NEXPTIME-complete. If we then disallow both negation and dependence disjunction, satistiability is complete for the second level of the polynomial hierarchy. In this way we completely classify the computational complexity of the satisfiability problem for all restrictions of propositional and dependence operators considered by Väänänen and Sevenster. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Peter Lohmann and Heribert Vollmer 2010 Is Part Of Dagstuhl Seminar Proceedings, Volume 10061, Circuits, Logic, and Games (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.10061.3 urn:nbn:de:0030-drops-25240 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10061.3 eng https://creativecommons.org/licenses/by/4.0/legalcode