寄付 2024年9月15日 – 2024年10月1日 募金について

Handbook of Satisfiability

  • Main
  • Handbook of Satisfiability

Handbook of Satisfiability

A. Biere, M. Heule, H. van Maaren
0 / 5.0
0 comments
この本はいかがでしたか?
ファイルの質はいかがですか?
質を評価するには、本をダウンロードしてください。
ダウンロードしたファイルの質はいかがでしたか?
Propositional logic has been recognized throughout the centuries as one of the cornerstones of reasoning in philosophy and mathematics. Over time, its formalization into Boolean algebra was accompanied by the recognition that a wide range of combinatorial problems can be expressed as propositional satisfiability (SAT) problems. Because of this dual role, SAT developed into a mature, multi-faceted scientific discipline, and from the earliest days of computing a search was underway to discover how to solve SAT problems in an automated fashion.
This book, the Handbook of Satisfiability, is the second, updated and revised edition of the book first published in 2009 under the same name. The handbook aims to capture the full breadth and depth of SAT and to bring together significant progress and advances in automated solving. Topics covered span practical and theoretical research on SAT and its applications and include search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results. SAT is interpreted in a broad sense, so as well as propositional satisfiability, there are chapters covering the domain of quantified Boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT). An extensive bibliography completes each chapter.
年:
2021
版:
2
出版社:
IOS Press
言語:
english
ページ:
1484
ISBN 10:
1643681613
ISBN 13:
9781643681610
ISBN:
2021931050
シリーズ:
Frontiers in Artificial Intelligence and Applications, 336
ファイル:
PDF, 10.40 MB
IPFS:
CID , CID Blake2b
english, 2021
オンラインで読む
への変換進行中。
への変換が失敗しました。

主要なフレーズ