Диссертация (1090534), страница 22
Текст из файла (страница 22)
— 2004. — Vol. 87, no. 12. — Pp. 3293–3300.51. Ryzhenko N., Burns S. Standard cell routing via boolean satisfiability // Proceedings of the 49th Annual Design Automation Conference / ACM. — 2012. —Pp. 603–612.52. Минимизация числа нежелательных топологий при проектированиистандартных ячеек / Рыженко Н.В., Сорокин А.А., Быков С.А.,Талалай М.С. // Проблемы разработки перспективных микро- инаноэлектронных систем - 2014.
Сборник трудов. — 2014. — № 1.— С. 121–136.53. Н.В. Рыженко, А.А. Сорокин, С.А. Быков. Синтез блоков памяти сиспользованием представления правил в виде булевых функций оттопологических объектов // Проблемы разработки перспективных микрои наноэлектронных систем - 2014. Сборник трудов. — 2014. — № 1.
—С. 127–132.54. A boolean rule-based approach for manufacturability-aware cell routing /Jordi Cortadella, Jonathan Petit, Sergio Gomez, Francesc Moll // Computer-AidedDesign of Integrated Circuits and Systems, IEEE Transactions on. — 2014. —Vol. 33, no. 3. — Pp. 409–422.55. Mukherjee Shyamapada, Roy Suchismita. Nearly-2-SAT Solutions forSegmented-Channel Routing // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. — 2016.
— Vol. 35, no. 1. —Pp. 128–140.11356. Boolean Satisfiability-Based Routing and Its Application to Xilinx UltraScaleClock Network / Henri Fraisse, Abhishek Joshi, Dinesh Gaitonde, Alireza Kaviani // Proceedings of the 2016 ACM/SIGDA International Symposium on FieldProgrammable Gate Arrays. — FPGA ’16. — New York, NY, USA: ACM, 2016.— Pp. 74–79. — URL: http://doi.acm.org/10.1145/2847263.2847342.57. Design and manufacturability tradeoffs in unidirectional and bidirectional standard cell layouts in 14 nm node / Kaushik Vaidyanathan, Siew Hoon Ng,Daniel Morris et al.
// SPIE Advanced Lithography / International Society forOptics and Photonics. — 2012. — Pp. 83270K–83270K.58. Du Yuelin, Wong Martin DF. Optimization of standard cell based detailed placement for 16 nm FinFET process // Proceedings of the conference on Design, Automation & Test in Europe / European Design and Automation Association. —2014. — P. 357.59. Tseitin G.
S. On the complexity of derivation in propositional calculus // Automation of reasoning. — Springer, 1983. — Pp. 466–483.60. Cook Stephen A. The complexity of theorem-proving procedures // Proceedingsof the third annual ACM symposium on Theory of computing / ACM. — 1971.— Pp. 151–158.61. Cortadella Jordi. Area-optimal transistor folding for 1-D gridded cell design //IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. — 2013.
— Vol. 32, no. 11. — Pp. 1708–1721.62. Davis Martin, Putnam Hilary. A computing procedure for quantification theory //Journal of the ACM (JACM). — 1960. — Vol. 7, no. 3. — Pp. 201–215.63. Davis Martin, Logemann George, Loveland Donald. A machine program fortheorem-proving // Communications of the ACM. — 1962. — Vol. 5, no. 7.— Pp. 394–397.64. Lynce Inês, Marques-Silva João. Efficient haplotype inference with Boolean satisfiability // Proceedings of the National Conference on Artificial Intelligence /Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999. —Vol. 21. — 2006.
— P. 104.11465. Plaisted D. A., Greenbaum S. A structure-preserving clause form translation //Journal of Symbolic Computation. — 1986. — Vol. 2, no. 3. — Pp. 293–304.66. de la Tour Thierry Boy. An optimality result for clause form translation // Journalof Symbolic Computation. — 1992. — Vol. 14, no. 4. — Pp. 283–301.67. Manolios Panagiotis, Vroon Daron. Efficient circuit to CNF conversion // International Conference on Theory and Applications of Satisfiability Testing / Springer.— 2007. — Pp. 4–9.68. Jackson Paul, Sheridan Daniel. Clause form conversions for boolean circuits //International Conference on Theory and Applications of Satisfiability Testing /Springer.
— 2004. — Pp. 183–198.69. Een Niklas, Mishchenko Alan, Sörensson Niklas. Applying logic synthesis forspeeding up SAT // International Conference on Theory and Applications of Satisfiability Testing / Springer. — 2007. — Pp. 272–286.70. Gelfond Michael, Lifschitz Vladimir. The stable model semantics for logic programming. // ICLP/SLP. — Vol. 88. — 1988. — Pp. 1070–1080.71.
Van Gelder Allen, Ross Kenneth A, Schlipf John S. The well-founded semanticsfor general logic programs // Journal of the ACM (JACM). — 1991. — Vol. 38,no. 3. — Pp. 619–649.72. Answer Set Programming for Logical Analysis of Data / Katinka Becker, Martin Gebser, Torsten Schaub, Alexander Bockmayr // Workshop on ConstraintBased Methods for Bioinformatics (WCB’16). — 2016. — P. 15.73. Exploiting the enumeration of all feature model configurations: a new perspectivewith distributed computing / José A Galindo, Mathieu Acher, Juan Manuel Tiradoet al.
// Proceedings of the 20th International Systems and Software Product LineConference / ACM. — 2016. — Pp. 74–78.74. Domain-Specific Heuristics in Answer Set Programming. / Martin Gebser, Benjamin Kaufmann, Javier Romero et al. // AAAI / Citeseer. — 2013.75. All-SAT using minimal blocking clauses / Y. Yu, P. Subramanyan, N.
Tsiskaridze,S. Malik // VLSI Design and 2014 13th International Conference on EmbeddedSystems, 2014 27th International Conference on / IEEE. — 2014. — Pp. 86–91.11576. Grumberg Orna, Schuster Assaf, Yadgar Avi. Memory efficient all-solutions SATsolver and its application for reachability analysis // International Conference onFormal Methods in Computer-Aided Design / Springer. — 2004. — Pp.
275–289.77. A Uniform Algorithm of Solving All-SAT Using Membrane Systems /Yueguo Luo, Zhongyang Xiong, Haijun Tan, Shuyin Xia // Journal of Computational and Theoretical Nanoscience. — 2015. — Vol. 12, no. 12. — Pp. 5825–5832.78. Song Bosheng, Song Tao, Pan Linqiang. Time-free solution to SAT problem by Psystems with active membranes and standard cell division rules // Natural Computing. — 2015. — Vol. 14, no.
4. — Pp. 673–681.79. Toda Takahisa, Tsuda Koji. BDD construction for all solutions SAT and efficientcaching mechanism // Proceedings of the 30th Annual ACM Symposium on Applied Computing / ACM. — 2015. — Pp. 1880–1886.80. Progressive generation of canonical sum of products using a SAT solver /Ana Petkovska, Alan Mishchenko, David Novo et al. // Proceedings of the 25thInternational Workshop on Logic and Synthesis, Austin, Tex. — 2016.81. Klebanov Vladimir, Manthey Norbert, Muise Christian.
SAT-based analysis andquantification of information flow in programs // International Conference onQuantitative Evaluation of Systems / Springer. — 2013. — Pp. 177–192.82. Klebanov Vladimir, Weigl Alexander, Weisbarth Jörg. Sound Probabilistic# SATwith Projection.83. Thurley Marc. sharpSAT–counting models with advanced component caching andimplicit BCP // International Conference on Theory and Applications of Satisfiability Testing / Springer. — 2006. — Pp. 424–429.84. Bayardo Jr Roberto J, Pehoushek Joseph Daniel. Counting models using connected components // AAAI/IAAI. — 2000.
— Pp. 157–162.85. Combining Component Caching and Clause Learning for Effective Model Counting. / Tian Sang, Fahiem Bacchus, Paul Beame et al. // SAT. — 2004. — Vol. 4.— P. 7th.11686. Sang Tian, Beame Paul, Kautz Henry. Heuristics for fast exact model counting //International Conference on Theory and Applications of Satisfiability Testing /Springer. — 2005. — Pp. 226–240.87. Östergård Patric RJ. A fast algorithm for the maximum clique problem // DiscreteApplied Mathematics. — 2002.
— Vol. 120, no. 1. — Pp. 197–207.88. Tomita Etsuji, Kameda Toshikatsu. An efficient branch-and-bound algorithm forfinding a maximum clique with computational experiments // Journal of Globaloptimization. — 2007. — Vol. 37, no. 1. — Pp. 95–111.89. Bron Coen, Kerbosch Joep. Algorithm 457: finding all cliques of an undirectedgraph // Communications of the ACM. — 1973. — Vol. 16, no. 9. — Pp. 575–577.90. A new algorithm for generating all the maximal independent sets /Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi, Isao Shirakawa // SIAMJournal on Computing. — 1977.
— Vol. 6, no. 3. — Pp. 505–517.91. Visualizing plant metabolomic correlation networks using clique–metabolite matrices / Frank Kose, Wolfram Weckwerth, Thomas Linke, Oliver Fiehn // Bioinformatics. — 2001. — Vol. 17, no. 12. — Pp. 1198–1208.92. A parallel algorithm for enumerating all maximal cliques in complex network /Nan Du, Bin Wu, Liutong Xu et al. // Sixth IEEE International Conference onData Mining-Workshops (ICDMW’06) / IEEE. — 2006. — Pp.
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
