Complexity of the Two-Variable Fragment with Counting Quantifiers
- 118 Downloads
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
Abstracttwo-variable fragment counting quantifiers logic complexity
Unable to display preview. Download preview PDF.
- Grädel, E., Otto, M., and Rosen, E., 1997, “Two-variable logic with counting is decidable,” in Proceedings of the 12th IEEE Symposium on Logic in Computer Science, pp. 306–317. IEEE Online Publications.Google Scholar
- Pacholski, L., Szwast, W., and Tendera, L., 1997, “Complexity of two-variable logic with counting,” in Proceedings of the 12th IEEE Symposium on Logic in Computer Science, pp. 318–327. IEEE Online Publications.Google Scholar
- Papadimitriou, C.H., 1981, “On the complexity of integer programming,” Journal of the Association for Computing Machinery 28(4), 765–768.Google Scholar