default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd SAT 2020: Alghero, Italy
- Luca Pulina
, Martina Seidl:
Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings. Lecture Notes in Computer Science 12178, Springer 2020, ISBN 978-3-030-51824-0 - Leroy Chew, Marijn J. H. Heule:
Sorting Parity Encodings by Reusing Variables. 1-10 - Vincent Vallade, Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Vijay Ganesh, Fabrice Kordon:
Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving. 11-27 - Nick Feng, Fahiem Bacchus:
Clause Size Reduction with all-UIP Learning. 28-45 - Randy Hickey, Fahiem Bacchus:
Trail Saving on Backtrack. 46-61 - Sibylle Möhle, Roberto Sebastiani, Armin Biere:
Four Flavors of Entailment. 62-71 - Arijit Shaw, Kuldeep S. Meel:
Designing New Phase Selection Heuristics. 72-88 - Jan-Hendrik Lorenz, Florian Wörz:
On the Effect of Learned Clauses on Stochastic Local Search. 89-106 - Gilles Audemard, Loïc Paulevé, Laurent Simon:
SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers. 107-113 - Maximilian Heisinger, Mathias Fleury, Armin Biere:
Distributed Cube and Conquer with Paracooba. 114-122 - Hidetomo Nabeshima, Katsumi Inoue:
Reproducible Efficient Parallel SAT Solving. 123-138 - Stepan Kochemazov:
Improving Implementation of SAT Competitions 2017-2019 Winners. 139-148 - Nathan Mull, Shuo Pang, Alexander A. Razborov:
On CDCL-Based Proof Systems with the Ordered Decision Strategy. 149-165 - Maria Luisa Bonet, Jordi Levy:
Equivalence Between Systems Stronger Than Resolution. 166-181 - Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström:
Simplified and Improved Separations Between Regular and General Resolution by Lifting. 182-200 - Emre Yolcu, Xinyu Wu, Marijn J. H. Heule:
Mycielski Graphs and PR Proofs. 201-217 - Javier Larrosa, Emma Rollon:
Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems. 218-232 - Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh:
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. 233-249 - Durgesh Agrawal, Bhavishya, Kuldeep S. Meel:
On the Sparsity of XORs in Approximate Model Counting. 250-266 - Friedrich Slivovsky, Stefan Szeider:
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. 267-276 - Jeremias Berg, Fahiem Bacchus, Alex Poole:
Abstract Cores in Implicit Hitting Set MaxSat Solving. 277-294 - Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. 295-311 - Alexis de Colnet:
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints. 312-321 - Daniel Le Berre, Pierre Marquis, Romain Wallon:
On Weakening Strategies for PB Solvers. 322-331 - Carlos Mencía, João Marques-Silva:
Reasoning About Strong Inconsistency in ASP. 332-342 - Markus Hecher, Patrick Thier, Stefan Woltran:
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. 343-360 - Thomas Seed, Andy King, Neil Evans:
Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases. 361-377 - Martin Jonás, Jan Strejcek:
Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions. 378-393 - Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl:
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. 394-411 - Ankit Shukla, Friedrich Slivovsky, Stefan Szeider:
Short Q-Resolution Proofs with Homomorphisms. 412-428 - Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger:
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness. 429-446 - Valentin Mayer-Eichberger, Abdallah Saffidine:
Positional Games and QBF: The Corrective Encoding. 447-463 - Matthew Anderson, Zongliang Ji, Anthony Yang Xu:
Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles. 464-480 - Milan Ceska, Jirí Matyás, Vojtech Mrazek, Tomás Vojnar:
Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits. 481-491 - Rüdiger Ehlers, Kai Treutler, Volker Wesling:
SAT Solving with Fragmented Hamiltonian Path Constraints for Wire Arc Additive Manufacturing. 492-500 - Mikolás Janota, António Morgado:
SAT-Based Encodings for Optimal Decision Trees with Explicit Paths. 501-518 - Michal Karpinski, Marek Piotrów:
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks. 519-535
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-03 22:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
