Search results for "3-SAT"

Hits ?▲	Authors	Title	Venue	Year	Link
36	Sibylle Möhle, Armin Biere	Backing Backtracking.	SAT	2019	DBLP DOI BibTeX RDF
36	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
36	Nikhil Vyas 0001, R. Ryan Williams	On Super Strong ETH.	SAT	2019	DBLP DOI BibTeX RDF
36	Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan	Short Proofs in QBF Expansion.	SAT	2019	DBLP DOI BibTeX RDF
36	Leroy Chew, Judith Clymo	The Equivalences of Refutational QRAT.	SAT	2019	DBLP DOI BibTeX RDF
36	Florent Capelli	Knowledge Compilation Languages as Proof Systems.	SAT	2019	DBLP DOI BibTeX RDF
36	Leander Tentrup, Markus N. Rabe	Clausal Abstraction for DQBF.	SAT	2019	DBLP DOI BibTeX RDF
36	Alex Ozdemir, Aina Niemetz, Mathias Preiner, Yoni Zohar, Clark W. Barrett	DRAT-based Bit-Vector Proofs in CVC4.	SAT	2019	DBLP DOI BibTeX RDF
36	Florian Lonsing, Uwe Egly	QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties.	SAT	2019	DBLP DOI BibTeX RDF
36	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
36	Stefan Mengel, Romain Wallon	Revisiting Graph Width Measures for CNF-Encodings.	SAT	2019	DBLP DOI BibTeX RDF
36	Albert Atserias, Massimo Lauria	Circular (Yet Sound) Proofs.	SAT	2019	DBLP DOI BibTeX RDF
36	Marijn J. H. Heule, Manuel Kauers, Martina Seidl	Local Search for Fast Matrix Multiplication.	SAT	2019	DBLP DOI BibTeX RDF
36	Benjamin Kiesl, Martina Seidl	QRAT Polynomially Simulates ∀ \text -Exp+Res.	SAT	2019	DBLP DOI BibTeX RDF
36	Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, João Marques-Silva 0001	On Computing the Union of MUSes.	SAT	2019	DBLP DOI BibTeX RDF
36	Tomás Peitl, Friedrich Slivovsky, Stefan Szeider	Proof Complexity of Fragments of Long-Distance Q-Resolution.	SAT	2019	DBLP DOI BibTeX RDF
36	Tomás Peitl, Friedrich Slivovsky, Stefan Szeider	Combining Resolution-Path Dependencies with Dependency Learning.	SAT	2019	DBLP DOI BibTeX RDF
36	Sam Buss, Neil Thapen	DRAT Proofs, Propagation Redundancy, and Extended Resolution.	SAT	2019	DBLP DOI BibTeX RDF
36	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
36	Andy Shih, Adnan Darwiche, Arthur Choi	Verifying Binarized Neural Networks by Angluin-Style Learning.	SAT	2019	DBLP DOI BibTeX RDF
36	Sima Jamali, David Mitchell	Simplifying CDCL Clause Database Reduction.	SAT	2019	DBLP DOI BibTeX RDF
36	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
36	Adrián Rebola-Pardo, Armin Biere	Two flavors of DRAT.	POS@SAT	2018	DBLP DOI BibTeX RDF
36	Norbert Manthey, Tobias Philipp	Checking Unsatisfiability Proofs in Parallel.	POS@SAT	2018	DBLP DOI BibTeX RDF
36	Anastasia-Maria Leventi-Peetz, Oliver Zendel 0002, Werner Lennartz, Kai Weber 0003	CryptoMiniSat Switches-Optimization for Solving Cryptographic Instances.	POS@SAT	2018	DBLP DOI BibTeX RDF
36	Jeremias Berg, Antti Hyttinen, Matti Järvisalo	Applications of MaxSAT in Data Analysis.	POS@SAT	2018	DBLP DOI BibTeX RDF
36	Armin Biere, Andreas Fröhlich	Evaluating CDCL Restart Schemes.	POS@SAT	2018	DBLP DOI BibTeX RDF
36	Armin Biere, Marijn Heule	The Effect of Scrambling CNFs.	POS@SAT	2018	DBLP DOI BibTeX RDF
36	Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos	Fast and Flexible Probabilistic Model Counting.	SAT	2018	DBLP DOI BibTeX RDF
36	Martin Suda 0001, Bernhard Gleiss	Local Soundness for QBF Calculi.	SAT	2018	DBLP DOI BibTeX RDF
36	Tobias Paxian, Sven Reimer, Bernd Becker 0001	Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT.	SAT	2018	DBLP DOI BibTeX RDF
36	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
36	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
36	Michael Lampis, Stefan Mengel, Valia Mitsou	QBF as an Alternative to Courcelle's Theorem.	SAT	2018	DBLP DOI BibTeX RDF
36	Hoda Abbasizanjani, Oliver Kullmann	Minimal Unsatisfiability and Minimal Strongly Connected Digraphs.	SAT	2018	DBLP DOI BibTeX RDF
36	Mikolás Janota	Circuit-Based Search Space Pruning in QBF.	SAT	2018	DBLP DOI BibTeX RDF
36	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
36	Rüdiger Ehlers, Francisco Palau Romero	Approximately Propagation Complete and Conflict Propagating Constraint Encodings.	SAT	2018	DBLP DOI BibTeX RDF
36	Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran	Exploiting Treewidth for Projected Model Counting and Its Limits.	SAT	2018	DBLP DOI BibTeX RDF
36	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
36	Nicola Galesi, Navid Talebanfard, Jacobo Torán	Cops-Robber Games and the Resolution of Tseitin Formulas.	SAT	2018	DBLP DOI BibTeX RDF
36	Ryan Berryhill, Alexander Ivrii, Andreas G. Veneris	Finding All Minimal Safe Inductive Sets.	SAT	2018	DBLP DOI BibTeX RDF
36	Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos	Fast Sampling of Perfectly Uniform Satisfying Assignments.	SAT	2018	DBLP DOI BibTeX RDF
36	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
36	Sima Jamali, David Mitchell	Centrality-Based Improvements to CDCL Heuristics.	SAT	2018	DBLP DOI BibTeX RDF
36	Alexander Nadel	Solving MaxSAT with Bit-Vector Optimization.	SAT	2018	DBLP DOI BibTeX RDF
36	Sean A. Weaver, Hannah J. Roberts, Michael J. Smith 0012	XOR-Satisfiability Set Membership Filters.	SAT	2018	DBLP DOI BibTeX RDF
36	Manuel Kauers, Martina Seidl	Symmetries of Quantified Boolean Formulas.	SAT	2018	DBLP DOI BibTeX RDF
36	Tomás Peitl, Friedrich Slivovsky, Stefan Szeider	Polynomial-Time Validation of QCDCL Certificates.	SAT	2018	DBLP DOI BibTeX RDF
36	Alexander Nadel, Vadim Ryvchin	Chronological Backtracking.	SAT	2018	DBLP DOI BibTeX RDF
36	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
36	Alexey Ignatiev, António Morgado 0001, João Marques-Silva 0001	On Tackling the Limits of Resolution in SAT Solving.	SAT	2017	DBLP DOI BibTeX RDF
36	Neha Lodha, Sebastian Ordyniak, Stefan Szeider	SAT-Encodings for Special Treewidth and Pathwidth.	SAT	2017	DBLP DOI BibTeX RDF
36	Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon	PaInleSS: A Framework for Parallel SAT Solving.	SAT	2017	DBLP DOI BibTeX RDF
36	Jo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe	Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT.	SAT	2017	DBLP DOI BibTeX RDF
36	Johannes Klaus Fichte, Neha Lodha, Stefan Szeider	SAT-Based Local Improvement for Finding Tree Decompositions of Small Width.	SAT	2017	DBLP DOI BibTeX RDF
36	Peter Lammich	The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees.	SAT	2017	DBLP DOI BibTeX RDF
36	Robert Ganian, M. S. Ramanujan 0001, Stefan Szeider	Backdoor Treewidth for SAT.	SAT	2017	DBLP DOI BibTeX RDF
36	Gilles Audemard, Laurent Simon	Extreme Cases in SAT Problems.	SAT	2016	DBLP DOI BibTeX RDF
36	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
36	Nathan Mull, Daniel J. Fremont, Sanjit A. Seshia	On the Hardness of SAT with Community Structure.	SAT	2016	DBLP DOI BibTeX RDF
36	M. Fareed Arif, Carlos Mencía, Alexey Ignatiev, Norbert Manthey, Rafael Peñaloza, João Marques-Silva 0001	BEACON: An Efficient SAT-Based Tool for Debugging EL^+ Ontologies.	SAT	2016	DBLP DOI BibTeX RDF
36	Daniel Berend, Yochai Twitto	The Normalized Autocorrelation Length of Random Max r -Sat Converges in Probability to (1-1/2^r)/r.	SAT	2016	DBLP DOI BibTeX RDF
36	Jia Hui Liang, Vijay Ganesh, Pascal Poupart, Krzysztof Czarnecki 0001	Learning Rate Based Branching Heuristic for SAT Solvers.	SAT	2016	DBLP DOI BibTeX RDF
36	Paul Saikko, Jeremias Berg, Matti Järvisalo	LMHS: A SAT-IP Hybrid MaxSAT Solver.	SAT	2016	DBLP DOI BibTeX RDF
36	Neha Lodha, Sebastian Ordyniak, Stefan Szeider	A SAT Approach to Branchwidth.	SAT	2016	DBLP DOI BibTeX RDF
36	C. K. Cuong, M. J. H. Heule	Computing Maximum Unavoidable Subgraphs Using SAT Solvers.	SAT	2016	DBLP DOI BibTeX RDF
36	Jo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe, Marc Denecker	Improved Static Symmetry Breaking for SAT.	SAT	2016	DBLP DOI BibTeX RDF
36	Norbert Manthey, Marius Lindauer	SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers.	SAT	2016	DBLP DOI BibTeX RDF
36	Stefan Falkner, Marius Lindauer, Frank Hutter	SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers.	SAT	2015	DBLP DOI BibTeX RDF
36	Ruiwen Chen, Rahul Santhanam	Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP.	SAT	2015	DBLP DOI BibTeX RDF
36	Jan Burchard, Tobias Schubert 0001, Bernd Becker 0001	Laissez-Faire Caching for Parallel #SAT Solving.	SAT	2015	DBLP DOI BibTeX RDF
36	Carlos Mencía, Alessandro Previti, João Marques-Silva 0001	SAT-Based Horn Least Upper Bounds.	SAT	2015	DBLP DOI BibTeX RDF
36	Alexey Ignatiev, Alessandro Previti, João Marques-Silva 0001	SAT-Based Formula Simplification.	SAT	2015	DBLP DOI BibTeX RDF
36	Rehan Abdul Aziz, Geoffrey Chu, Christian J. Muise, Peter J. Stuckey	#∃SAT: Projected Model Counting.	SAT	2015	DBLP DOI BibTeX RDF
36	Kuan-Hua Tu, Tzu-Chien Hsu, Jie-Hong R. Jiang	QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving.	SAT	2015	DBLP DOI BibTeX RDF
36	Alexander Ivrii, Vadim Ryvchin, Ofer Strichman	Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data.	SAT	2015	DBLP DOI BibTeX RDF
36	Zack Newsham, William Lindsay, Vijay Ganesh, Jia Hui Liang, Sebastian Fischmeister, Krzysztof Czarnecki 0001	SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers.	SAT	2015	DBLP DOI BibTeX RDF
36	Tomás Balyo, Peter Sanders 0001, Carsten Sinz	HordeSat: A Massively Parallel Portfolio SAT Solver.	SAT	2015	DBLP DOI BibTeX RDF
36	Adam Douglass, Andrew D. King, Jack Raymond	Constructing SAT Filters with a Quantum Annealer.	SAT	2015	DBLP DOI BibTeX RDF
36	Daniel Le Berre (eds.)	POS-13. Fourth Pragmatics of SAT workshop, a workshop of the SAT 2013 conference, July 7, 2013, Helsinki, Finland	POS@SAT	2014	DBLP BibTeX RDF
36	Daniel Le Berre (eds.)	POS-14. Fifth Pragmatics of SAT workshop, a workshop of the SAT 2014 conference, part of FLoC 2014 during the Vienna Summer of Logic, July 13, 2014, Vienna, Austria	POS@SAT	2014	DBLP BibTeX RDF
36	Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle	Solving MaxSAT and #SAT on Structured CNF Formulas.	SAT	2014	DBLP DOI BibTeX RDF
36	Boris Konev, Alexei Lisitsa 0001	A SAT Attack on the Erdős Discrepancy Conjecture.	SAT	2014	DBLP DOI BibTeX RDF
36	Jakob Nordström	A (Biased) Proof Complexity Survey for SAT Practitioners.	SAT	2014	DBLP DOI BibTeX RDF
36	Andrei A. Bulatov, Cong Wang 0002	Approximating Highly Satisfiable Random 2-SAT.	SAT	2014	DBLP DOI BibTeX RDF
36	Gilles Audemard, Laurent Simon	Lazy Clause Exchange Policy for Parallel SAT Solvers.	SAT	2014	DBLP DOI BibTeX RDF
36	Ronald de Haan, Stefan Szeider	Fixed-Parameter Tractable Reductions to SAT.	SAT	2014	DBLP DOI BibTeX RDF
36	Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon	Impact of Community Structure on SAT Solver Performance.	SAT	2014	DBLP DOI BibTeX RDF
36	Oliver Gableske	An Ising Model Inspired Extension of the Product-Based MP Framework for SAT.	SAT	2014	DBLP DOI BibTeX RDF
36	Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki	Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.	SAT	2014	DBLP DOI BibTeX RDF
36	Tomohiro Sonobe, Shuya Kondoh, Mary Inaba	Community Branching for Parallel Portfolio SAT Solvers.	SAT	2014	DBLP DOI BibTeX RDF
36	Alexander Nadel, Vadim Ryvchin, Ofer Strichman	Ultimately Incremental SAT.	SAT	2014	DBLP DOI BibTeX RDF
36	Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke	Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers.	POS@SAT	2014	DBLP DOI BibTeX RDF
36	Andreas Fröhlich, Gergely Kovásznai, Armin Biere, Helmut Veith	iDQ: Instantiation-Based DQBF Solving.	POS@SAT	2014	DBLP DOI BibTeX RDF
36	Enrique Matos Alfonso, Norbert Manthey	New CNF Features and Formula Classification.	POS@SAT	2014	DBLP DOI BibTeX RDF
36	Zoltán Ádám Mann, Pál András Papp	Formula partitioning revisited.	POS@SAT	2014	DBLP DOI BibTeX RDF
36	Norbert Manthey, Tobias Philipp, Christoph Wernhard	Soundness of Inprocessing in Clause Sharing SAT Solvers.	SAT	2013	DBLP DOI BibTeX RDF
36	Oliver Gableske	On the Interpolation between Product-Based Message Passing Heuristics for SAT.	SAT	2013	DBLP DOI BibTeX RDF
36	Mordechai Ben-Ari	LearnSAT: A SAT Solver for Education.	SAT	2013	DBLP DOI BibTeX RDF