Accession Number:

ADA460032

Title:

On Solving Boolean Combinations of Generalized 2SAT Constraints

Descriptive Note:

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE

Report Date:

2004-11-01

Pagination or Media Count:

20.0

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.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE