Cargando…
Handbook of Satisfiability : Handbook of Satisfiability.
"Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through S...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam :
IOS Press,
2009.
|
| Colección: | Frontiers in artificial intelligence and applications.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Mi 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocn935268045 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 160123s2009 ne o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d OCLCO |d OCLCQ |d MERUC |d ZCU |d ICG |d OCLCO |d OCLCF |d OCLCQ |d OCLCO |d OCLCQ |d DKC |d AU@ |d OCLCQ |d OCL |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO | ||
| 020 | |a 9781607503767 | ||
| 020 | |a 160750376X | ||
| 029 | 1 | |a DEBBG |b BV044137260 | |
| 035 | |a (OCoLC)935268045 | ||
| 050 | 4 | |a QA9.3 ǂb H36 2009eb | |
| 082 | 0 | 4 | |a 006.3 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Biere, A. | |
| 245 | 1 | 0 | |a Handbook of Satisfiability : |b Handbook of Satisfiability. |
| 260 | |a Amsterdam : |b IOS Press, |c 2009. | ||
| 300 | |a 1 online resource (980 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Frontiers in Artificial Intelligence and Applications ; |v v. 185 | |
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Title page; Contents; Part I. Theory and Algorithms; Chapter 1. A History of Satisfiability; 1.1 Preface: the concept of satisfiability; 1.2 The ancients; 1.3 The medieval period; 1.4 The renaissance; 1.5 The first logic machine; 1.6 Boolean algebra; 1.7 Frege, logicism, and quantification logic; 1.8 Russell and Whitehead; 1.9 G""odel's incompleteness theorem; 1.10 Effective process and recursive functions; 1.11 Herbrand's theorem; 1.12 Model theory and Satisfiability; 1.13 Completeness of first-order logic; 1.14 Application of logic to circuits; 1.15 Resolution. | |
| 505 | 8 | |a 1.16 The complexity or resolution1.17 Refinement of Resolution-Based SAT Solvers; 1.18 Upper bounds; 1.19 Classes of easy expressions; 1.20 Binary Decision Diagrams; 1.21 Probabilistic analysis: SAT algorithms; 1.22 Probabilistic analysis: thresholds; 1.23 Stochastic Local Search; 1.24 Maximum Satisfiability; 1.25 Nonlinear formulations; 1.26 Pseudo-Boolean Forms; 1.27 Quantified Boolean formulas; References; Chapter 2. CNF Encodings; 2.1 Introduction; 2.2 Transformation to CNF; 2.3 Case studies; 2.4 Desirable properties of CNF encodings; 2.5 Conclusion; References. | |
| 505 | 8 | |a Chapter 3. Complete Algorithms3.1 Introduction; 3.2 Technical Preliminaries; 3.3 Satisfiability by Existential Quantification; 3.4 Satisfiability by Inference Rules; 3.5 Satisfiability by Search: The DPLL Algorithm; 3.6 Satisfiability by Combining Search and Inference; 3.7 Conclusions; References; Chapter 4. CDCL Solvers; 4.1 Introduction; 4.2 Notation; 4.3 Organization of CDCL Solvers; 4.4 Conflict Analysis; 4.5 Modern CDCL Solvers; 4.6 Bibliographical and Historical Notes; References; Chapter 5. Look-Ahead Based SAT Solvers; 5.1 Introduction; 5.2 General and Historical Overview. | |
| 505 | 8 | |a 5.3 Heuristics5.4 Additional Reasoning; 5.5 Eager Data-Structures; References; Chapter 6. Incomplete Algorithms; 6.1 Greedy Search and Focused Random Walk; 6.2 Extensions of the Basic Local Search Method; 6.3 Discrete Lagrangian Methods; 6.4 The Phase Transition Phenomenon in Random k-SAT; 6.5 A New Technique for Random k-SAT: Survey Propagation; 6.6 Conclusion; References; Chapter 7. Fundaments of Branching Heuristics; 7.1 Introduction; 7.2 A general framework for branching algorithms; 7.3 Branching tuples and the canonical projection; 7.4 Estimating tree sizes. | |
| 505 | 8 | |a 7.5 Axiomatising the canonical order on branching tuples7.6 Alternative projections for restricted branching width; 7.7 How to select distances and measures; 7.8 Optimising distance functions; 7.9 The order of branches; 7.10 Beyond clause-sets; 7.11 Conclusion and outlook; References; Chapter 8. Random Satisfiability; 8.1 Introduction; 8.2 The State of the Art; 8.3 Random MAX k-SAT; 8.4 Physical Predictions for Solution-space Geometry; 8.5 The Role of the Second Moment Method; 8.6 Generative models; 8.7 Algorithms; 8.8 Belief/Survey Propagation and the Algorithmic Barrier. | |
| 500 | |a 8.9 Backtracking Algorithms. | ||
| 520 | |a "Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. My personal interest in SAT stems from actual solving: The increase in power of modern SAT solvers over the past 15 years has been phenomenal. It has become the key enabling technology in automated verification of both computer hardware and software. Bounded Model Checking (BMC) of computer hardware. | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Propositional calculus |v Congresses. | |
| 650 | 0 | |a Decision making |v Congresses. | |
| 650 | 0 | |a Computer algorithms |v Congresses. | |
| 650 | 0 | |a Algebra, Boolean |v Congresses. | |
| 650 | 6 | |a Calcul propositionnel |v Congrès. | |
| 650 | 6 | |a Prise de décision |v Congrès. | |
| 650 | 6 | |a Algorithmes |v Congrès. | |
| 650 | 6 | |a Algèbre de Boole |v Congrès. | |
| 650 | 7 | |a Algebra, Boolean |2 fast | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Decision making |2 fast | |
| 650 | 7 | |a Propositional calculus |2 fast | |
| 655 | 7 | |a Conference papers and proceedings |2 fast | |
| 700 | 1 | |a Heule, M. | |
| 700 | 1 | |a Van Maaren, H. | |
| 776 | 0 | 8 | |i Print version: |a Biere, A. |t Handbook of Satisfiability : Handbook of Satisfiability. |d Amsterdam : IOS Press, ©2009 |z 9781586039295 |
| 830 | 0 | |a Frontiers in artificial intelligence and applications. | |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=448770 |z Texto completo |
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL448770 | ||
| 994 | |a 92 |b IZTAP | ||