10 citations · 23 across the 13 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LO2021
On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics
Bartosz Bednarczyk, Maja Orłowska, Anna Pacanowska +1
During the last decades, a lot of effort was put into identifying decidable fragments of first-order logic. Such efforts gave birth, among the others, to the two-variable fragment…
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…