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.

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