Theory and Applications of Satisfiability Testing - SAT 2007: 10th International Conference, SAT 2007, Lisbon, Portugal, May 28-31, 2007, Proceedings . Computer Science and General Issues)

Marques-Silva, Joao [Editor]; Sakallah, Karem A. [Editor];

ISBN 10: 3540727876 / ISBN 13: 9783540727873

Editore: Springer, 2007

Riguardo questo articolo

Ex-library paperback in very nice condition with the usual markings and attachments. Codice articolo UTD14a-0526

Dati bibliografici

Titolo: Theory and Applications of Satisfiability ...

Casa editrice: Springer

Data di pubblicazione: 2007

Legatura: Paperback

Condizione: Very Good

Descrizione articolo

Riassunto:

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.

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.