Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
Logic in Computer Science
2024-04-19 v1 Artificial Intelligence
Computational Complexity
Abstract
The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting is NP-complete; the data-complexity of both query-answering and finite query-answering for the two-variable guarded fragment with counting is co-NP-complete.
Cite
@article{arxiv.0806.1636,
title = {Data-Complexity of the Two-Variable Fragment with Counting Quantifiers},
author = {Ian Pratt-Hartmann},
journal= {arXiv preprint arXiv:0806.1636},
year = {2024}
}