Quantifier-FreeBooleanAlgebrawithPresburgerArithmetic.PDFVIP

Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete Viktor Kuncak MIT Computer Science and AI Lab, Cambridge, MA Abstract. Boolean Algebra with Presburger Arithmetic (BAPA) com- bines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmetic operations (PA). BAPA can express the relation- ship between integer variables and cardinalities of unbounded finite sets and can be used to express verification conditions in verification of data structure consistency properties. In this report I consider the Quantifier-Free fragment of Boolean Al- gebra with Presburger Arithmetic (QFBAPA). Previous algorithms for QFBAPA had non-deterministic exponential time complexity. In this re- port I show that QFBAPA is in NP, and is therefore NP-complete. My result yields an algorithm for checking satisfiability of QFBAPA formu- las by converting them to polynomially sized formulas of quantifier-free Presburger arithmetic. I expect this algorithm to substantially extend the range of QFBAPA problems whose satisfiability can be checked in practice. 1 Introduction This paper considers the satisfiability problem for a logic that allows reasoning about sets and their cardinalities. We call this logic quantifier-free Boolean Al- gebra with Presburger Arithmetic and denote it QFBAPA. Figure 1 shows the syntax of QFBAPA. The logic contains 1) arbitrary boolean algebra (BA) ex- pressions denoting sets, 2) arbitrary quantifier-free Presburger arithmetic (PA, linear integer arithmetic) expressions, and 3) a cardinality operator for stating that the size of a set denoted by a set expression is equal to an integer denoted by a given PA expression. The constant MAXC de