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

We revisit the satisfiability problem for two-variable logic, denoted by SAT(FO 2 ), which is known to be NEXP-complete. The upper bound is usually derived from its well known exponential size model property. Whether it can be determinized/randomized efficiently is still an open question.In this pap...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Lin, Ting-Wei, Lu, Chia-Hsuan, Tan, Tony
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Complexity theory Computer science Time complexity Upper bound
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!