Handbook satisfiability (17 résultats)
Handbook of Satisfiability (Frontiers in Artificial Intelligence and Applications, 336)
Biere, Armin (Editor) / Heule, Marijn (Editor) / Walsh, Toby (Editor) / Van Maaren, Hans (Editor)
- Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-UniRevaluation Books
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 272,96
EUR 23,45 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : Brand New. 2nd edition. 1465 pages. 9.50x6.75x3.75 inches. In Stock.
- Couverture rigide
Vendeur : Chiron Media, Wallingford, Royaume-UniChiron Media
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 307,27
EUR 18,16 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 3 disponible(s)
Hardcover. Etat : New.
- Couverture rigide
Vendeur : Ria Christie Collections, Uxbridge, Royaume-UniRia Christie Collections
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 323,26
EUR 14,05 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 3 disponible(s)
Etat : New. In English.
Handbook of Satisfiability
Biere, A. (Editor)/ Heule, M. (Editor)/ Van Maaren, H. (Editor)/ Walsh, T. (Editor)
- Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-UniRevaluation Books
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 312,49
EUR 23,45 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 2 disponible(s)
Hardcover. Etat : Brand New. 980 pages. 9.25x6.50x2.25 inches. In Stock.
- Couverture rigide
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandeKennys Bookshop and Art Galleries Ltd.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 333,07
EUR 10,50 expéditionExpédition depuis Irlande vers Etats-UnisQuantité disponible : 3 disponible(s)
Etat : New. 2021. 2nd Edition. hardcover. . . . . .
- Couverture rigide
Vendeur : Kennys Bookstore, Olney, MD, Etats-UnisKennys Bookstore
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 358,71
EUR 9,19 expéditionExpédition nationale : Etats-UnisQuantité disponible : 3 disponible(s)
Etat : New. 2021. 2nd Edition. hardcover. . . . . . Books ship from the US and Ireland.
- Couverture rigide
Vendeur : Majestic Books, Hounslow, Royaume-UniMajestic Books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 360,54
EUR 7,62 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 3 disponible(s)
Etat : New. ppp. 1465.
- Couverture rigide
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-UnisGrand Eagle Retail
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 368,95
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : new. Hardcover. 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 proposition…al 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.This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work.Edmund Clarke, 2007 ACM Turing Award Recipient:""SAT solving is a key technology for 21st century computer science.""Donald Knuth, 1974 ACM Turing Award Recipient:""SAT is evidently a killer app, because it is key to the solution of so many other problems.""Stephen Cook, 1982 ACM Turing Award Recipient:""The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?"" Second Edition. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
- Couverture souple
Vendeur : moluna, Greven, Allemagnemoluna
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 322,80
EUR 48,99 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 3 disponible(s)
Einband - fest (Hardcover). Etat : New. Second Edition.
- Couverture rigide
Vendeur : Books Puddle, New York, NY, Etats-UnisBooks Puddle
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 407,57
EUR 3,49 expéditionExpédition nationale : Etats-UnisQuantité disponible : 3 disponible(s)
Etat : New. ppp. 1465.
- Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 337,79
EUR 73,37 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
Buch. Etat : Neu. Neuware - 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 sat…isfiability (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.This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work.Edmund Clarke, 2007 ACM Turing Award Recipient: ''SAT solving is a key technology for 21st century computer science.''Donald Knuth, 1974 ACM Turing Award Recipient:''SAT is evidently a killer app, because it is key to the solution of so many other problems.''Stephen Cook, 1982 ACM Turing Award Recipient:''The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard ''.
- Couverture rigide
Vendeur : Biblios, frankfurt am main, HESSE, AllemagneBiblios
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 426,65
EUR 9,95 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 3 disponible(s)
Etat : New. ppp. 1465.
- Couverture rigide
Vendeur : AussieBookSeller, Truganina, VIC, AustralieAussieBookSeller
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 533,90
EUR 32,39 expéditionExpédition depuis Australie vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : new. Hardcover. 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 proposition…al 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.This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work.Edmund Clarke, 2007 ACM Turing Award Recipient:""SAT solving is a key technology for 21st century computer science.""Donald Knuth, 1974 ACM Turing Award Recipient:""SAT is evidently a killer app, because it is key to the solution of so many other problems.""Stephen Cook, 1982 ACM Turing Award Recipient:""The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?"" Second Edition. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
- Couverture rigide
- impression à la demande
Vendeur : CitiRetail, Stevenage, Royaume-UniCitiRetail
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 213,77
EUR 43,39 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Hardcover. Etat : new. Hardcover. 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 proposition…al 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.This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work.Edmund Clarke, 2007 ACM Turing Award Recipient:""SAT solving is a key technology for 21st century computer science.""Donald Knuth, 1974 ACM Turing Award Recipient:""SAT is evidently a killer app, because it is key to the solution of so many other problems.""Stephen Cook, 1982 ACM Turing Award Recipient:""The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?"" Second Edition. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
- Couverture rigide
- impression à la demande
Vendeur : moluna, Greven, Allemagnemoluna
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 207,97
EUR 48,99 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers.KlappentextA collection of papers on various theoretical and practical aspects of SAT solving…. It is suit.
- Couverture rigide
- impression à la demande
Vendeur : preigu, Osnabrück, Allemagnepreigu
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 215,60
EUR 70,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponible(s)
Buch. Etat : Neu. Handbook of Satisfiability | A. Biere (u. a.) | Buch | Englisch | 2009 | IOS Press | EAN 9781586039295 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
- Couverture rigide
- impression à la demande
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 259,58
EUR 68,51 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Buch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - '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 is now probably the most widely used model checking technique. The counterexamples that it finds are just satisfying instances of a Boolean formula obtained by unwinding to some fixed depth a sequential circuit and its specification in linear temporal logic. Extending model checking to software verification is a much more difficult problem on the frontier of current research. One promising approach for languages like C with finite word-length integers is to use the same idea as in BMC but with a decision procedure for the theory of bit-vectors instead of SAT. All decision procedures for bit-vectors that I am familiar with ultimately make use of a fast SAT solver to handle complex formulas. Decision procedures for more complicated theories, like linear real and integer arithmetic, are also used in program verification. Most of them use powerful SAT solvers in an essential way. Clearly, efficient SAT solving is a key technology for 21st century computer science. I expect this collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field.'--Edmund Clarke (FORE Systems University Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University, winner of the 2007 A.M. Turing Award).
