Satisfiability in Rationals and Linear Programming
An exploration of the deep theoretical connection between satisfiability problems over rational arithmetic and linear programming, covering LP relaxations, complexity theory, and SMT solvers.
An exploration of the deep theoretical connection between satisfiability problems over rational arithmetic and linear programming, covering LP relaxations, complexity theory, and SMT solvers.
A comprehensive guide to the congruence closure algorithm—understanding equality reasoning in automated reasoning systems, from union-find data structures to SMT solvers.