Satisfiablity checking in non-linear integer arithmetic by approximation

匆匆过客 提交于 2019-12-11 04:28:22

问题


Is it possible to ask Z3 to prove satisfiability of a system of integer polynomial inequalities with 2 different variables (or in general case) by approximating the original system with a system of linear inequalities?


回答1:


By default, Z3 will try to solve a nonlinear integer problem as a linear one. The basic trick is to treat nonlinear terms such as x*y as new "variables". Nonlinear integer arithmetic is not well supported in Z3, the following post has a summary on how Z3 handles nonlinear integer arithmetic:

  • How does Z3 handle non-linear integer arithmetic?


来源:https://stackoverflow.com/questions/14056742/satisfiablity-checking-in-non-linear-integer-arithmetic-by-approximation

标签
易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!