| 書目名稱 | Theory and Applications of Satisfiability Testing – SAT 2018 |
| 副標(biāo)題 | 21st International C |
| 編輯 | Olaf Beyersdorff,Christoph M. Wintersteiger |
| 視頻video | http://file.papertrans.cn/924/923600/923600.mp4 |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | This book constitutes the refereed proceedings of the 21st International?Conference on Theory and Applications of Satisfiability Testing, SAT?2018, held in Oxford, UK, in July 2018..The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address?different aspects of?SAT interpreted in a broad sense, including theoretical?advances (such as exact algorithms, proof complexity, and other complexity issues),?practical search algorithms, knowledge compilation, implementation-level?details of SAT solvers and SAT-based systems, problem encodings and reformulations,?applications as well as?case studies and reports on findings based on?rigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications.. |
| 出版日期 | Conference proceedings 2018 |
| 關(guān)鍵詞 | artificial intelligence; competition; computer architecture; computer programming; formal logic; formal v |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-319-94144-8 |
| isbn_softcover | 978-3-319-94143-1 |
| isbn_ebook | 978-3-319-94144-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer International Publishing AG, part of Springer Nature 2018 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-4 23:26
發(fā)表于 2025-3-21 18:22:52
