10 citations · 23 across the 13 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LO2022
Reducing NEXP-complete problems to DQBF
Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu +1
We present an alternative proof of the NEXP-hardness of the satisfiability of {\em Dependency Quantified Boolean Formulas} (DQBF). Besides being simple, our proof also gives us a g…
cs.LO2022★ 1 cited
On two-variable guarded fragment logic with expressive local Presburger constraints
Chia-Hsuan Lu, Tony Tan
We consider the extension of the two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of inc…