Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete

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...

Full description

Bibliographic Details
Main Author: Kuncak, Viktor
Other Authors: Martin Rinard
Language:en_US
Published: 2007
Subjects:
Caratheodory theorem
integer linear programming
integer cone
Hilbert basis
Online Access:http://hdl.handle.net/1721.1/35258

Internet

http://hdl.handle.net/1721.1/35258

Similar Items