Theory and applications of satisfiability testing -- SAT 2019 : 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings /: 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings. (2019)

• Record Type: Book
• Other Titles: SAT 2019
• Further Information: Note: Mikoláš Janota, Inês Lynce (eds.).
• Editors: Janota, Mikolá́š̌; Lynce, Inês
• Other Names: SAT (Conference), 22nd
• Contents: Computational Sustainability: Computing for a Better World.- Machine Learning in Automated and Interactive Theorem Proving.- Circular (Yet Sound) Proofs.- Short Proofs in QBF Expansion.- Proof Complexity of QBF Symmetry Recomputation.- Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model.- DRAT Proofs, Propagation Redundancy, and Extended Resolution.- Knowledge Compilation Languages as Proof Systems.- The Equivalences of Refutational QRAT.- A SAT-based System for Consistent Query Answering.- Incremental Inprocessing in SAT Solving.- Local Search for Fast Matrix Multiplication.- Speeding Up Assumption-Based SAT.- Simplifying CDCL Clause Database Reduction.- QRAT Polynomially Simulates nforall-Exp+Res.- QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties.- On Computing the Union of MUSes.- Revisiting Graph Width Measures for CNF-Encodings.- DRMaxSAT with MaxHS: First Contact.- Backing Backtracking.- Assessing Heuristic Machine Learning Explanations with Model Counting.- Syntax-Guided Rewrite Rule Enumeration for SMT Solvers.- DRAT-based Bit-Vector Proofs in CVC4.- Combining Resolution-Path Dependencies with Dependency Learning.- Proof Complexity of Fragments of Long-Distance Q-Resolution.- Guiding High-Performance SAT Solvers with Unsat-Core Predictions.- Verifying Binarized Neural Networks by Angluin-Style Learning.- CrystalBall: Gazing in the Black Box of SAT Solving.- Clausal Abstraction for DQBF.- On Super Strong ETH.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2019
• Extent: 1 online resource (xiv, 425 pages), illustrations (some color)
• Subjects: 005.1; Computer algorithms -- Congresses; Computer software -- Verification -- Congresses; Electronic books
• Languages: English
• ISBNs: 9783030242589; 3030242587
• Related ISBNs: 9783030242572
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed July 22, 2019).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.