Satisfiability Checking - Fourier–Motzkin Variable Elimination
Satisfiability Checking - Fourier–Motzkin Variable Elimination
Satisfiability Checking - Fourier–Motzkin Variable Elimination
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Linear Arithmetic over the Reals<br />
m constraints<br />
Input: A system of conjoined linear inequalities Ax ≤ b<br />
⎛<br />
a11 a12 · · · · · · a1n<br />
⎜<br />
.<br />
a21 a22<br />
..<br />
⎜<br />
.<br />
⎜<br />
.<br />
⎝ .<br />
.. .<br />
am1 a22 · · · · · · amn<br />
n variables<br />
⎞⎛<br />
⎟⎜<br />
⎟⎜<br />
⎟⎜<br />
⎟⎜<br />
⎠⎝<br />
x1<br />
.<br />
.<br />
xn<br />
⎞<br />
⎛<br />
⎟<br />
⎠ ≤<br />
⎜<br />
⎝<br />
Prof. Dr. Erika Ábrahám - <strong>Satisfiability</strong> <strong>Checking</strong> 4 / 10<br />
b1<br />
.<br />
.<br />
bn<br />
⎞<br />
⎟<br />
⎠
Change language