Proofs for Satisfiability Problems

[1]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[2]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[4]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[5]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[6]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[7]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[8]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[9]  Andreas Goerdt.  Comparing the Complexity of Regular and Unrestricted Resolution , 1990, GWAI.

[10]  Oliver Kullmann,et al.  On a Generalization of Extended Resolution , 1999, Discret. Appl. Math..

[11]  Wolfgang Küchlin,et al.  Formal methods for the validation of automotive product configuration data , 2003, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[12]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[13]  Eugene Goldberg,et al.  Verification of proofs of unsatisfiability for CNF formulas , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[14]  Sharad Malik,et al.  Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[15]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[16]  Fahiem Bacchus,et al.  Effective Preprocessing with Hyper-Resolution and Equality Reduction , 2003, SAT.

[17]  Henry A. Kautz,et al.  Towards Understanding and Harnessing the Potential of Clause Learning , 2004, J. Artif. Intell. Res..

[18]  Randy Moore,et al.  Thanks … , 2019, Witcraft.

[19]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[20]  Igor L. Markov,et al.  Efficient symmetry breaking for Boolean satisfiability , 2003, IEEE Transactions on Computers.

[21]  Karem A. Sakallah,et al.  Refinement strategies for verification methods based on datapath abstraction , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[22]  Tjark Weber.  Efficiently Checking Propositional Resolution Proofs in Isabelle / HOL , 2006 .

[23]  Armin Biere,et al.  Extended Resolution Proofs for Conjoining BDDs , 2006, CSR.

[24]  Carsten Sinz.  Compressing Propositional Proofs by Common Subproof Extraction , 2007, EUROCAST.

[25]  Hasan Amjad.  Compressing Propositional Refutations , 2007, Electron. Notes Theor. Comput. Sci..

[26]  Ofer Strichman,et al.  Linear-Time Reductions of Resolution Proofs , 2008, Haifa Verification Conference.

[27]  Armin Biere,et al.  PicoSAT Essentials , 2008, J. Satisf. Boolean Model. Comput..

[28]  Albert Oliveras,et al.  Efficient Generation of Unsatisfiability Proofs and Cores in SAT , 2008, LPAR.

[29]  Allen Van Gelder,et al.  Verifying RUP Proofs of Propositional Unsatisfiability , 2008, ISAIM.

[30]  Fabio Somenzi,et al.  On-the-Fly Clause Improvement , 2009, SAT.

[31]  Allen Van Gelder.  Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces , 2009, SAT.

[32]  Armin Biere,et al.  Fuzzing and delta-debugging SMT solvers , 2009, SMT '09.

[33]  Hasan Amjad,et al.  Efficiently checking propositional refutations in HOL theorem provers , 2009, J. Appl. Log..

[34]  Armin Biere,et al.  Effective Bit-Width and Under-Approximation , 2009, EUROCAST.

[35]  Cesare Tinelli,et al.  Handbook of Satisfiability , 2021, Handbook of Satisfiability.

[36]  Armin Biere,et al.  Minimizing Learned Clauses , 2009, SAT.

[37]  Armin Biere,et al.  Automated Testing and Debugging of SAT and QBF Solvers , 2010, SAT.

[38]  Scott Cotton.  Two Techniques for Minimizing Resolution Proofs , 2010, SAT.

[39]  Alexander Nadel.  Boosting minimal unsatisfiable core extraction , 2010, Formal Methods in Computer Aided Design.

[40]  Alan Mishchenko,et al.  A single-instance incremental SAT formulation of proof- and counterexample-based abstraction , 2010, Formal Methods in Computer Aided Design.

[41]  Stephan Merz,et al.  Compression of Propositional Resolution Proofs via Partial Regularization , 2011, CADE.

[42]  Aaron R. Bradley,et al.  SAT-Based Model Checking without Unrolling , 2011, VMCAI.

[43]  Armin Biere,et al.  Simulating Circuit-Level Simplifications on CNF , 2011, Journal of Automated Reasoning.

[44]  Laurent Théry,et al.  Verifying SAT and SMT in Coq for a fully automated decision procedure , 2011 .

[45]  Armin Biere,et al.  Automated Reencoding of Boolean Formulas , 2012, Haifa Verification Conference.

[46]  Armin Biere,et al.  Inprocessing Rules , 2012, IJCAR.

[47]  Armin Biere,et al.  Managing SAT inconsistencies with HUMUS , 2012, VaMoS '12.

[48]  Allen Van Gelder.  Producing and verifying extremely large propositional refutations Have your cake and eat it too , 2012 .

[49]  Ofer Strichman,et al.  Efficient MUS extraction with resolution , 2013, 2013 Formal Methods in Computer-Aided Design.

[50]  Marijn J. H. Heule,et al.  Trimming while checking clausal proofs , 2013, 2013 Formal Methods in Computer-Aided Design.

[51]  Yakir Vizel,et al.  Efficient Generation of Small Interpolants in CNF , 2013, CAV.

[52]  Joao Marques-Silva,et al.  Iterative and core-guided MaxSAT solving: A survey and assessment , 2013, Constraints.

[53]  Marijn Heule,et al.  Mechanical Verification of SAT Refutations with Extended Resolution , 2013, ITP.

[54]  Marijn J. H. Heule,et al.  Proceedings of SAT Competition 2013 , 2013 .

[55]  Armin Biere,et al.  Model-Based Testing for Verification Back-Ends , 2013, TAP@STAF.

[56]  Armin Biere,et al.  Factoring Out Assumptions to Speed Up MUS Extraction , 2013, SAT.

[57]  Armin Biere.  Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013 , 2013 .

[58]  Marijn J. H. Heule,et al.  Verifying Refutations with Extended Resolution , 2013, CADE.

[59]  Arie Gurfinkel,et al.  DRUPing for Interpolants , 2014 .

[60]  Marijn J. H. Heule,et al.  DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs , 2014, SAT.

[61]  Armin Biere.  Yet another Local Search Solver and Lingeling and Friends Entering the SAT Competition 2014 , 2014 .

[62]  Roberto Bruttomesso,et al.  Resolution proof transformation for compression and interpolation , 2014, Formal Methods Syst. Des..

[63]  Joao Marques-Silva,et al.  MUS Extraction Using Clausal Proofs , 2014, SAT.

[64]  Alexei Lisitsa,et al.  A SAT Attack on the Erdős Discrepancy Conjecture , 2014, SAT.

[65]  Joseph Boudou,et al.  Skeptik: A Proof Compression System , 2014, IJCAR.