Piskac, RuzicaKuncak, Viktor2009-05-012009-05-012009-05-01200810.1007/978-3-540-70545-1_25https://infoscience.epfl.ch/handle/20.500.14299/38233WOS:000257539900025We consider an extension of integer linear arithmetic with a “star” operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We show that the satisfiability problem for this extended language remains in NP (and therefore NP-complete). Our proof uses semilinear set characterization of solutions of integer linear arithmetic formulas, as well as a generalization of a recent result on sparse solutions of integer linear programming problems. As a consequence of our result, we present worst-case optimal decision procedures for two NP-hard problems that were previously not known to be in NP. The first is the satisfiability problem for a logic of sets, multisets (bags), and cardinality constraints, which has applications in verification, interactive theorem proving, and description logics. The second is the reachability problem for a class of transition systems whose transitions increment the state vector by solutions of integer linear arithmetic formulas.decision proceduremultisetlinear arithmeticinteger coneverificationtext::conference output::conference proceedings::conference paper