株式会社極東書店トップ ＞ 商品一覧 ＞ Theory and Applications of Satisfiability Testing - SAT 2017: 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. 1st ed. 2017
商品詳細
Theory and Applications of Satisfiability Testing - SAT 2017: 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. 1st ed. 2017
・ISBN 978-3-319-66262-6 paper EUR 49.99
￥13,361.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Gaspers, Serge / Walsh, Toby (eds.), |
|---|---|
| シリーズ | (Lecture Notes in Computer Science) |
| 出版社 | (Springer International Publishing AG, SZ) |
| 出版年月 | 2017 |
| ページ数 | 476 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A01-90372＞ |
解説
This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017.
The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.
The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.