First-Order model checking on nested pushdown trees is complete for doubly exponential alternating time

Authors:
Alexander Kartzow
Affiliations:
Institut für Informatik, Universität Leipzig, Leipzig, Germany
Venue:
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Year:
2012

Citing 2
Cited 1

FO Model Checking on Nested Pushdown Trees

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Languages of nested trees

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

First-Order Logic on Higher-Order Nested Pushdown Trees

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently we proved that first-order model checking on nested pushdown trees can be done in doubly exponential alternating time with linearly many alternations. Using the interpretation method of Compton and Henson we give a matching lower bound, i.e., we prove that first-order model checking on nested pushdown trees is complete for ATIME(exp2(cn), cn) with respect to log-lin reductions.