The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
Résumé
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 that decides the treewidth
boundedness problem for this logic. Furthermore, our algorithm can
give an estimate of the bound of the models of a given formula, in
case there is a finite such bound.
Domaines
Informatique [cs]Origine | Fichiers produits par l'(les) auteur(s) |
---|