Decomposing Quantified Conjunctive (or Disjunctive) Formulas

@article{Chen2012DecomposingQC,
  title={Decomposing Quantified Conjunctive (or Disjunctive) Formulas},
  author={Hubie Chen and V{\'i}ctor Dalmau},
  journal={2012 27th Annual IEEE Symposium on Logic in Computer Science},
  year={2012},
  pages={205-214}
}
Model checking--deciding if a logical sentence holds on a structure--is a basic computational task that is well-known to be intractable in general. For first-order logic on finite structures, it is PSPACE-complete, and the natural evaluation algorithm exhibits exponential dependence on the formula. We study model checking on the quantified conjunctive fragment of first-order logic, namely, prenex sentences having a purely conjunctive quantifier-free part. Following a number of works, we… CONTINUE READING

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

Parameterized Complexity Theory

  • Texts in Theoretical Computer Science. An EATCS Series
  • 2006
VIEW 20 EXCERPTS
HIGHLY INFLUENTIAL

The complexity of homomorphism and constraint satisfaction problems seen from the other side

  • 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
VIEW 21 EXCERPTS
HIGHLY INFLUENTIAL

Hypertree Decompositions and Tractable Queries

VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Tree-width for first order formulae

  • Logical Methods in Computer Science
  • 2009
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Fixed-Parameter Hierarchies inside PSPACE

  • 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
  • 2006
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL