Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
Logic in Computer Science
2024-04-19 v1 Computational Complexity
Abstract
We show that the finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of a result recently obtained by Y. Kazakov, that the satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.
Cite
@article{arxiv.cs/0601112,
title = {Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers},
author = {Ian Pratt-Hartmann},
journal= {arXiv preprint arXiv:cs/0601112},
year = {2024}
}
Comments
20 pages, 3 figures