Limit search to available items
Book Cover
E-book
Author SAT (Conference) (21st : 2018 : Oxford, England)

Title Theory and applications of satisfiability testing -- SAT 2018 : 21st International Conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings / Olaf Beyersdorff, Christoph M. Wintersteiger (eds.)
Published Cham, Switzerland : Springer, 2018

Copies

Description 1 online resource (xix, 452 pages) : illustrations
Series Lecture notes in computer science, 0302-9743 ; 10929
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Lecture notes in computer science ; 10929. 0302-9743
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Contents Intro -- Preface -- Organization -- Invited Talks -- Computable Short Proofs#x8E;#x90; -- Modelling SAT -- Contents -- Invited Talk -- Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications -- 1 Introduction -- 2 Notions and Problem Definition -- 3 Overview of Solution Methods -- 3.1 Incomplete Approximations -- 3.2 Search-Based Solution -- 3.3 Abstraction-Based Solution -- 3.4 Fork Resolution -- 3.5 Basic Approach Using Universal Expansion -- 3.6 Transformation into QBF -- 3.7 The Role of Preprocessing -- 3.8 Computing Skolem Functions -- 4 Applications
4.1 Partial Equivalence Checking for Combinational Circuits -- 4.2 Controller Synthesis -- 4.3 Realizability Checking for Sequential Circuits -- 5 Conclusion and Future Challenges -- References -- Maximum Satisfiability -- Approximately Propagation Complete and Conflict Propagating Constraint Encodings -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries -- 3 Approximate Propagation Completeness and Conflict Propagation -- 4 Computing Minimal Approximately Optimal Encodings -- 4.1 Ensuring Encoding Correctness -- 4.2 Encoding Approximate Propagation Completeness
4.3 Encoding Approximate Conflict Propagation -- 4.4 MaxSAT Solving -- 5 Experiments -- 5.1 Case Study: Integer Factoring -- 6 Conclusion -- References -- Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 3.1 MaxSAT -- 3.2 Totalizer Network -- 3.3 Polynomial Watchdog Encoding Scheme -- 4 Dynamic PW Encoding and GPW Algorithm -- 4.1 Dynamic PW Encoding -- 4.2 Dynamic GPW Algorithm -- 5 PW Encoding Optimizations -- 5.1 Caching of Adder -- 5.2 Cone-of-Influence Encoding -- 5.3 Exact Bound Encoding -- 6 Experimental Results
7 Conclusions -- References -- Solving MaxSAT with Bit-Vector Optimization -- 1 Introduction -- 2 Preliminaries -- 2.1 SAT Solving -- 2.2 State-of-the-Art Unweighted MaxSAT Solvers -- 2.3 Totalizer Encoding -- 3 Responsiveness and Incrementality -- 3.1 Responsiveness -- 3.2 Incrementality -- 4 Optimization Modulo Bit-Vectors (OBV) Algorithms -- 5 Mrs. Beaver: An Unweighted MaxSAT Algorithm -- 5.1 Mrs. Beaver and Linear Search -- 5.2 Mrs. Beaver-Inc: The Incomplete Preprocessor -- 5.3 Responsiveness -- 5.4 Incrementality -- 6 Applying Mrs. Beaver to Solve BMO -- 7 Experimental Results
7.1 Unweighted MaxSAT: MaxSAT Evaluation 2017 -- 7.2 Industrial Instances -- 8 Conclusion -- References -- Conflict Driven Clause Learning -- Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers -- 1 Introduction -- 1.1 Our Investigations and Conclusions -- 1.2 Organization of this Paper -- 2 Experimental Set-up -- 3 Description of Benchmarks -- 4 Experimental Evaluation -- 4.1 Pseudo-Boolean Solvers and Boolean Reasoning -- 4.2 Pseudo-Boolean Solvers and Linear Programming -- 4.3 Pseudo-Boolean Solvers Versus CDCL and MIP -- 5 Concluding Remarks -- References
Summary This book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018. The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address different aspects of SAT interpreted in a broad sense, including theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications as well as case studies and reports on findings based on rigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications
Notes International conference proceedings
Online resource; title from PDF title page (SpringerLink, viewed July 9, 2018)
Subject Computer algorithms -- Congresses
Computer software -- Verification -- Congresses
Artificial intelligence.
Software Engineering.
Computer programming -- software development.
Discrete mathematics.
Algorithms & data structures.
Computer science.
Computers -- Intelligence (AI) & Semantics.
Computers -- Software Development & Engineering -- General.
Computers -- Programming -- General.
Computers -- Data Processing.
Computers -- Data Modeling & Design.
Computers -- Computer Science.
Computer algorithms
Computer software -- Verification
Genre/Form Conference papers and proceedings
proceedings (reports)
Conference papers and proceedings
Conference papers and proceedings.
Actes de congrès.
Form Electronic book
Author Beyersdorff, Olaf, editor
Wintersteiger, Christoph M., editor
Federated Logic Conference (2018 : Oxford, England), jointly held conference.
ISBN 9783319941448
3319941445
Other Titles SAT 2018