NP Satisfiability for Arrays as Powers

09/11/2021
by   Rodrigo Raya, et al.
0

We show that the satisfiability problem for the quantifier-free 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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset