2 citations · 2 across the 5 of their papers we have counts for
1 paper · 1 filter
Emanuel Kieroński, Sebastian Rudolph, Mantas Šimkus
A prominent research question in computational logic is how to restrict first-order predicate logic (FO) in such a way that the satisfiability problem becomes decidable. Among othe…