raSAT: SMT for Polynomial Inequality

Material type: 文書・図像類

Author: To, Van Khanhほか

Publisher: 北陸先端科学技術大学院大学情報科学研究科

Publication date: 2013-05-27

Material Format: Digital

Capacity, size, etc.: -

NDC: -

View All

Notes on use

Note (General)：: This paper presents an iterative approximation refinement, called raSAT loop, which solves polynomial inequality constraints on real numbers. The appr...

Search by Bookstore

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

List of Cooperating Institutions and Databases

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

JAIST Repository
Digital
You can check the holdings of institutions and databases with which Institutional Repositories DataBase(IRDB)(Institutional Repository) is linked at the site of Institutional Repositories DataBase(IRDB)(Institutional Repository).
JAIST Repository

Search by Bookstore

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Digital

Material Type: 文書・図像類
Title: raSAT: SMT for Polynomial Inequality
Author/Editor: To, Van Khanh
Ogawa, Mizuhito
Author Heading: To, Van Khanh
Ogawa, Mizuhito
Publication, Distribution, etc.: 北陸先端科学技術大学院大学情報科学研究科
Publication Date: 2013-05-27
Publication Date (W3CDTF): 2013-05-27
Periodical title: Research report (School of Information Science, Japan Advanced Institute of Science and Technology)
No. or year of volume/issue: IS-RR-2013-003
Volume: IS-RR-2013-003
Pages: 1-23
ISSN (Periodical Title): ISSN : 0918-7553
Text Language Code: eng
Subject Heading: interval arithmetic
affine arithmetic
SMT
polynomial constraints
testing
Target Audience: 一般
Note (General): 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
Access Restrictions: 限定公開
Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）
https://irdb.nii.ac.jp
Original Data Provider (Database): 北陸先端科学技術大学院大学 : JAIST学術研究成果リポジトリ