Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
Boolean Algebra with Presburger Arithmetic (BAPA) combines1) Boolean algebras of sets of uninterpreted elements (BA)and 2) Presburger arithmetic operations (PA). BAPA canexpress the relationship between integer variables andcardinalities of unbounded finite sets and can be used toexpress verificati...
Main Author: | Kuncak, Viktor |
---|---|
Other Authors: | Martin Rinard |
Language: | en_US |
Published: |
2007
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/35258 |
Similar Items
-
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
by: Kuncak, Viktor, et al.
Published: (2005) -
Method for the solution of the multi-dimensional 0/1 knapsack problem
by: Weingartner, H. Martin.
Published: (2009) -
An adaptive group theoretic algorithm for integer programming problems
by: Gorry, George Anthony, et al.
Published: (2009) -
Relaxation methods for pure and mixed integer programming problems
by: Gorry, George Anthony, et al.
Published: (2009) -
A generalized programming algorithm for integer programming problems with many columns,
by: Shapiro, Jeremy F.
Published: (2009)