An algorithmic meta theorem for a logic and a class C of structures states that all problems expressible in this logic can be solved efficiently for inputs from $C$. The prime example is Courcelle's Theorem, which states that monadic second-order (MSO) de
展开▼
机译：逻辑和结构C类的算法元定理指出，对于$ C $的输入，可以有效解决此逻辑中可表示的所有问题。最主要的例子是库尔塞勒定理，该定理指出单子二阶（MSO）de
展开▼
