Solving Systems of Linear Inequalities by Bound Propagation

DOI10.1007/978-3-642-22438-6_28zbMath1341.68193OpenAlexW2159066124MaRDI QIDQ5200037

Andrei Voronkov, Konstantin Korovin

Publication date: 29 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22438-6_28

Mathematics Subject Classification ID

Related Items (3)

The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ Solving Systems of Linear Inequalities by Bound Propagation ⋮ The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints

Cites Work

• Unnamed Item
• Conflict Resolution
• Solving SAT and SAT Modulo Theories
• Generalizing DPLL to Richer Logics
• Solving Systems of Linear Inequalities by Bound Propagation
• A machine program for theorem-proving

This page was built for publication: Solving Systems of Linear Inequalities by Bound Propagation