タイトル(掲載誌)Research report (School of Information Science, Japan Advanced Institute of Science and Technology)
一般注記This paper presents an iterative approximation refinement, called raSAT loop, which solves polynomial inequality constraints on real numbers. The approximation scheme consists of interval arithmetic (over-approximation, aiming to decide unsatisfiability) and testing (underapproximation, aiming to decide satisfiability). If both of them fail to decide, input intervals are refined by decomposition. raSAT loop is implemented as an SMT raSAT with miniSAT 2.2 as a backend SAT solver. Experiments including simple benchmarks for estimating effects of input measures (i.e., degrees, number of variables, and number of constraints) and QF_NRA benchmarks from SMT-LIB show that raSAT is comparable to Z3 4.3, and sometimes outperforms, especially with high degree of polynomials.
リサーチレポート(北陸先端科学技術大学院大学情報科学研究科)
identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/11349
一次資料へのリンクURLhttps://dspace.jaist.ac.jp/dspace/bitstream/10119/11349/1/IS-RR-2013-003.pdf
連携機関・データベース国立情報学研究所 : 学術機関リポジトリデータベース(IRDB)(機関リポジトリ)
提供元機関・データベース北陸先端科学技術大学院大学 : JAIST学術研究成果リポジトリ