Complexity of the Two-Variable Fragment with Counting Quantifiers

被引:76
|
作者
Ian Pratt-Hartmann
机构
[1] University of Manchester,School of Computer Science
关键词
two-variable fragment; counting quantifiers; logic; complexity;
D O I
10.1007/s10849-005-5791-1
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:369 / 395
页数:26
相关论文
共 50 条