모금 9월 15일 2024 – 10월 1일 2024 모금에 대해서

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
온라인으로 읽기
로의 변환이 실행 중입니다
로의 변환이 실패되었습니다

주로 사용되는 용어