Complexity of the two-variable fragment with counting quantifiers
by
Ian Pratt-hartmann
| Venue: | Journal of Logic, Language and Information |
| Citations: | 36 - 1 self |
BibTeX
@ARTICLE{Pratt-hartmann_complexityof,
author = {Ian Pratt-hartmann},
title = {Complexity of the two-variable fragment with counting quantifiers},
journal = {Journal of Logic, Language and Information},
year = {},
pages = {2005}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
