Limit search to available items
Book Cover
E-book
Author SAT 2007 (2007 : Lisbon, Portugal)

Title Theory and applications of satisfiability testing : SAT 2007 : 10th international conference, Lisbon, Portugal, May 28-31, 2007 : proceedings / Joao Marques-Silva, Karem A. Sakallah (eds.)
Published Berlin ; New York : Springer, [2007]
©2007
Online access available from:
Springer eBooks    View Resource Record  

Copies

Description 1 online resource (xi, 384 pages) : illustrations
Series Lecture notes in computer science, 0302-9743 ; 4501
Lecture notes in computer science ; 4501. 0302-9743
Contents 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
Bibliography Includes bibliographical references and index
Notes Print version record
Subject Propositional calculus -- Congresses.
Decision making -- Congresses.
Computer algorithms -- Congresses.
Genre/Form Conference papers and proceedings.
Conference papers and proceedings.
Form Electronic book
Author Marques-Silva, João.
Sakallah, Karem A.
ISBN 9783540727880
3540727884
9783540727873
3540727876
Other Titles SAT 2007