Ronald Fagin Easier Ways to Win Logical Games. [Citation Graph (0, 0)][DBLP] Descriptive Complexity and Finite Models, 1996, pp:1-32 [Conf]

Bruno Courcelle On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP] Descriptive Complexity and Finite Models, 1996, pp:33-62 [Conf]

Howard Straubing Finite Models, Automata, and Circuit Complexity. [Citation Graph (0, 0)][DBLP] Descriptive Complexity and Finite Models, 1996, pp:63-96 [Conf]

Victor Vianu Databases and Finite-Model Theory. [Citation Graph (0, 0)][DBLP] Descriptive Complexity and Finite Models, 1996, pp:97-148 [Conf]

Moshe Y. Vardi Why is Modal Logic So Robustly Decidable? [Citation Graph (0, 0)][DBLP] Descriptive Complexity and Finite Models, 1996, pp:149-184 [Conf]