Theory and applications of satisfiability testing -- SAT 2021 : 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings

Theory and applications of satisfiability testing -- SAT 2021 : 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings / Chu-Min Li, Felip Manyà (eds.).

This book constitutes the proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021, which took place in Barcelona, Spain, in July 2021. The 37 full papers presented in this volume were carefully reviewed and selected from 73 submissions. They de...

Full description

Saved in:
Bibliographic Details
Corporate Author: SAT (Conference) Barcelona, Spain ; Online)
Other Authors: Li, Chu-Min (Editor), Manyà, Felip (Editor)
Format: eBook
Language:English
Published: Cham, Switzerland : Springer, [2021]
Series:Lecture notes in computer science ; 12831.
LNCS sublibrary. Theoretical computer science and general issues.
Subjects:
Computer algorithms > Congresses.
Computer software > Verification > Congresses.
Computer algorithms
Computer software > Verification
proceedings (reports)
Conference papers and proceedings
Conference papers and proceedings.
Actes de congrès.
Online Access:Click for online access

MARC

LEADER 00000cam a2200000 i 4500
001 on1259439469
003 OCoLC
005 20240909213021.0
006 m o d
007 cr cnu|||unuuu
008 210708s2021 sz a o 101 0 eng d
040 |a GW5XE  |b eng  |e rda  |e pn  |c GW5XE  |d OCLCO  |d EBLCP  |d OCLCF  |d DCT  |d OCLCQ  |d COM  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
019 |a 1266810919 
020 |a 9783030802233  |q (electronic bk.) 
020 |a 303080223X  |q (electronic bk.) 
020 |z 9783030802226  |q (print) 
024 7 |a 10.1007/978-3-030-80223-3  |2 doi 
035 |a (OCoLC)1259439469  |z (OCoLC)1266810919 
037 |b Springer 
050 4 |a QA76.9.A43 
072 7 |a UY  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UY  |2 thema 
072 7 |a UYA  |2 thema 
049 |a HCDD 
111 2 |a SAT (Conference)  |n (24th :  |d 2021 :  |c Barcelona, Spain ; Online) 
245 1 0 |a Theory and applications of satisfiability testing -- SAT 2021 :  |b 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings /  |c Chu-Min Li, Felip Manyà (eds.). 
246 3 |a SAT 2021 
264 1 |a Cham, Switzerland :  |b Springer,  |c [2021] 
300 |a 1 online resource (xi, 564 pages) :  |b illustrations (some color) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file 
347 |b PDF 
490 1 |a Lecture notes in computer science ;  |v 12831 
490 1 |a LNCS sublibrary, SL 1, Theoretical computer science and general issues 
500 |a "Because of the COVID-19 pandemic, SAT 2021 followed a hybrid format, with both in-person and virtual participation options."--Preface 
520 |a This book constitutes the proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021, which took place in Barcelona, Spain, in July 2021. The 37 full papers presented in this volume were carefully reviewed and selected from 73 submissions. They deal with theory and applications of the propositional satisfiability problem, broadly construed. Aside from plain propositional satisfiability, the scope of the meeting includes Boolean optimization, including MaxSAT and pseudo-Boolean (PB) constraints, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), and constraint programming (CP) for problems with clear connections to Boolean reasoning. 
500 |a Includes author index. 
588 0 |a Online resource; title from PDF title page (SpringerLink, viewed July 8, 2021). 
505 0 |a Intro -- Preface -- Organization -- Contents -- OptiLog: A Framework for SAT-based Systems -- 1 Introduction -- 2 OptiLog Framework Architecture -- 2.1 Formula Module -- 2.2 SAT Solver Module -- 2.3 PB Encoder Module -- 2.4 Automatic Configuration (AC) Module -- 2.5 Adding SAT Solvers to OptiLog Through iSAT Interface -- 3 Example: The Linear MaxSAT Algorithm with OptiLog -- 4 Conclusions and Future Work -- References -- PyDGGA: Distributed GGA for Automatic Configuration -- 1 Introduction -- 2 Preliminaries -- 3 PyDGGA -- 3.1 Distributed Architecture -- 3.2 Simulation 
505 8 |a 3.3 Scheduling and Canceling -- 3.4 Instance Selection -- 3.5 Elite Mini-Tournament -- 3.6 Other Tool Enhancements -- 4 Using PyDGGA -- 5 Experiments with SAT -- 6 Conclusions and Future Work -- References -- QBFFam: A Tool for Generating QBF Families from Proof Complexity -- 1 Introduction -- 2 Related Work -- 3 Formula Families -- 4 Case Study -- 5 Conclusion -- References -- Davis and Putnam Meet Henkin: Solving DQBF with Resolution -- 1 Introduction -- 2 Preliminaries -- 3 Davis-Putnam Resolution for H-Form DQBF -- 3.1 Strategy Operations -- 3.2 Definition of the Construction 
505 8 |a 3.3 Correctness and Completeness -- 3.4 Representing Strategies -- 4 NEXP-completeness of CNF H-Form DQBF -- 5 Conclusion -- References -- Lower Bounds for QCDCL via Formula Gauge -- 1 Introduction -- 2 Preliminaries -- 3 QCDCL as a Formal Proof System -- 4 Quasi Level-Ordered Proofs -- 5 A Lower Bound Technique via Gauge -- 6 Applications of the Lower Bound Technique -- 7 Conclusion -- References -- Deep Cooperation of CDCL and Local Search for SAT -- 1 Introduction -- 2 Preliminaries -- 2.1 Preliminary Definitions and Notations -- 2.2 CDCL Solvers -- 2.3 Local Search Solvers 
505 8 |a 2.4 Experiment Preliminaries -- 3 Exploring Promising Branches by Local Search -- 4 Phase Resetting with Local Search Assignments -- 5 Branching with Conflict Frequency in Local Search -- 6 Experiments -- 7 Related Works -- 8 Conclusions -- References -- Hash-Based Preprocessing and Inprocessing Techniques in SAT Solvers -- 1 Introduction -- 2 Preliminaries -- 3 Hash-Based Methods -- 4 Probabilistic Analysis -- 5 Evaluation -- 6 Conclusions -- References -- Hardness and Optimality in QBF Proof Systems Modulo NP -- 1 Introduction -- 1.1 Organisation -- 2 Preliminaries -- 2.1 Proof Complexity 
505 8 |a 2.2 Propositional Logic -- 2.3 Quantified Boolean Formulas -- 3 Simulations with Extension Variables -- 4 Extended Q-Res Modulo NP -- 5 Weaker QBF Systems -- 6 Conclusion -- References -- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations -- 1 Introduction -- 2 Preliminaries -- 3 Reduction from Unsatisfiable to Satisfiable Formulas -- 3.1 Well-Structured Branching Programs for SearchVertex(G, c) -- 3.2 Constructing DNNF from Well-Structured Branching Programs -- 4 Adversarial Rectangle Bounds -- 5 Splitting Parity Constraints 
650 0 |a Computer algorithms  |v Congresses. 
650 0 |a Computer software  |x Verification  |v Congresses. 
650 7 |a Computer algorithms  |2 fast 
650 7 |a Computer software  |x Verification  |2 fast 
655 7 |a proceedings (reports)  |2 aat 
655 7 |a Conference papers and proceedings  |2 fast 
655 7 |a Conference papers and proceedings.  |2 lcgft 
655 7 |a Actes de congrès.  |2 rvmgf 
700 1 |a Li, Chu-Min,  |e editor  |0 (orcid)0000-0002-6886-8434  |1 https://orcid.org/0000-0002-6886-8434 
700 1 |a Manyà, Felip,  |e editor.  |1 https://orcid.org/0000-0002-8366-1458 
758 |i has work:  |a Theory and applications of satisfiability testing -- SAT 2021 (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCGTwYcdvRGJcD8XcKhbcfq  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Printed edition:  |z 9783030802226 
776 0 8 |i Printed edition:  |z 9783030802240 
830 0 |a Lecture notes in computer science ;  |v 12831. 
830 0 |a LNCS sublibrary.  |n SL 1,  |p Theoretical computer science and general issues. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://link.springer.com/10.1007/978-3-030-80223-3  |y Click for online access 
903 |a SPRING-COMP2021 
994 |a 92  |b HCD 

Similar Items