Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Abstract
We have previously introduced role logic as a notation fordescribing properties of relational structures in shapeanalysis, databases and knowledge bases. A natural fragmentof role logic corresponds to two-variable logic withcounting and is therefore decidable.We show how to use role logic to describe open and closedrecords, as well the dual of records, inverse records. Weobserve that the spatial conjunction operation of separationlogic naturally models record concatenation. Moreover, weshow how to eliminate the spatial conjunction of formulas ofquantifier depth one in first-order logic with counting. Asa result, allowing spatial conjunction of formulas ofquantifier depth one preserves the decidability oftwo-variable logic with counting. This result applies totwo-variable role logic fragment as well.The resulting logic smoothly integrates type system andpredicate calculus notation and can be viewed as a naturalgeneralization of the notation for constraints arising inrole analysis and similar shape analysis approaches.
