| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 426543 | Information and Computation | 2009 | 22 Pages |
Abstract
The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting quantifiers is NP-complete; the data-complexity of both query answering and finite query answering for the two-variable guarded fragment with counting quantifiers is co-NP-complete.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
