Decidability of Querying First-Order Theories via Countermodels of Finite Width
The decidability of logical entailment problems can be established by exploiting the existence of countermodels that are structurally simple, as measured by certain types of width measures.
