This paper is concerned with determining the optimal length resolution refutation (OLRR) of
a system of difference constraints over an integral domain. The problem of finding short …

This paper is concerned with the design and analysis of a bit-scaling based algorithm for the
problem of checking integer feasibility in a system of unit two variable per inequality (UTVPI) …

In this paper, we design and analyze a simple, greedy algorithm for checking the linear and
integer feasibility of a class of linear programs called Horn programs. This algorithm, which …

Adaptive Eager Boolean Encoding for Arithmetic Reasoning in Verification Page 1 Adaptive
Eager Boolean Encoding for Arithmetic Reasoning in Verification Sanjit A. Seshia May 2005 …

We consider the satisfiability problem for Boolean combinations of unit two variable per
inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at most two …

This paper is concerned with the design and analysis of improved algorithms for determining
the optimal length resolution refutation (OLRR) of a system of difference constraints over an …

This paper is concerned with the design and analysis of a certifying algorithm for checking
the lattice point feasibility of a class of constraints called unit two variable per inequality …

In this paper, we study the problem of computing the lattice point closure of a conjunction of
Unit Two Variable Per Inequality (UTVPI) constraints. We accomplish this by adapting …

The problem of testing the satisfiability of CNF formulas or SAT is ubiquitous in computer
science and operations research. Applications of this problem abound from areas as diverse …

This paper is concerned with the design and analysis of a time-optimal and space-optimal,
certifying algorithm for checking the lattice point feasibility of a class of constraints called …