On Quantified Propositional Logics and the Exponential Time Hierarchy

@inproceedings{Hannula2016OnQP,
  title={On Quantified Propositional Logics and the Exponential Time Hierarchy},
  author={Miika Hannula and Juha Kontinen and Martin L{\"u}ck and Jonni Virtema},
  booktitle={GandALF},
  year={2016}
}
We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae. We show that the truth evaluation for ADQBF is AEXPTIME(poly)-complete. We also identify fragments for which the problem is complete for the levels of the exponential hierarchy. Second we study propositional team-based logics. We show that DQBF formulae… 

Figures from this paper

Validity and Entailment in Modal and Propositional Dependence Logics

This paper addresses the question of the complexity of validity in modal dependence logic and shows that it is NEXPTIME-complete, and refute an earlier conjecture proposing a higher complexity for the problem.

On the Succinctness of Atoms of Dependency

By introducing a variant of the Ehrenfeucht-Fra\"{i}ss\'{e} game called formula size game into team logic, an exponential lower bounds are obtained in the existential fragment for all atoms and in the full fragment, polynomial upper bounds are presented.

The Power of the Filtration Technique for Modal Logics with Team Semantics

This work investigates a model-theoretical approach and generalizes the successful filtration technique to work in team semantics and identifies an “existential” fragment of MTL that enjoys the exponential model property and is therefore, like Propositional Team Logic (PTL), complete for the class AEXP(poly).

Axiomatizations of Team Logics

  • M. Lück
  • Philosophy
    Ann. Pure Appl. Log.
  • 2018

Parameterised Complexity of Propositional Inclusion and Independence Logic

This work analyses the parameterised complexity of propositional inclusion (PINC) and independence logic (PIND) and proves that when parameterised by arity, both MC and SAT are paraNP-complete for each of the considered logics.

On the Complexity of Team Logic and its Two-Variable Fragment

This paper considers the logic FO(∼), the extension of first-order logic with team semantics by unrestricted Boolean negation, and proves that its satisfiability problem is decidable, and in fact complete for the recently introduced non-elementary class TOWER(poly).

On the Complexity of Team Logic and its Two-Variable Fragment

This paper considers the logic FO(~), the extension of first-order logic with team semantics by unrestricted Boolean negation, and proves that its satisfiability problem is decidable, and in fact complete for the recently introduced non-elementary class TOWER(poly).

Canonical Models and the Complexity of Modal Team Logic

This work introduces a non-elementary complexity class, TOWER(poly), and proves that the satisfiability and validity problem of MTL are complete for it, and construction of such a model is reduced to simple model checking, which proves that MTL-formulas can efficiently enforce canonicity.

Canonical Models and the Complexity of Modal Team Logic

This work introduces the notion of canonical models into the team-semantical setting of modal logic ML, and reduces the satisfiability problem of MTL to simple model checking, and shows that this approach is optimal in the sense that MTL-formulas can efficiently enforce canonicity.

Complexity of Propositional Logics in Team Semantics

The main result shows that the satisfiability and validity problems for propositional team logic are complete for alternating exponential-time with polynomially many alternations.

References

SHOWING 1-10 OF 20 REFERENCES

Complete Problems of Propositional Logic for the Exponential Hierarchy

A generalization of propositional logic is investigated which fills this gap with the introduction of Boolean higher-order quantifiers or equivalently Boolean Skolem functions and it turns out that the hardness results do not collapse at the consideration of conjunctive and disjunctive normal forms, in contrast to plain QBF.

Complexity of validity for propositional dependence logics

The validity problem for propositional dependence logic, modal dependence logic and extended modal dependency logic is shown to be NEXPTIME-complete and the corresponding problem for modal dependent logic is NEXptIME-hard and in NEX PTIME^NP.

Expressivity and Complexity of Dependence Logic

Variants of dependence logic arising by replacing/supplementing dependence atoms with further dependency notions are considered, and propositional and modal variants are studied.

Hierarchies in independence logic

This work relates fragments of inclusion and independence logic to familiar sublogics of existential second-order logic and shows that, with respect to the stronger strict semantics, inclusion logic is equivalent to existential second order logic.

A Double Team Semantics for Generalized Quantifiers

A system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework is defined.

Complexity of Propositional Independence and Inclusion Logic

We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence and inclusion logic and their extensions by the classical negation.

Team Logic and Second-Order Logic

This article shows that, in a sense that it is made explicit, team logic and second-order logic are also equivalent with respect to open formulas, and relating open formulas of dependence logic to the negative fragment of existential second- order logic.

Modal Inclusion Logic: Being Lax is Simpler than Being Strict

We investigate the computational complexity of the satisfiability problem of modal inclusion logic. We distinguish two variants of the problem: one for strict and another one for lax semantics. The

Word problems requiring exponential time(Preliminary Report)

A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered.