On Solving Boolean Combinations of Generalized 2SAT Constraints

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

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2004
Accession Number
ADA460032

Entities

People

  • K. Subramani
  • Randal Bryant
  • Sanjit A. Seshia

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Additives (Chemicals)
  • Algorithms
  • Coding
  • Coefficients
  • Computer Programming
  • Computer Science
  • Elimination
  • Equations
  • Evolutionary Algorithms
  • Inequalities
  • Information Operations
  • Integer Programming
  • Integrals
  • Linear Programming
  • Numbers
  • Optimization
  • Polynomials

Fields of Study

  • Mathematics