Search results for "SAT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
37	Edmund M. Clarke, Daniel Kroening, Natasha Sharygina, Karen Yorav	Predicate Abstraction of ANSI-C Programs Using SAT.	Formal Methods Syst. Des.	2004	DBLP DOI BibTeX RDF	ANSI-C, SAT, predicate abstraction
37	Slawomir Pilarski, Gracia Hu	SAT with partial clauses and back-leaps.	DAC	2002	DBLP DOI BibTeX RDF	SAT, boolean satisfiability, design verification
37	Bernhard Beckert, Reiner Hähnle, Felip Manyà	The 2-SAT Problem of Regular Signed CNF Formulas.	ISMVL	2000	DBLP DOI BibTeX RDF	signed logic, NP-completeness, SAT, Many-valued logic
37	Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap	A Comparison of SAT Encodings for Acyclicity of Directed Graphs.	SAT	2023	DBLP DOI BibTeX RDF
37	Markus Kirchweger, Manfred Scheucher, Stefan Szeider	SAT-Based Generation of Planar Graphs.	SAT	2023	DBLP DOI BibTeX RDF
37	Alexander Nadel	Solving Huge Instances with Intel(R) SAT Solver.	SAT	2023	DBLP DOI BibTeX RDF
37	Jiong Yang 0002, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel	Explaining SAT Solving Using Causal Reasoning.	SAT	2023	DBLP DOI BibTeX RDF
37	Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani	On CNF Conversion for Disjoint SAT Enumeration.	SAT	2023	DBLP DOI BibTeX RDF
37	Anshujit Sharma, Matthew Burns, Michael C. Huang 0001	Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT.	SAT	2023	DBLP DOI BibTeX RDF
37	Markus Kirchweger, Tomás Peitl, Stefan Szeider	A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture.	SAT	2023	DBLP DOI BibTeX RDF
37	Markus Anders, Pascal Schweitzer, Mate Soos	Algorithms Transcending the SAT-Symmetry Interface.	SAT	2023	DBLP DOI BibTeX RDF
37	Alexander Nadel	Introducing Intel(R) SAT Solver.	SAT	2022	DBLP DOI BibTeX RDF
37	Jakob Bach, Markus Iser, Klemens Böhm	A Comprehensive Study of k-Portfolios of Recent SAT Solvers.	SAT	2022	DBLP DOI BibTeX RDF
37	Iván Garzón, Pablo Mesejo, Jesús Giráldez-Cru	On the Performance of Deep Generative Models of Realistic SAT Instances.	SAT	2022	DBLP DOI BibTeX RDF
37	Gilles Audemard, Jean-Marie Lagniez, Marie Miceli	A New Exact Solver for (Weighted) Max#SAT.	SAT	2022	DBLP DOI BibTeX RDF
37	Markus Anders	SAT Preprocessors and Symmetry.	SAT	2022	DBLP DOI BibTeX RDF
37	Miguel Cabral, Mikolás Janota, Vasco M. Manquinho	SAT-Based Leximax Optimisation Algorithms.	SAT	2022	DBLP DOI BibTeX RDF
37	Markus Kirchweger, Manfred Scheucher, Stefan Szeider	A SAT Attack on Rota's Basis Conjecture.	SAT	2022	DBLP DOI BibTeX RDF
37	Lucas Berent, Lukas Burgholzer, Robert Wille	Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond.	SAT	2022	DBLP DOI BibTeX RDF
37	Tobias Friedrich 0001, Frank Neumann 0001, Ralf Rothenberger, Andrew M. Sutton	Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily.	SAT	2021	DBLP DOI BibTeX RDF
37	Pei Huang 0002, Rundong Li, Minghao Liu 0001, Feifei Ma, Jian Zhang 0001	Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5.	SAT	2021	DBLP DOI BibTeX RDF
37	Nicolas Prevot, Mate Soos, Kuldeep S. Meel	Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving.	SAT	2021	DBLP DOI BibTeX RDF
37	Henrik E. C. Cao	Hash-Based Preprocessing and Inprocessing Techniques in SAT Solvers.	SAT	2021	DBLP DOI BibTeX RDF
37	Junqiang Peng 0001, Mingyu Xiao 0001	A Fast Algorithm for SAT in Terms of Formula Length.	SAT	2021	DBLP DOI BibTeX RDF
37	Matthieu Py, Mohamed Sami Cherif, Djamal Habet	A Proof Builder for Max-SAT.	SAT	2021	DBLP DOI BibTeX RDF
37	Dominik Schreiber, Peter Sanders 0001	Scalable SAT Solving in the Cloud.	SAT	2021	DBLP DOI BibTeX RDF
37	Carlos Ansótegui, Jesus Ojeda, António Pacheco 0004, Josep Pon, Josep M. Salvia, Eduard Torres	OptiLog: A Framework for SAT-based Systems.	SAT	2021	DBLP DOI BibTeX RDF
37	Alexey Ignatiev, João Marques-Silva 0001	SAT-Based Rigorous Explanations for Decision Lists.	SAT	2021	DBLP DOI BibTeX RDF
37	Shaowei Cai 0001, Xindi Zhang	Deep Cooperation of CDCL and Local Search for SAT.	SAT	2021	DBLP DOI BibTeX RDF
37	Hidetomo Nabeshima, Katsumi Inoue	Reproducible Efficient Parallel SAT Solving.	SAT	2020	DBLP DOI BibTeX RDF
37	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
37	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
37	Thomas Seed, Andy King, Neil Evans	Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases.	SAT	2020	DBLP DOI BibTeX RDF
37	Mikolás Janota, António Morgado 0001	SAT-Based Encodings for Optimal Decision Trees with Explicit Paths.	SAT	2020	DBLP DOI BibTeX RDF
37	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
37	Stepan Kochemazov	Improving Implementation of SAT Competitions 2017-2019 Winners.	SAT	2020	DBLP DOI BibTeX RDF
37	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
37	Joshua Blinkhorn, Olaf Beyersdorff	Proof Complexity of QBF Symmetry Recomputation.	SAT	2019	DBLP DOI BibTeX RDF
37	Sibylle Möhle, Armin Biere	Backing Backtracking.	SAT	2019	DBLP DOI BibTeX RDF
37	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
37	Nikhil Vyas 0001, R. Ryan Williams	On Super Strong ETH.	SAT	2019	DBLP DOI BibTeX RDF
37	Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan	Short Proofs in QBF Expansion.	SAT	2019	DBLP DOI BibTeX RDF
37	Leroy Chew, Judith Clymo	The Equivalences of Refutational QRAT.	SAT	2019	DBLP DOI BibTeX RDF
37	Florent Capelli	Knowledge Compilation Languages as Proof Systems.	SAT	2019	DBLP DOI BibTeX RDF
37	Leander Tentrup, Markus N. Rabe	Clausal Abstraction for DQBF.	SAT	2019	DBLP DOI BibTeX RDF
37	Alex Ozdemir, Aina Niemetz, Mathias Preiner, Yoni Zohar, Clark W. Barrett	DRAT-based Bit-Vector Proofs in CVC4.	SAT	2019	DBLP DOI BibTeX RDF
37	Florian Lonsing, Uwe Egly	QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties.	SAT	2019	DBLP DOI BibTeX RDF
37	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
37	Stefan Mengel, Romain Wallon	Revisiting Graph Width Measures for CNF-Encodings.	SAT	2019	DBLP DOI BibTeX RDF
37	Albert Atserias, Massimo Lauria	Circular (Yet Sound) Proofs.	SAT	2019	DBLP DOI BibTeX RDF
37	Marijn J. H. Heule, Manuel Kauers, Martina Seidl	Local Search for Fast Matrix Multiplication.	SAT	2019	DBLP DOI BibTeX RDF
37	Benjamin Kiesl, Martina Seidl	QRAT Polynomially Simulates ∀ \text -Exp+Res.	SAT	2019	DBLP DOI BibTeX RDF
37	Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, João Marques-Silva 0001	On Computing the Union of MUSes.	SAT	2019	DBLP DOI BibTeX RDF
37	Tomás Peitl, Friedrich Slivovsky, Stefan Szeider	Proof Complexity of Fragments of Long-Distance Q-Resolution.	SAT	2019	DBLP DOI BibTeX RDF
37	Tomás Peitl, Friedrich Slivovsky, Stefan Szeider	Combining Resolution-Path Dependencies with Dependency Learning.	SAT	2019	DBLP DOI BibTeX RDF
37	Sam Buss, Neil Thapen	DRAT Proofs, Propagation Redundancy, and Extended Resolution.	SAT	2019	DBLP DOI BibTeX RDF
37	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
37	Andy Shih, Adnan Darwiche, Arthur Choi	Verifying Binarized Neural Networks by Angluin-Style Learning.	SAT	2019	DBLP DOI BibTeX RDF
37	Sima Jamali, David Mitchell	Simplifying CDCL Clause Database Reduction.	SAT	2019	DBLP DOI BibTeX RDF
37	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
37	Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos	Fast and Flexible Probabilistic Model Counting.	SAT	2018	DBLP DOI BibTeX RDF
37	Martin Suda 0001, Bernhard Gleiss	Local Soundness for QBF Calculi.	SAT	2018	DBLP DOI BibTeX RDF
37	Tobias Paxian, Sven Reimer, Bernd Becker 0001	Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT.	SAT	2018	DBLP DOI BibTeX RDF
37	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
37	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
37	Michael Lampis, Stefan Mengel, Valia Mitsou	QBF as an Alternative to Courcelle's Theorem.	SAT	2018	DBLP DOI BibTeX RDF
37	Hoda Abbasizanjani, Oliver Kullmann	Minimal Unsatisfiability and Minimal Strongly Connected Digraphs.	SAT	2018	DBLP DOI BibTeX RDF
37	Mikolás Janota	Circuit-Based Search Space Pruning in QBF.	SAT	2018	DBLP DOI BibTeX RDF
37	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
37	Rüdiger Ehlers, Francisco Palau Romero	Approximately Propagation Complete and Conflict Propagating Constraint Encodings.	SAT	2018	DBLP DOI BibTeX RDF
37	Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran	Exploiting Treewidth for Projected Model Counting and Its Limits.	SAT	2018	DBLP DOI BibTeX RDF
37	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
37	Nicola Galesi, Navid Talebanfard, Jacobo Torán	Cops-Robber Games and the Resolution of Tseitin Formulas.	SAT	2018	DBLP DOI BibTeX RDF
37	Ryan Berryhill, Alexander Ivrii, Andreas G. Veneris	Finding All Minimal Safe Inductive Sets.	SAT	2018	DBLP DOI BibTeX RDF
37	Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos	Fast Sampling of Perfectly Uniform Satisfying Assignments.	SAT	2018	DBLP DOI BibTeX RDF
37	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
37	Sima Jamali, David Mitchell	Centrality-Based Improvements to CDCL Heuristics.	SAT	2018	DBLP DOI BibTeX RDF
37	Alexander Nadel	Solving MaxSAT with Bit-Vector Optimization.	SAT	2018	DBLP DOI BibTeX RDF
37	Sean A. Weaver, Hannah J. Roberts, Michael J. Smith 0012	XOR-Satisfiability Set Membership Filters.	SAT	2018	DBLP DOI BibTeX RDF
37	Manuel Kauers, Martina Seidl	Symmetries of Quantified Boolean Formulas.	SAT	2018	DBLP DOI BibTeX RDF
37	Tomás Peitl, Friedrich Slivovsky, Stefan Szeider	Polynomial-Time Validation of QCDCL Certificates.	SAT	2018	DBLP DOI BibTeX RDF
37	Alexander Nadel, Vadim Ryvchin	Chronological Backtracking.	SAT	2018	DBLP DOI BibTeX RDF
37	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
37	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
37	Neha Lodha, Sebastian Ordyniak, Stefan Szeider	SAT-Encodings for Special Treewidth and Pathwidth.	SAT	2017	DBLP DOI BibTeX RDF
37	Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon	PaInleSS: A Framework for Parallel SAT Solving.	SAT	2017	DBLP DOI BibTeX RDF
37	Jo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe	Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT.	SAT	2017	DBLP DOI BibTeX RDF
37	Johannes Klaus Fichte, Neha Lodha, Stefan Szeider	SAT-Based Local Improvement for Finding Tree Decompositions of Small Width.	SAT	2017	DBLP DOI BibTeX RDF
37	Peter Lammich	The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees.	SAT	2017	DBLP DOI BibTeX RDF
37	Robert Ganian, M. S. Ramanujan 0001, Stefan Szeider	Backdoor Treewidth for SAT.	SAT	2017	DBLP DOI BibTeX RDF
37	Gilles Audemard, Laurent Simon	Extreme Cases in SAT Problems.	SAT	2016	DBLP DOI BibTeX RDF
37	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
37	Nathan Mull, Daniel J. Fremont, Sanjit A. Seshia	On the Hardness of SAT with Community Structure.	SAT	2016	DBLP DOI BibTeX RDF
37	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
37	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
37	Jia Hui Liang, Vijay Ganesh, Pascal Poupart, Krzysztof Czarnecki 0001	Learning Rate Based Branching Heuristic for SAT Solvers.	SAT	2016	DBLP DOI BibTeX RDF
37	Paul Saikko, Jeremias Berg, Matti Järvisalo	LMHS: A SAT-IP Hybrid MaxSAT Solver.	SAT	2016	DBLP DOI BibTeX RDF
37	Neha Lodha, Sebastian Ordyniak, Stefan Szeider	A SAT Approach to Branchwidth.	SAT	2016	DBLP DOI BibTeX RDF
37	C. K. Cuong, M. J. H. Heule	Computing Maximum Unavoidable Subgraphs Using SAT Solvers.	SAT	2016	DBLP DOI BibTeX RDF
37	Jo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe, Marc Denecker	Improved Static Symmetry Breaking for SAT.	SAT	2016	DBLP DOI BibTeX RDF