| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Norbert Manthey |
The MergeSat Solver.  |
SAT  |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiwei Jin, Yiqi Lv, Cunjing Ge, Feifei Ma, Jian Zhang 0001 |
Investigating the Existence of Costas Latin Squares via Satisfiability Testing. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider |
Certified DQBF Solving by Definition Extraction. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Larrosa, Emma Rollon |
Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ankit Shukla, Friedrich Slivovsky, Stefan Szeider |
Short Q-Resolution Proofs with Homomorphisms. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Jonás, Jan Strejcek |
Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Durgesh Agrawal, Bhavishya, Kuldeep S. Meel |
On the Sparsity of XORs in Approximate Model Counting. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Mencía, João Marques-Silva 0001 |
Reasoning About Strong Inconsistency in ASP. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Maximilian Heisinger, Mathias Fleury, Armin Biere |
Distributed Cube and Conquer with Paracooba. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Hidetomo Nabeshima, Katsumi Inoue |
Reproducible Efficient Parallel SAT Solving. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Anderson, Zongliang Ji, Anthony Yang Xu |
Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Milan Ceska 0002, Jirí Matyás, Vojtech Mrazek, Tomás Vojnar |
Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Emre Yolcu, Xinyu Wu, Marijn J. H. Heule |
Mycielski Graphs and PR Proofs. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger |
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin Mayer-Eichberger, Abdallah Saffidine |
Positional Games and QBF: The Corrective Encoding. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilles Audemard, Loïc Paulevé, Laurent Simon |
SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Filmus, Meena Mahajan, Gaurav Sood 0001, Marc Vinyals |
MaxSAT Resolution and Subcube Sums. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Chunxiao Li 0002, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh |
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexis de Colnet |
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nick Feng, Fahiem Bacchus |
Clause Size Reduction with all-UIP Learning. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vallade, Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Vijay Ganesh, Fabrice Kordon |
Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Randy Hickey, Fahiem Bacchus |
Trail Saving on Backtrack. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Hecher, Patrick Thier, Stefan Woltran |
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Leroy Chew, Marijn J. H. Heule |
Sorting Parity Encodings by Reusing Variables. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Slivovsky, Stefan Szeider |
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Pulina, Martina Seidl (eds.) |
Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Jordi Levy |
Equivalence Between Systems Stronger Than Resolution. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Karpinski, Marek Piotrów |
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Arijit Shaw, Kuldeep S. Meel |
Designing New Phase Selection Heuristics. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Seed, Andy King, Neil Evans |
Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremias Berg, Fahiem Bacchus, Alex Poole |
Abstract Cores in Implicit Hitting Set MaxSat Solving. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolás Janota, António Morgado 0001 |
SAT-Based Encodings for Optimal Decision Trees with Explicit Paths. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan-Hendrik Lorenz, Florian Wörz |
On the Effect of Learned Clauses on Stochastic Local Search. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sibylle Möhle, Roberto Sebastiani, Armin Biere |
Four Flavors of Entailment. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Ehlers, Kai Treutler, Volker Wesling |
SAT Solving with Fragmented Hamiltonian Path Constraints for Wire Arc Additive Manufacturing. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl |
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Le Berre, Pierre Marquis, Romain Wallon |
On Weakening Strategies for PB Solvers. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Mull, Shuo Pang, Alexander A. Razborov |
On CDCL-Based Proof Systems with the Ordered Decision Strategy. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström |
Simplified and Improved Separations Between Regular and General Resolution by Lifting. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Stepan Kochemazov |
Improving Implementation of SAT Competitions 2017-2019 Winners. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Blinkhorn, Olaf Beyersdorff |
Proof Complexity of QBF Symmetry Recomputation. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sibylle Möhle, Armin Biere |
Backing Backtracking. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Nina Narodytska, Aditya A. Shrotri, Kuldeep S. Meel, Alexey Ignatiev, João Marques-Silva 0001 |
Assessing Heuristic Machine Learning Explanations with Model Counting. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolás Janota, Inês Lynce (eds.) |
Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Vyas 0001, R. Ryan Williams |
On Super Strong ETH. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan |
Short Proofs in QBF Expansion. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Leroy Chew, Judith Clymo |
The Equivalences of Refutational QRAT. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Capelli |
Knowledge Compilation Languages as Proof Systems. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mate Soos, Raghav Kulkarni, Kuldeep S. Meel |
CrystalBall: Gazing in the Black Box of SAT Solving. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Leander Tentrup, Markus N. Rabe |
Clausal Abstraction for DQBF. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Selsam, Nikolaj S. Bjørner |
Guiding High-Performance SAT Solvers with Unsat-Core Predictions. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Ozdemir, Aina Niemetz, Mathias Preiner, Yoni Zohar, Clark W. Barrett |
DRAT-based Bit-Vector Proofs in CVC4. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Lonsing, Uwe Egly |
QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | António Morgado 0001, Alexey Ignatiev, Maria Luisa Bonet, João Marques-Silva 0001, Sam Buss |
DRMaxSAT with MaxHS: First Contact. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Mengel, Romain Wallon |
Revisiting Graph Width Measures for CNF-Encodings. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Massimo Lauria |
Circular (Yet Sound) Proofs. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marijn J. H. Heule, Manuel Kauers, Martina Seidl |
Local Search for Fast Matrix Multiplication. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Kiesl, Martina Seidl |
QRAT Polynomially Simulates ∀ \text -Exp+Res. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, João Marques-Silva 0001 |
On Computing the Union of MUSes. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Peitl, Friedrich Slivovsky, Stefan Szeider |
Proof Complexity of Fragments of Long-Distance Q-Resolution. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Peitl, Friedrich Slivovsky, Stefan Szeider |
Combining Resolution-Path Dependencies with Dependency Learning. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Akhil A. Dixit, Phokion G. Kolaitis |
A SAT-Based System for Consistent Query Answering. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sam Buss, Neil Thapen |
DRAT Proofs, Propagation Redundancy, and Extended Resolution. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleksii Omelchenko, Andrei A. Bulatov |
Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Randy Hickey, Fahiem Bacchus |
Speeding Up Assumption-Based SAT. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andres Nötzli, Andrew Reynolds 0001, Haniel Barbosa, Aina Niemetz, Mathias Preiner, Clark W. Barrett, Cesare Tinelli |
Syntax-Guided Rewrite Rule Enumeration for SMT Solvers. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andy Shih, Adnan Darwiche, Arthur Choi |
Verifying Binarized Neural Networks by Angluin-Style Learning. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Fazekas, Armin Biere, Christoph Scholl 0001 |
Incremental Inprocessing in SAT Solving. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sima Jamali, David Mitchell |
Simplifying CDCL Clause Database Reduction. |
SAT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström |
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos |
Fast and Flexible Probabilistic Model Counting. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Suda 0001, Bernhard Gleiss |
Local Soundness for QBF Calculi. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Paxian, Sven Reimer, Bernd Becker 0001 |
Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, Roberto Sebastiani |
Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexey Ignatiev, António Morgado 0001, João Marques-Silva 0001 |
PySAT: A Python Toolkit for Prototyping with SAT Oracles. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich 0001, Ralf Rothenberger |
Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Svyatoslav Korneev, Nina Narodytska, Luca Pulina, Armando Tacchella, Nikolaj S. Bjørner, Mooly Sagiv |
Constrained Image Generation Using Binarized Neural Networks with Decision Procedures. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Lampis, Stefan Mengel, Valia Mitsou |
QBF as an Alternative to Courcelle's Theorem. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoda Abbasizanjani, Oliver Kullmann |
Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolás Janota |
Circuit-Based Search Space Pruning in QBF. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Shubhani Gupta, Aseem Saxena, Anmol Mahajan, Sorav Bansal |
Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Ehlers, Francisco Palau Romero |
Approximately Propagation Complete and Conflict Propagating Constraint Encodings. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
Exploiting Treewidth for Projected Model Counting and Its Limits. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Jia Hui Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li 0002, Vijay Ganesh |
Machine Learning-Based Restart Policy for CDCL SAT Solvers. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Scholl 0001, Ralf Wimmer 0001 |
Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Navid Talebanfard, Jacobo Torán |
Cops-Robber Games and the Resolution of Tseitin Formulas. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Christoph M. Wintersteiger (eds.) |
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 |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Berryhill, Alexander Ivrii, Andreas G. Veneris |
Finding All Minimal Safe Inductive Sets. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Stepan Kochemazov, Oleg Zaikin 0002 |
ALIAS: A Modular Tool for Finding Backdoors for SAT. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos |
Fast Sampling of Perfectly Uniform Satisfying Assignments. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals |
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sima Jamali, David Mitchell |
Centrality-Based Improvements to CDCL Heuristics. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Nadel |
Solving MaxSAT with Bit-Vector Optimization. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean A. Weaver, Hannah J. Roberts, Michael J. Smith 0012 |
XOR-Satisfiability Set Membership Filters. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Kauers, Martina Seidl |
Symmetries of Quantified Boolean Formulas. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Peitl, Friedrich Slivovsky, Stefan Szeider |
Polynomial-Time Validation of QCDCL Certificates. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Nadel, Vadim Ryvchin |
Chronological Backtracking. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Baud-Berthier, Jesús Giráldez-Cru, Laurent Simon |
On the Community Structure of Bounded Model Checking SAT Problems. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Jonás, Jan Strejcek |
On Simplification of Formulas with Unconstrained Variables and Quantifiers. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Kiesl, Marijn J. H. Heule, Martina Seidl |
A Little Blocked Literal Goes a Long Way. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license