On Solving Boolean Combinations of Generalized 2SAT Constraints

reportActive / Technical Report | Accession Number: ADA460032 | Open PDF

Abstract:

We consider the satisfiability problem for Boolean combinations of generalized 2 SAT constraints, which are linear constraints with at most two, possibly unbounded, integer variables having coefficients in -1,1.

Author(s):
Seshia, Sanjit A. ; Subramani, K. ; Bryant, Randal E.
Author Organization(s):
CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE
Supplementary Note:
DOI: 10.21236/ADA460032
Pagination:
0020

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release
Distribution Statement:
Approved For Public Release; Distribution Is Unlimited.

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
CNA-CMU-CS-04-179
Contract/Grant Number(s):
DAAD19-01-1-0485
Monitor Series:
ARO
 Subject Terms
Joint Capability Areas:
JCA_5_Command and Control; JCA_5.4_Decide; JCA_1_Force Support; JCA_1.2.5_Lessons Learned; JCA_8_Building Partnerships
Communities of Interest:
Human Systems
Descriptor(s):
*BOOLEAN ALGEBRA, ALGORITHMS, OPTIMIZATION, VERIFICATION, INTEGER PROGRAMMING, VARIABLES, DECISION THEORY
Field(s)/Group(s):
Theoretical Mathematics
Keyword(s):
CONSTRAINTS
Report Date:
2004 Nov 01
Creation Date:
2007 Jan 24