:facetid:toc:\"db/conf/sat/sat2019.bht\"OK:facetid:toc:db/conf/sat/sat2019.bhtAlbert AtseriasMassimo LauriaCircular (Yet Sound) Proofs.SAT1-182019Conference and Workshop Papersclosedconf/sat/AtseriasL1910.1007/978-3-030-24258-9_1https://doi.org/10.1007/978-3-030-24258-9_1https://dblp.org/rec/conf/sat/AtseriasL19URL#2647688Olaf BeyersdorffLeroy ChewJudith ClymoMeena MahajanShort Proofs in QBF Expansion.SAT19-352019Conference and Workshop Papersclosedconf/sat/BeyersdorffCCM1910.1007/978-3-030-24258-9_2https://doi.org/10.1007/978-3-030-24258-9_2https://dblp.org/rec/conf/sat/BeyersdorffCCM19URL#2647689Joshua BlinkhornOlaf BeyersdorffProof Complexity of QBF Symmetry Recomputation.SAT36-522019Conference and Workshop Papersclosedconf/sat/BlinkhornB1910.1007/978-3-030-24258-9_3https://doi.org/10.1007/978-3-030-24258-9_3https://dblp.org/rec/conf/sat/BlinkhornB19URL#2647690Sam BussNeil ThapenDRAT Proofs, Propagation Redundancy, and Extended Resolution.SAT71-892019Conference and Workshop Papersclosedconf/sat/BussT1910.1007/978-3-030-24258-9_5https://doi.org/10.1007/978-3-030-24258-9_5https://dblp.org/rec/conf/sat/BussT19URL#2647691Florent CapelliKnowledge Compilation Languages as Proof Systems.SAT90-992019Conference and Workshop Papersclosedconf/sat/Capelli1910.1007/978-3-030-24258-9_6https://doi.org/10.1007/978-3-030-24258-9_6https://dblp.org/rec/conf/sat/Capelli19URL#2647692Leroy ChewJudith ClymoThe Equivalences of Refutational QRAT.SAT100-1162019Conference and Workshop Papersclosedconf/sat/ChewC1910.1007/978-3-030-24258-9_7https://doi.org/10.1007/978-3-030-24258-9_7https://dblp.org/rec/conf/sat/ChewC19URL#2647693Akhil A. DixitPhokion G. KolaitisA SAT-Based System for Consistent Query Answering.SAT117-1352019Conference and Workshop Papersclosedconf/sat/DixitK1910.1007/978-3-030-24258-9_8https://doi.org/10.1007/978-3-030-24258-9_8https://dblp.org/rec/conf/sat/DixitK19URL#2647694Katalin FazekasArmin BiereChristoph Scholl 0001Incremental Inprocessing in SAT Solving.SAT136-1542019Conference and Workshop Papersclosedconf/sat/FazekasBS1910.1007/978-3-030-24258-9_9https://doi.org/10.1007/978-3-030-24258-9_9https://dblp.org/rec/conf/sat/FazekasBS19URL#2647695Marijn J. H. HeuleManuel KauersMartina SeidlLocal Search for Fast Matrix Multiplication.SAT155-1632019Conference and Workshop Papersclosedconf/sat/HeuleKS1910.1007/978-3-030-24258-9_10https://doi.org/10.1007/978-3-030-24258-9_10https://dblp.org/rec/conf/sat/HeuleKS19URL#2647696Randy HickeyFahiem BacchusSpeeding Up Assumption-Based SAT.SAT164-1822019Conference and Workshop Papersclosedconf/sat/HickeyB1910.1007/978-3-030-24258-9_11https://doi.org/10.1007/978-3-030-24258-9_11https://dblp.org/rec/conf/sat/HickeyB19URL#2647697Sima JamaliDavid MitchellSimplifying CDCL Clause Database Reduction.SAT183-1922019Conference and Workshop Papersclosedconf/sat/JamaliM1910.1007/978-3-030-24258-9_12https://doi.org/10.1007/978-3-030-24258-9_12https://dblp.org/rec/conf/sat/JamaliM19URL#2647698Benjamin KieslMartina SeidlQRAT Polynomially Simulates ∀ \text -Exp+Res.SAT193-2022019Conference and Workshop Papersclosedconf/sat/KieslS1910.1007/978-3-030-24258-9_13https://doi.org/10.1007/978-3-030-24258-9_13https://dblp.org/rec/conf/sat/KieslS19URL#2647699Florian LonsingUwe EglyQRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties.SAT203-2102019Conference and Workshop Papersclosedconf/sat/LonsingE1910.1007/978-3-030-24258-9_14https://doi.org/10.1007/978-3-030-24258-9_14https://dblp.org/rec/conf/sat/LonsingE19URL#2647700Carlos MencíaOliver KullmannAlexey IgnatievJoão Marques-Silva 0001On Computing the Union of MUSes.SAT211-2212019Conference and Workshop Papersclosedconf/sat/MenciaKIM1910.1007/978-3-030-24258-9_15https://doi.org/10.1007/978-3-030-24258-9_15https://dblp.org/rec/conf/sat/MenciaKIM19URL#2647701Stefan MengelRomain WallonRevisiting Graph Width Measures for CNF-Encodings.SAT222-2382019Conference and Workshop Papersclosedconf/sat/MengelW1910.1007/978-3-030-24258-9_16https://doi.org/10.1007/978-3-030-24258-9_16https://dblp.org/rec/conf/sat/MengelW19URL#2647702Sibylle MöhleArmin BiereBacking Backtracking.SAT250-2662019Conference and Workshop Papersclosedconf/sat/MohleB1910.1007/978-3-030-24258-9_18https://doi.org/10.1007/978-3-030-24258-9_18https://dblp.org/rec/conf/sat/MohleB19URL#2647703António Morgado 0001Alexey IgnatievMaria Luisa BonetJoão Marques-Silva 0001Sam BussDRMaxSAT with MaxHS: First Contact.SAT239-2492019Conference and Workshop Papersclosedconf/sat/MorgadoIBMB1910.1007/978-3-030-24258-9_17https://doi.org/10.1007/978-3-030-24258-9_17https://dblp.org/rec/conf/sat/MorgadoIBMB19URL#2647704Nina NarodytskaAditya A. ShrotriKuldeep S. MeelAlexey IgnatievJoão Marques-Silva 0001Assessing Heuristic Machine Learning Explanations with Model Counting.SAT267-2782019Conference and Workshop Papersclosedconf/sat/NarodytskaSMIM1910.1007/978-3-030-24258-9_19https://doi.org/10.1007/978-3-030-24258-9_19https://dblp.org/rec/conf/sat/NarodytskaSMIM19URL#2647705Andres NötzliAndrew Reynolds 0001Haniel BarbosaAina NiemetzMathias PreinerClark W. BarrettCesare TinelliSyntax-Guided Rewrite Rule Enumeration for SMT Solvers.SAT279-2972019Conference and Workshop Papersclosedconf/sat/NotzliRBNPBT1910.1007/978-3-030-24258-9_20https://doi.org/10.1007/978-3-030-24258-9_20https://dblp.org/rec/conf/sat/NotzliRBNPBT19URL#2647706Oleksii OmelchenkoAndrei A. BulatovSatisfiability Threshold for Power Law Random 2-SAT in Configuration Model.SAT53-702019Conference and Workshop Papersclosedconf/sat/OmelchenkoB1910.1007/978-3-030-24258-9_4https://doi.org/10.1007/978-3-030-24258-9_4https://dblp.org/rec/conf/sat/OmelchenkoB19URL#2647707Alex OzdemirAina NiemetzMathias PreinerYoni ZoharClark W. BarrettDRAT-based Bit-Vector Proofs in CVC4.SAT298-3052019Conference and Workshop Papersclosedconf/sat/OzdemirNPZB1910.1007/978-3-030-24258-9_21https://doi.org/10.1007/978-3-030-24258-9_21https://dblp.org/rec/conf/sat/OzdemirNPZB19URL#2647708Tomás PeitlFriedrich SlivovskyStefan SzeiderCombining Resolution-Path Dependencies with Dependency Learning.SAT306-3182019Conference and Workshop Papersclosedconf/sat/PeitlSS1910.1007/978-3-030-24258-9_22https://doi.org/10.1007/978-3-030-24258-9_22https://dblp.org/rec/conf/sat/PeitlSS19URL#2647709Tomás PeitlFriedrich SlivovskyStefan SzeiderProof Complexity of Fragments of Long-Distance Q-Resolution.SAT319-3352019Conference and Workshop Papersclosedconf/sat/PeitlSS19a10.1007/978-3-030-24258-9_23https://doi.org/10.1007/978-3-030-24258-9_23https://dblp.org/rec/conf/sat/PeitlSS19aURL#2647710Daniel SelsamNikolaj S. BjørnerGuiding High-Performance SAT Solvers with Unsat-Core Predictions.SAT336-3532019Conference and Workshop Papersclosedconf/sat/SelsamB1910.1007/978-3-030-24258-9_24https://doi.org/10.1007/978-3-030-24258-9_24https://dblp.org/rec/conf/sat/SelsamB19URL#2647711Andy ShihAdnan DarwicheArthur ChoiVerifying Binarized Neural Networks by Angluin-Style Learning.SAT354-3702019Conference and Workshop Papersclosedconf/sat/ShihDC1910.1007/978-3-030-24258-9_25https://doi.org/10.1007/978-3-030-24258-9_25https://dblp.org/rec/conf/sat/ShihDC19URL#2647712Mate SoosRaghav KulkarniKuldeep S. MeelCrystalBall: Gazing in the Black Box of SAT Solving.SAT371-3872019Conference and Workshop Papersclosedconf/sat/SoosKM1910.1007/978-3-030-24258-9_26https://doi.org/10.1007/978-3-030-24258-9_26https://dblp.org/rec/conf/sat/SoosKM19URL#2647713Leander TentrupMarkus N. RabeClausal Abstraction for DQBF.SAT388-4052019Conference and Workshop Papersclosedconf/sat/TentrupR1910.1007/978-3-030-24258-9_27https://doi.org/10.1007/978-3-030-24258-9_27https://dblp.org/rec/conf/sat/TentrupR19URL#2647714Nikhil Vyas 0001R. Ryan WilliamsOn Super Strong ETH.SAT406-4232019Conference and Workshop Papersclosedconf/sat/VyasW1910.1007/978-3-030-24258-9_28https://doi.org/10.1007/978-3-030-24258-9_28https://dblp.org/rec/conf/sat/VyasW19URL#2647715Mikolás JanotaInês LynceTheory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, ProceedingsSATLecture Notes in Computer Science11628Springer2019Editorshipconf/sat/201910.1007/978-3-030-24258-9https://doi.org/10.1007/978-3-030-24258-9https://dblp.org/rec/conf/sat/2019URL#2677884