| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 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 |
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 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, Alexey Ignatiev, Maria Luisa Bonet, João Marques-Silva, 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 |
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, 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 |
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, João Marques-Silva |
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 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, Vijay Ganesh |
Machine Learning-Based Restart Policy for CDCL SAT Solvers. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Scholl, Ralf Wimmer |
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 |
|
| 1 | Dmitry Itsykson, Alexander Knop |
Hard Satisfiable Formulas for Splittings by Linear Combinations. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus N. Rabe |
A Resolution-Style Proof System for DQBF. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kucera, Petr Savický, Vojtech Vorel |
A Lower Bound on CNF Encodings of the At-Most-One Constraint. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Søndergaard, Peter J. Stuckey |
A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Panos Theodoropoulos |
Probabilistic Model Counting with Short XORs. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Previti, Carlos Mencía, Matti Järvisalo, João Marques-Silva |
Improving MCS Enumeration via Caching. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexey Ignatiev, António Morgado, João Marques-Silva |
On Tackling the Limits of Resolution in SAT Solving. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Stefan Szeider |
New Width Parameters for Model Counting. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
SAT-Encodings for Special Treewidth and Pathwidth. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Toby Walsh (eds.) |
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Jia Hui Liang, Hari Govind V. K., Pascal Poupart, Krzysztof Czarnecki, Vijay Ganesh |
An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Saeed Nejati, Zack Newsham, Joseph Scott, Jia Hui Liang, Catherine H. Gebotys, Pascal Poupart, Vijay Ganesh |
A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Antti E. J. Hyvärinen, Sepideh Asadi, Karine Even-Mendoza, Grigory Fedyukovich, Hana Chockler, Natasha Sharygina |
Theory Refinement for Program Verification. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo |
MaxPre: An Extended MaxSAT Preprocessor. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker 0001 |
From DQBF to QBF by Dependency Elimination. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Blinkhorn, Olaf Beyersdorff |
Shortening QBF Proofs with Dependency Schemes. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals |
CNFgen: A Generator of Crafted Benchmarks. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon |
PaInleSS: A Framework for Parallel SAT Solving. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Hidetomo Nabeshima, Katsumi Inoue |
Coverage-Based Clause Reduction Heuristics for CDCL Solvers. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary |
A Distributed Version of Syrup. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Jo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe |
Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldan Cohen, Guoyu Huang, J. Christopher Beck |
(I Can Get) Satisfaction: Preference-Based Scheduling for Concert-Goers at Multi-venue Music Festivals. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Peitl, Friedrich Slivovsky, Stefan Szeider |
Dependency Learning for QBF. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Miguel Terra-Neves, Inês Lynce, Vasco M. Manquinho |
Introducing Pareto Minimal Correction Subsets. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen |
An Adaptive Prefix-Assignment Technique for Symmetry Reduction. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Klaus Fichte, Neha Lodha, Stefan Szeider |
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Lammich |
The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
Backdoor Treewidth for SAT. |
SAT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Peitl, Friedrich Slivovsky, Stefan Szeider |
Long Distance Q-Resolution with Dependency Schemes. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilles Audemard, Laurent Simon |
Extreme Cases in SAT Problems. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda 0001 |
Lifting QBF Resolution Calculi to DQBF. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Candeago, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio |
Speeding up the Constraint-Based Method in Difference Logic. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Mencía, Alexey Ignatiev, Alessandro Previti, João Marques-Silva |
MCS Extraction with Sublinear Oracle Queries. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals |
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek |
Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Vsevolod Oparin |
Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Valeriy Balabanov, Jie-Hong Roland Jiang, Christoph Scholl, Alan Mishchenko, Robert K. Brayton |
2QBF: Challenges and Solutions. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralf Wimmer, Christoph Scholl, Karina Wimmer, Bernd Becker 0001 |
Dependency Schemes for DQBF. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Jonás, Jan Strejcek |
Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Mull, Daniel J. Fremont, Sanjit A. Seshia |
On the Hardness of SAT with Community Structure. |
SAT |
2016 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license