1
vote
1answer
84 views

Algorithm for enumerating theorems of first-order theories besides resolution

Is there a general algorithm for enumerating the theorems of any finite first-order theory with a better time complexity than simply using resolution on all first-order logic formulas?