On Generalized Records and Spatial Conjunction in Role Logic
Abstract
We have previously introduced role logic as a notation for describing properties of relational structures in shape analysis, databases and knowledge bases. A natural fragment of role logic corresponds to twovariable logic with counting and is therefore decidable. We show how to use role logic to describe open and closed records, as well the dual of records, inverse records. We observe that the spatial conjunction operation of separation logic naturally models record concatenation. Moreover, we show how to eliminate the spatial conjunction of formulas of quantifier depth one in firstorder logic with counting. As a result, allowing spatial conjunction of formulas of quantifier depth one preserves the decidability of twovariable logic with counting. This result applies to twovariable role logic fragment as well. The resulting logic smoothly integrates type system and predicate calculus notation and can be viewed as a natural generalization of the notation for constraints arising in role analysis and similar shape analysis approaches.
 Publication:

arXiv eprints
 Pub Date:
 August 2004
 arXiv:
 arXiv:cs/0408019
 Bibcode:
 2004cs........8019K
 Keywords:

 Programming Languages;
 Logic in Computer Science;
 D.2.4;
 D.3.1;
 D.3.3;
 F.3.1;
 F.3.2;
 F.4.1
 EPrint:
 30 pages. A version appears in SAS 2004