Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
47 | Tobias Friedrich 0001, Ralf Rothenberger |
Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
47 | 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 |
|
47 | Stepan Kochemazov, Oleg Zaikin 0002 |
ALIAS: A Modular Tool for Finding Backdoors for SAT. |
SAT |
2018 |
DBLP DOI BibTeX RDF |
|
47 | Robert Ganian, Stefan Szeider |
Community Structure Inspired Algorithms for SAT and #SAT. |
SAT |
2015 |
DBLP DOI BibTeX RDF |
|
47 | Chanseok Oh |
Between SAT and UNSAT: The Fundamental Difference in CDCL SAT. |
SAT |
2015 |
DBLP DOI BibTeX RDF |
|
47 | Adrian Balint, Armin Biere, Andreas Fröhlich, Uwe Schöning |
Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses. |
SAT |
2014 |
DBLP DOI BibTeX RDF |
|
47 | Hadi Katebi, Karem A. Sakallah, João P. Marques Silva |
Empirical Study of the Anatomy of Modern Sat Solvers. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann |
Non-Model-Based Algorithm Portfolios for SAT. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Alexander Nadel |
Generating Diverse Solutions in SAT. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Justyna Petke, Peter Jeavons 0001 |
The Order Encoding: From Tractable CSP to Tractable SAT. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Oliver Gableske, Marijn Heule |
EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Ryan Williams 0001 |
Connecting SAT Algorithms and Complexity Lower Bounds. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Dave A. D. Tompkins, Adrian Balint, Holger H. Hoos |
Captain Jack: New Variable Selection Heuristics in Local Search for SAT. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Bryan Silverthorn, Risto Miikkulainen |
Learning Polarity from Structure in SAT. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Martin Mundhenk, Robert Zeranski |
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara |
A Compact and Efficient SAT-Encoding of Finite Domain CSP. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Ignasi Abío, Morgan Deters, Robert Nieuwenhuis, Peter J. Stuckey |
Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
47 | Vishwambhar Rathi, Erik Aurell, Lars K. Rasmussen, Mikael Skoglund |
Bounds on Threshold of Regular Random k-SAT. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Adrian Balint, Andreas Fröhlich |
Improving Stochastic Local Search for SAT with a New Probability Distribution. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Denis Pankratov, Allan Borodin |
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | William Matthews, Ramamohan Paturi |
Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Rüdiger Ehlers |
Minimising Deterministic Büchi Automata Precisely Using SAT Solving. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Stephan Kottler |
SAT Solving with Reference Points. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Yacine Boufkhad, Thomas Hugel |
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Robert Brummayer, Florian Lonsing, Armin Biere |
Automated Testing and Debugging of SAT and QBF Solvers. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Oliver Kullmann |
Green-Tao Numbers and SAT. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Dave A. D. Tompkins, Holger H. Hoos |
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Evgeny Dantsin, Alexander Wolpert |
On Moderately Exponential Time for SAT. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Mladen Nikolic |
Statistical Methodology for Comparison of SAT Solvers. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Carsten Fuhs, Peter Schneider-Kamp |
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Allen Van Gelder, Ivor T. A. Spence |
Zero-One Designs Produce Small Hard SAT Instances. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
47 | Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes |
Exploiting Cycle Structures in Max-SAT. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
47 | Daniel Johannsen, Igor Razgon, Magnus Wahlström |
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
47 | Dave A. D. Tompkins, Holger H. Hoos |
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT. |
SAT |
2004 |
DBLP BibTeX RDF |
|
47 | Fadi A. Aloul, Nagarajan Kandasamy |
Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
0-1 ILP, UAV networks, distributed systems, fault diagnosis, SAT |
46 | Chris Calabro, Ramamohan Paturi |
k-SAT Is No Harder Than Decision-Unique-k-SAT. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
unique satisfiability, independent set, quantified Boolean formulas, hitting set, k-SAT, exponential complexity |
46 | Adi Avidor, Uri Zwick |
Approximating MIN 2-SAT and MIN 3-SAT. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Armin Biere, Mathias Fleury, Nils Froleyks, Marijn J. H. Heule |
The SAT Museum. |
POS@SAT |
2023 |
DBLP BibTeX RDF |
|
46 | Vincent Vallade, Julien Sopena, Souheib Baarir |
Enhancing State-of-the-Art Parallel SAT Solvers Through Optimized Sharing Policies. |
POS@SAT |
2023 |
DBLP BibTeX RDF |
|
46 | Sebastiaan Brand, Tim Coopmans, Alfons Laarman |
Quantum Graph-State Synthesis with SAT. |
POS@SAT |
2023 |
DBLP BibTeX RDF |
|
46 | Yoichiro Iida, Tomohiro Sonobe, Mary Inaba |
An Empirical Study of the Effect of Learnt Clause on the Structural Measures of SAT problems. |
POS@SAT |
2023 |
DBLP BibTeX RDF |
|
46 | Thorsten Ehlers, Dirk Nowotka |
Tuning Parallel SAT Solvers. |
POS@SAT |
2018 |
DBLP DOI BibTeX RDF |
|
46 | Zack Newsham, Vijay Ganesh, Sebastian Fischmeister |
Predicting SAT Solver Performance on Heterogeneous Hardware. |
POS@SAT |
2018 |
DBLP DOI BibTeX RDF |
|
46 | Michal Karpinski, Marek Piotrów |
Competitive Sorter-based Encoding of PB-Constraints into SAT. |
POS@SAT |
2018 |
DBLP DOI BibTeX RDF |
|
46 | Markus Iser, Carsten Sinz |
A Problem Meta-Data Library for Research in SAT. |
POS@SAT |
2018 |
DBLP DOI BibTeX RDF |
|
46 | Bart Bogaerts 0001, Tomi Janhunen, Shahab Tasharrofi |
SAT-to-SAT in QBFEval 2016. |
QBF@SAT |
2016 |
DBLP BibTeX RDF |
|
46 | Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Cédric Piette |
Dolius: A Distributed Parallel SAT Solving Framework. |
POS@SAT |
2014 |
DBLP DOI BibTeX RDF |
|
46 | Laurent Simon |
Post Mortem Analysis of SAT Solver Proofs. |
POS@SAT |
2014 |
DBLP DOI BibTeX RDF |
|
46 | Zoltán Ádám Mann |
Typical-case complexity and the SAT competitions. |
POS@SAT |
2014 |
DBLP DOI BibTeX RDF |
|
46 | Armin Biere |
Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling. |
POS@SAT |
2014 |
DBLP DOI BibTeX RDF |
|
46 | Marijn Heule, Norbert Manthey, Tobias Philipp |
Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers. |
POS@SAT |
2014 |
DBLP DOI BibTeX RDF |
|
46 | Valentin Mayer-Eichberger, Toby Walsh |
SAT Encodings for the Car Sequencing Problem. |
POS@SAT |
2013 |
DBLP DOI BibTeX RDF |
|
46 | Martin Aigner 0003, Armin Biere, Christoph M. Kirsch, Aina Niemetz, Mathias Preiner |
Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures. |
POS@SAT |
2013 |
DBLP DOI BibTeX RDF |
|
46 | Norbert Manthey, Davide Lanti, Ahmed Irfan |
Modern Cooperative Parallel SAT Solving. |
POS@SAT |
2013 |
DBLP DOI BibTeX RDF |
|
46 | Youssef Hamadi |
From Parallel SAT to Distributed SAT. |
POS@SAT |
2010 |
DBLP DOI BibTeX RDF |
|
46 | Jinji Yang, Kaile Su, Qingliang Chen |
Improving Encoding Efficiency for Bounded Model Checking. |
TASE |
2008 |
DBLP DOI BibTeX RDF |
encoding, SAT, Bounded Model Checking |
46 | Ofer Strichman |
Accelerating Bounded Model Checking of Safety Properties. |
Formal Methods Syst. Des. |
2004 |
DBLP DOI BibTeX RDF |
SAT, Bounded Model Checking |
46 | Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais |
Automatic Extraction of Functional Dependencies. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
propositional reasoning and search, Boolean function, SAT |
45 | Daijue Tang, Sharad Malik |
Solving Quantified Boolean Formulas with Circuit Observability Don't Cares. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman |
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Daniele Pretolani |
Hypergraph Reductions and Satisfiability Problems. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
45 | Juan P. Galeotti, Nicolás Rosner, Carlos López Pombo, Marcelo F. Frias |
Analysis of invariants for efficient bounded verification. |
ISSTA |
2010 |
DBLP DOI BibTeX RDF |
dynalloy, kodkod, sat-based code analysis, static analysis, alloy |
44 | Huzefa Rangwala, Christopher Kauffman, George Karypis |
A Kernel Framework for Protein Residue Annotation. |
PAKDD |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Richard Chang 0001, Suresh Purini |
Bounded Queries and the NP Machine Hypothesis. |
CCC |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Miguel F. Anjos |
An improved semidefinite programming relaxation for the satisfiability problem. |
Math. Program. |
2005 |
DBLP DOI BibTeX RDF |
Satisfiability, Semidefinite programming, Discrete optimization |
44 | Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva 0001 |
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability. |
J. Autom. Reason. |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Zhaohui Fu, Yinlei Yu, Sharad Malik |
Considering Circuit Observability Don't Cares in CNF Satisfiability. |
DATE |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Zhao Xing, Weixiong Zhang |
Efficient Strategies for (Weighted) Maximum Satisfiability. |
CP |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah |
Solving difficult instances of Boolean satisfiability in the presence of symmetry. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Lars Engebretsen, Venkatesan Guruswami |
Is Constraint Satisfaction Over Two Variables Always Easy? |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Amol Dattatraya Mali |
On Temporal Planning as CSP. |
ICTAI |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Inês Lynce, Luís Baptista, João Marques-Silva 0001 |
Towards Provably Complete Stochastic Search Algorithms for Satisfiability. |
EPIA |
2001 |
DBLP DOI BibTeX RDF |
|
44 | Richard Chang 0001, Jon S. Squire |
Bounded Query Functions with Limited Output Bits. |
CCC |
2001 |
DBLP DOI BibTeX RDF |
|
44 | HoonSang Jin, Fabio Somenzi |
CirCUs: A Hybrid Satisfiability Solver. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Jinbo Huang, Adnan Darwiche |
Using DPLL for Efficient OBDD Construction. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Dalila Boughaci, Habiba Drias |
Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic. |
SAC |
2004 |
DBLP DOI BibTeX RDF |
Max-W-Sat, Solution combination method, SAT, Scatter search, Hybrid metaheuristic, Taboo Search |
43 | Yannis Argyropoulos, Kostas Stergiou 0001 |
A Study of SAT-Based Branching Heuristics for the CSP. |
SETN |
2008 |
DBLP DOI BibTeX RDF |
Branching Heuristics, CSP, SAT |
43 | Suchismita Roy, P. P. Chakrabarti 0001, Pallab Dasgupta |
Event propagation for accurate circuit delay calculation using SAT. |
ACM Trans. Design Autom. Electr. Syst. |
2007 |
DBLP DOI BibTeX RDF |
Critical delay, event propagation, SAT |
43 | Shougo Ogata, Tatsuhiro Tsuchiya, Tohru Kikuno |
SAT-Based Verification of Safe Petri Nets. |
ATVA |
2004 |
DBLP DOI BibTeX RDF |
Petri nets, SAT, Bounded model checking |
43 | Éric Grégoire, Bertrand Mazure, Lakhdar Sais |
Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently. |
AIMSA |
2002 |
DBLP DOI BibTeX RDF |
logic and AI, local search, SAT, minimal models |
43 | Albert Atserias, Johannes Klaus Fichte, Marc Thurley |
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Vasco M. Manquinho, João Marques-Silva 0001, Jordi Planes |
Algorithms for Weighted Boolean Optimization. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Niklas Sörensson, Armin Biere |
Minimizing Learned Clauses. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol |
(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Eric I. Hsu, Sheila A. McIlraith |
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
Survey Propagation/EMBP, Variable/Value Ordering Heuristics, Probabilistic Inference |
43 | Allen Van Gelder |
Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol |
New Results on the Phase Transition for Random Quantified Boolean Formulas. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
43 | Nachum Dershowitz, Ziyad Hanna, Alexander Nadel |
Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Oliver Kullmann |
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Stefan Porschen, Ewald Speckenmeyer |
Algorithms for Variable-Weighted 2-SAT and Dual Problems. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
weighted satisfiability, edge cover, graph factor, NP-hardness, optimization problem, perfect matching |
43 | Teresa Alsinet, Felip Manyà, Jordi Planes |
Improved Exact Solvers for Weighted Max-SAT. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Michal Kouril, John V. Franco |
Resolution Tunnels for Improved SAT Solver Performance. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Evgeny Dantsin, Alexander Wolpert |
An Improved Upper Bound for SAT. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Andreas Meier 0002, Volker Sorge |
A New Set of Algebraic Benchmark Problems for SAT Solvers. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Alexander S. Kulikov |
Automated Generation of Simplification Rules for SAT and MAXSAT. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Daniel Rolf |
Derandomization of PPSZ for Unique- k-SAT. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Marijn Heule, Hans van Maaren |
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Alessandro Armando, Luca Compagna |
Abstraction-Driven SAT-based Analysis of Security Protocols. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Hubie Chen |
An Algorithm for SAT Above the Threshold. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Steven D. Prestwich |
Local Search on SAT-encoded Colouring Problems. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|