The Quest for Efficient Boolean Satisfiability Solvers (Презентации лекций), страница 7
Описание файла
Файл "The Quest for Efficient Boolean Satisfiability Solvers" внутри архива находится в следующих папках: Презентации лекций, Статьи к лекциям. PDF-файл из архива "Презентации лекций", который расположен в категории "". Всё это находится в предмете "boolean sat-smt solvers for software engineering" из 11 семестр (3 семестр магистратуры), которые можно найти в файловом архиве МГУ им. Ломоносова. Не смотря на прямую связь этого архива с МГУ им. Ломоносова, его также можно найти и в других разделах. .
Просмотр PDF-файла онлайн
Текст 7 страницы из PDF
N. Hooker and V. Vinay, "Branching rules for satisfiability," Journal of AutomatedReasoning, vol. 15, pp. 359-383, 1995.[28] M. Buro and H. Kleine-Buning, "Report on a SAT competition," Technical Report,University of Paderborn 1992.[29] R. G. Jeroslow and J. Wang, "Solving propositional satisfiability problems," Annals ofMathematics and Artificial Intelligence, vol. 1, pp.
167-187, 1990.[30] H. Zhang and M. Stickel, "An efficient algorithm for unit-propagation," presented atInternational Symposium on Artificial Intelligence and Mathematics, Ft. Lauderdale,Florida, 1996.[31] I. Lynce and J. P. Marques-Silva, "Efficient data structures for backtrack search SATsolvers," presented at Fifth International Symposium on the Theory and Applications ofSatisfiability Testing, 2002.[32] C. M. Li, "Integrating equivalency reasoning into Davis-Putnam Procedure," presented atNational Conference on Artificial Intelligence (AAAI), 2000.[33] I.
Lynce and J. P. Marques-Silva, "Integrating Simplification Techniques in SATAlgorithms," presented at Logic in Computer Science Short Paper Session (LICS-SP), 2001.[34] A. V. Gelder and Y. K. Tsuji, "Satisfiability Testing with more Reasoning and Lessguessing," in Cliques, Coloring and Satisfiability: Second DIMACS ImplementationChallenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, D.S.
Johnson and M. Trick, Eds.: American Mathematical Society, 1993.[35] S. T. Chakradhar and V. D. Agrawal, "A Transitive Closure Based Algorithm for TestGeneration," presented at Design Automation Conference (DAC), 1991.[36] W. Kunz and D. K. Pradhan, "Recursive Learning: A New Implication Technique forEfficient Solutions to CAD-problems: Test, Verification and Optimization," IEEETransactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 13, pp.1143-1158, 1994.[37] J. P. Marques-Silva, "Improving Satisfiability Algorithms by Using Recursive Learning,"presented at International Workshop on Boolean Problems (IWBP), 1998.[38] P.
Prosser, "Hybrid algorithms for the constraint satisfaction problem," ComputationalIntelligence, vol. 9, pp. 268-299, 1993.[39] L. Zhang, C. Madigan, M. Moskewicz, and S. Malik, "Efficient Conflict Driven Learningin a Boolean Satisfiability Solver," presented at International Conference on ComputerAided Design (ICCAD), San Jose, CA, 2001.[40] G. Hachtel and F. Somenzi, Logic Sysntheiss and Verification Algorithms: KluwerAcademic Publishers, 1996.[41] H. Zhang and M.
Stickel, "Implementing Davis-Putnam's method," Technical Report,University of Iowa 1994.[42] P. Chatalic and L. Simon, "Multi-Resolution on Compressed Sets of Clauses," presented atInternational Conference on Tools with Artificial Intelligence, 2000.[43] F. Aloul, M. Mneimneh, and K. Sakallah, "Backtrack Search Using ZBDDs," presented atInternational Workshop on Logic Synthesis (IWLS), 2001.[44] S. I. Minato, "Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems,"presented at 30th Design Automation Conference (DAC), 1993.[45] I. Lynce and J. P. Marques-Silva, "The Puzzling Role of Simplification in PropositionalSatisfiability," presented at EPIA'01 Workshop on Constraint Satisfaction and OperationalResearch Techniques for Problem Solving (EPIA-CSOR), 2001.[46] C.
P. Gomes, B. Selman, and H. Kautz, "Boosting Combinatorial Search ThroughRandomization," presented at National Conference on Artificial Intelligence (AAAI),Madison, WI, 1998.[47] B. A. Huberman, R. M. Lukose, and T. Hogg, "An Economics approach to hardcomputational problems," Science, vol. 275, pp. 51-54, 1997.[48] I.
Lynce and J. P. Marques-Silva, "Complete unrestricted backtracking algorithms forSatisfiability," presented at Fifth International Symposium on the Theory and Applicationsof Satisfiability Testing, 2002.[49] C. P. Gomes, B. Selman, N. Crator, and H. Kautz, "Heavy-tailed phenomena insatisfiability and constraint satisfaction problems," Journal of Automated Reasoning, vol.24(1/2), pp. 67-100, 1999.[50] "Prover Proof Engine," Prover Technology.[51] J. F. Groote and J.
P. Warners, "The propositional formula checker HeerHugo," Journal ofAutomated Reasoning, vol. 24, 2000.[52] Y. Shang and B. W. Wah, "A Discrete Lagrangian-Based Global-Search Method forSolving Satisfiability Problems," Journal of Global Optimization, vol.
12, pp. 61-99, 1998.[53] I. Gent and T. Walsh, "The SAT Phase Transition," presented at European Conference onArtificial Intelligence (ECAI-94), 1994.[54] M. Prasad, P. Chong, and K. Keutzer, "Why is ATPG easy?," presented at DesignAutomation Conference (DAC99), 1999.[55] F. Brglez, X.
Li, and M. Stallmann, "The role of a skeptic agent in testing andbenchmarking of SAT algorithms," presented at Fifth International Symposium ontheTheory and Applications of Satisfiability Testing, 2002.[56] O. Strichman, "Pruning techniques for the SAT-based Bounded Model CheckingProblem," presented at 11th Advanced Research Working Conference on Correct HardwareDesign and Verification Methods (CHARM'01), 2001.[57] M. Ganai, L. Zhang, P. Ashar, A. Gupta, and S. Malik, "Combining Strengths of Circuitbased and CNF-based Algorithms for a High-Performance SAT Solver," presented atDesign Automation Conference (DAC'02), 2002..