Cantitate/Preț
Produs
Total produse
Vezi coșul
Theory and Applications of Satisfiability Testing – SAT 2016: 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings de Nadia Creignou

Theory and Applications of Satisfiability Testing – SAT 2016: 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9710

Editat de Nadia Creignou, Daniel Le Berre
en Limba Engleză Paperback – 12 iun 2016
This book constitutes the refereed proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, held in Bordeaux, France, in July 2016.
The 31 regular papers, 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including complexity, satisfiability solving, satisfiability applications, satisfiability modulop theory, beyond SAT, quantified Boolean formula, and dependency QBF.
 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 30079 lei

Preț vechi: 37599 lei
-20% Nou

Puncte Express: 451
Preț estimativ în valută:
5757€ • 5984$ • 4769£

Carte disponibilă

Livrare economică 14-28 ianuarie 25
Livrare express 31 decembrie 24 - 04 ianuarie 25 pentru 4465 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319409696
ISBN-10: 3319409697
Pagini: 542
Ilustrații: XXIV, 564 p. 119 illus.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.82 kg
Ediția:1st ed. 2016
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Parameterized Compilation Lower Bounds for Restricted CNF-formulas.- Satisfiability via Smooth Pictures.- Solution-Graphs of Boolean Formulas and Isomorphism.- Strong Backdoors for Default Logic.- The Normalized Autocorrelation Length of Max r-Sat Converges in Probability to (1-1/2=r)/r.- Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle.- Extreme Cases in SAT Problems.- Improved Static Symmetry Breaking for SAT.- Learning Rate Based Branching Heuristic for SAT Solvers.- On the Hardness of SAT with Community Structure.- Trade-offs between Time and Memory in a Tighter Model of CDCL SAT Solvers.- A SAT Approach to Branch Width.- Computing Maximum Unavoidable Subgraphs Using SAT Solvers.- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT.- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer.- Deciding Bit-Vector Formulas with mcSAT.- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams.- Speeding Up the Constraint-Based Method in Difference Logic.- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers.- Finding Finite Models in Multi-Sorted First Order Logic.- MCS Extraction with Sublinear Oracle Queries.- Predicate Elimination for Preprocessing in First-Order Theorem Proving.- Quantified Boolean Formula Incremental Determinization.- Non-prenex QBF Solving using Abstraction.- On Q-Resolution and CDCL QBF Solving.- On Stronger Calculi for QBFs.- Q-Resolution with Generalized Axioms.- 2QBF: Challenges and Solutions.- Dependency Schemes for DQBF.- Lifting QBF Resolution Calculi to DQBF.- Long Distance Q-Resolution with Dependency Schemes.- BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies.- HordeQBF: A Modular and Massively Parallel QBF Solver.- LMHS: A SAT-IP Hybrid MaxSAT Solver.- OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing.- SpyBug: Automated Bug Detection in the Con_guration Space of SAT Solvers. 

Caracteristici

Includes supplementary material: sn.pub/extras