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

This volume contains the papers presented at SAT 2007: 10th International Conference on Theory and Applications of Satis?ability Testing. The International Conferences on Theory and Applications of Satis?ability Testing (SAT) originated in 1996 as a series of workshops "on Satis?ability."...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Marques-Silva, Joao (Editor ), Sakallah, Karem A. (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edición:1st ed. 2007.
Colección:Theoretical Computer Science and General Issues, 4501
Temas:
Machine theory.
Algorithms.
Operating systems (Computers).
Numerical analysis.
Artificial intelligence.
Mathematical logic.
Formal Languages and Automata Theory.
Operating Systems.
Numerical Analysis.
Artificial Intelligence.
Mathematical Logic and Foundations.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares