The treewidth boundedness problem for a logic asks for the existence of an upper bound on the treewidth of the models of a given formula in that logic. This problem is found to be undecidable for first order logic. We consider a generalization of Separation Logic over relational signatures, interpreted over standard relational structures, and describe an algorithm for the treewidth boundedness problem in the context of this logic.

翻译：对于某个逻辑的树宽有界问题，要求判断该逻辑中给定公式的模型是否存在树宽的上界。已知一阶逻辑中的该问题是不可判定的。本文考虑关系签名上分离逻辑的一种推广形式，该逻辑在标准关系结构上进行解释，并针对此逻辑的树宽有界问题给出了一种算法。