Theory and Applications of Satisfiability Testing - SAT 2007: 10th International Conference, SAT 2007, Lisbon, Portugal, May 28-31, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4501
Editat de Joao Marques-Silva, Karem A. Sakallahen Limba Engleză Paperback – 18 mai 2007
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 567.60 lei
- 20% Preț: 571.63 lei
- 15% Preț: 568.74 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 574.05 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 20% Preț: 649.49 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 20% Preț: 575.48 lei
- 20% Preț: 747.79 lei
- 20% Preț: 1053.45 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 809.19 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 1159.14 lei
- 20% Preț: 747.79 lei
- Preț: 389.48 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 332.50 lei
Preț vechi: 415.63 lei
-20% Nou
Puncte Express: 499
Preț estimativ în valută:
63.63€ • 66.10$ • 52.86£
63.63€ • 66.10$ • 52.86£
Carte tipărită la comandă
Livrare economică 01-15 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540727873
ISBN-10: 3540727876
Pagini: 388
Ilustrații: XII, 388 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.61 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540727876
Pagini: 388
Ilustrații: XII, 388 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.61 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
Professional/practitionerCuprins
SAT: Past and Future.- Encodings of Problems in Effectively Propositional Logic.- Efficient Circuit to CNF Conversion.- Mapping CSP into Many-Valued SAT.- Circuit Based Encoding of CNF Formula.- Breaking Symmetries in SAT Matrix Models.- Partial Max-SAT Solvers with Clause Learning.- MiniMaxSat: A New Weighted Max-SAT Solver.- Solving Multi-objective Pseudo-Boolean Problems.- Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities.- Horn Upper Bounds and Renaming.- Matched Formulas and Backdoor Sets.- Short XORs for Model Counting: From Theory to Practice.- Variable Dependency in Local Search: Prevention Is Better Than Cure.- Combining Adaptive Noise and Look-Ahead in Local Search for SAT.- From Idempotent Generalized Boolean Assignments to Multi-bit Search.- Satisfiability with Exponential Families.- Formalizing Dangerous SAT Encodings.- Algorithms for Variable-Weighted 2-SAT and Dual Problems.- On the Boolean Connectivity Problem for Horn Relations.- A First Step Towards a Unified Proof Checker for QBF.- Dynamically Partitioning for Solving QBF.- Backdoor Sets of Quantified Boolean Formulas.- Bounded Universal Expansion for Preprocessing QBF.- Effective Incorporation of Double Look-Ahead Procedures.- Applying Logic Synthesis for Speeding Up SAT.- Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver.- A Lightweight Component Caching Scheme for Satisfiability Solvers.- Minimum 2CNF Resolution Refutations in Polynomial Time.- Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices.- Verifying Propositional Unsatisfiability: Pitfalls to Avoid.- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories.- SAT Solving for Termination Analysis with Polynomial Interpretations.- Fault Localization and Correction with QBF.- Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach.- Inversion Attacks on Secure Hash Functions Using sat Solvers.