When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way
暂无分享,去创建一个
[1] Madan Musuvathi,et al. A Combination Method for Generating Interpolants , 2005, CADE.
[2] Toby Walsh,et al. Handbook of satisfiability , 2009 .
[3] Jingchao Chen. Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques , 2009, SAT.
[4] O. H. Brownlee,et al. ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .
[5] Kenneth L. McMillan,et al. An interpolating theorem prover , 2005, Theor. Comput. Sci..
[6] Petteri Kaski,et al. Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques , 2006, J. Satisf. Boolean Model. Comput..
[7] Jie-Hong Roland Jiang,et al. To SAT or Not to SAT: Scalable Exploration of Functional Dependency , 2010, IEEE Transactions on Computers.
[8] Claude Castelluccia,et al. Extending SAT Solvers to Cryptographic Problems , 2009, SAT.
[9] Cesare Tinelli,et al. Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.
[10] Fabio Massacci,et al. Logical Cryptanalysis as a SAT Problem ? Encoding and Analysis of the U.S. Data Encryption Standard , 2000 .
[11] R. Brayton,et al. Improvements to Combinational Equivalence Checking , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.
[12] William Craig,et al. Linear reasoning. A new form of the Herbrand-Gentzen theorem , 1957, Journal of Symbolic Logic.
[13] J. P. Marques,et al. GRASP : A Search Algorithm for Propositional Satisfiability , 1999 .
[14] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[15] Alberto Griggio,et al. Efficient generation of craig interpolants in satisfiability modulo theories , 2009, TOCL.
[16] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[17] Mate Soos,et al. Enhanced Gaussian Elimination in DPLL-based SAT Solvers , 2010, POS@SAT.
[18] Chu Min Li,et al. Integrating Equivalency Reasoning into Davis-Putnam Procedure , 2000, AAAI/IAAI.
[19] Jing-Chao Chen. XORSAT: An Efficient Algorithm for the DIMACS 32-bit Parity Problem , 2007, ArXiv.
[20] Oliver Kullmann,et al. Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings , 2009, SAT.
[21] Fabio Massacci,et al. Logical Cryptanalysis as a SAT Problem , 2000, Journal of Automated Reasoning.
[22] Bart Selman,et al. Model Counting: A New Strategy for Obtaining Good Bounds , 2006, AAAI.
[23] Ilkka Niemelä,et al. Equivalence Class Based Parity Reasoning with DPLL(XOR) , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.
[24] Jie-Hong Roland Jiang,et al. Towards completely automatic decoder synthesis , 2011, 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).
[25] Peter Baumgartner,et al. The Taming of the (X)OR , 2000, Computational Logic.
[26] Kenneth L. McMillan,et al. Interpolation and SAT-Based Model Checking , 2003, CAV.
[27] Ilkka Niemelä,et al. Extending Clause Learning DPLL with Parity Reasoning , 2010, ECAI.
[28] Graham Steel,et al. Deduction with XOR Constraints in Security API Modelling , 2005, CADE.
[29] Hans van Maaren,et al. A two phase algorithm for solving a class of hard satissfiability problems , 1998 .