Book Volume 7962 2013

Theory and Applications of Satisfiability Testing – SAT 2013

16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings

Editors:

ISBN: 978-3-642-39070-8 (Print) 978-3-642-39071-5 (Online)

Table of contents (34 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Chapter

      Pages 1-17

      The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs

    2. No Access

      Chapter

      Pages 18-18

      Turing’s Computable Real Numbers and Why They Are Still Important Today

    3. No Access

      Chapter

      Pages 19-21

      There Are No CNF Problems

  3. Best Paper

    1. No Access

      Chapter

      Pages 22-39

      Soundness of Inprocessing in Clause Sharing SAT Solvers

  4. Technical Papers

    1. Propositional Proof Complexity I

      1. No Access

        Chapter

        Pages 40-51

        Exponential Separations in a Hierarchy of Clause Learning Proof Systems

      2. No Access

        Chapter

        Pages 52-66

        On the Resolution Complexity of Graph Non-isomorphism

      Quantified Boolean Formulas

      1. No Access

        Chapter

        Pages 67-82

        On Propositional QBF Expansions and Q-Resolution

      2. No Access

        Chapter

        Pages 83-99

        Recovering and Utilizing Partial Duality in QBF

      3. No Access

        Chapter

        Pages 100-115

        Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation

      Parallel Solving

      1. No Access

        Chapter

        Pages 116-132

        Concurrent Clause Strengthening

      2. No Access

        Chapter

        Pages 133-149

        Parallel MUS Extraction

      Maximum Satisfiability

      1. No Access

        Chapter

        Pages 150-165

        A Modular Approach to MaxSAT Modulo Theories

      2. No Access

        Chapter

        Pages 166-181

        Exploiting the Power of mip Solvers in maxsat

      3. No Access

        Chapter

        Pages 182-191

        Community-Based Partitioning for MaxSAT Solving

      Encodings and Applications

      1. No Access

        Chapter

        Pages 192-207

        Experiments with Reduction Finding

      2. No Access

        Chapter

        Pages 208-223

        A Constraint Satisfaction Approach for Programmable Logic Detailed Placement

      3. No Access

        Chapter

        Pages 224-232

        Minimizing Models for Tseitin-Encoded SAT Instances

      Beyond SAT

      1. No Access

        Chapter

        Pages 233-249

        Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability

      2. No Access

        Chapter

        Pages 250-266

        Quantified Maximum Satisfiability:

      3. No Access

        Chapter

        Pages 267-275

        Nested Boolean Functions as Models for Quantified Boolean Formulas

previous Page of 2