Theory and Applications of Satisfiability Testing - SAT 2007: 10th International Conference Lisbon, Portugal, May 28-31, 2007 Proceedings: 4501 - Brossura

 
9783540727873: Theory and Applications of Satisfiability Testing - SAT 2007: 10th International Conference Lisbon, Portugal, May 28-31, 2007 Proceedings: 4501
Brossura
ISBN 10: 3540727876 ISBN 13: 9783540727873
Casa editrice: Springer, 2009

Sinossi

This book constitutes the refereed proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing, SAT 2007, held in Lisbon, Portugal in May 2007.

The 22 revised full papers presented together with 12 revised short papers and two invited talks cover all current research issues in propositional and quantified Boolean formula satisfiability testing.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

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.

Product Description

Book by None

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer
Data di pubblicazione
2009
Lingua
Inglese
ISBN 10 
3540727876
ISBN 13 
9783540727873
Rilegatura
Copertina flessibile
Numero di pagine
400
Redattore
Marques-Silva João
Contatto del produttore
non disponibile
Persona responsabile
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Germania

Altre edizioni note dello stesso titolo

9783540838890: Theory and Applications of Satisfiability Testing - SAT 2007

Edizione in evidenza

ISBN 10:  3540838899 ISBN 13:  9783540838890
Casa editrice: Springer, 2008
Brossura