most citedTowards a more efficient approach for the satisfiability of two-variable logic

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.LO2021★ 1 cited

Towards a more efficient approach for the satisfiability of two-variable logic

Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan

We revisit the satisfiability problem for two-variable logic, denoted by SAT(FO2), which is known to be NEXP-complete. The upper bound is usually derived from its well known Expone…