Justification-Based Non-Clausal Local Search for SAT
暂无分享,去创建一个
[1] Toby Walsh,et al. Solving Non-clausal Formulas with DPLL search , 2004, SAT.
[2] Bart Selman,et al. The state of SAT , 2007, Discret. Appl. Math..
[3] Keijo Heljanko,et al. Bounded Reachability Checking with Process Semantics , 2001, CONCUR.
[4] Edward A. Hirsch,et al. UnitWalk: A new SAT solver that uses local search guided by unit clause elimination , 2005, Annals of Mathematics and Artificial Intelligence.
[5] Henry Kautz,et al. Exploiting Variable Dependency in Local Search , 1997, IJCAI 1997.
[6] Ilkka Niemelä,et al. Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking , 2000, Computational Logic.
[7] Bart Selman,et al. Evidence for Invariants in Local Search , 1997, AAAI/IAAI.
[8] Holger H. Hoos,et al. An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.
[9] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[10] Rolf Drechsler,et al. Managing don't cares in Boolean satisfiability , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.
[11] Abdul Sattar,et al. Building Structure into Local Search for SAT , 2007, IJCAI.
[12] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[13] Roberto Sebastiani,et al. Applying GSAT to Non-Clausal Formulas , 1993, J. Artif. Intell. Res..
[14] Malay K. Ganai,et al. Circuit-based Boolean reasoning , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[15] Malay K. Ganai,et al. Robust Boolean reasoning for equivalence checking and functional property verification , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..