![Theoretical computer science / Mathematical logic / Mathematics / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / Satisfiability modulo theories / Boolean algebra / Local consistency Theoretical computer science / Mathematical logic / Mathematics / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / Satisfiability modulo theories / Boolean algebra / Local consistency](https://www.pdfsearch.io/img/eaa711ff9e65fd3fd48197a3545f04cb.jpg) Date: 2016-11-28 15:21:09Theoretical computer science Mathematical logic Mathematics Logic in computer science Constraint programming Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Satisfiability modulo theories Boolean algebra Local consistency | | Solving Nonlinear Integer Arithmetic with MCSAT? Dejan JovanoviĀ“c SRI International Abstract. We present a new method for solving nonlinear integer arithmetic constraints. The method relies on the MCSat approach to solAdd to Reading ListSource URL: csl.sri.comDownload Document from Source Website File Size: 833,01 KBShare Document on Facebook
|