Fixed-Parameter Hierarchies inside PSPACE

Authors:
Guoqiang Pan;Moshe Y. Vardi
Affiliations:
Rice University, USA;Rice University, USA
Venue:
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Year:
2006

Citing 0
Cited 13

Quantified Constraint Satisfaction and the Polynomially Generated Powers Property

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Backdoor Sets of Quantified Boolean Formulas

Journal of Automated Reasoning
A structural approach to reasoning with quantified Boolean formulas

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Backdoor sets of quantified boolean formulas

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Learning to integrate deduction and search in reasoning about quantified boolean formulas

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Does treewidth help in modal satisfiability?

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Collapsibility in infinite-domain quantified constraint satisfaction

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Backdoors to satisfaction

The Multivariate Algorithmic Revolution and Beyond
Decomposing Quantified Conjunctive (or Disjunctive) Formulas

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Model theory makes formulas large

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Does Treewidth Help in Modal Satisfiability?

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The UCLID project seeks to develop formal verification tools for infinite-state systems having a degree of automation comparable to that of model checking tools for finitestate systems. The UCLID modeling language describes systems where the state variables ...