NP Satisfiability for Arrays as Powers

Abstract

We show that the satisfiability problem for the quantifierfree theory of product structures with the equicardinality relation is in NP. As an application, we extend the combinatory array logic fragment to handle cardinality constraints. The resulting fragment is independent of the base element and index set theories.