FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1486389616> ?p ?o ?g. }

• W1486389616 abstract "Recent years have seen a dramatic growth in the application of SAT solvers to problems in electronic design automation. This trend is due in part to recent developments in SAT algorithms which have revolutionized the field of satisfiability testing. SAT has grown from a problem of academic interest to a core computational resource of immense value. However, despite the significant progress in this domain there is considerable room for improvement in several areas. The goal of this dissertation is to advance the theory, practice and core technology of SAT algorithms in the context of EDA applications. The success of a SAT algorithm in a given EDA application may be ensured by a realistic quantitative assessment of the projected performance of the overall algorithm in a practical setting, by carefully orchestrating the use of SAT in the application and by improving the SAT algorithm per se. This dissertation addresses these three issues. The first part of the dissertation presents a framework for analyzing the complexity of a SAT based formulation of the combinational ATPG problem, in a practical setting. We introduce the concept of cut-width of a circuit and characterize the complexity of ATPG in terms of this property. We present theoretical results and empirical evidence to argue that a large class of practical circuits can be expected to have cut-width characteristics conducive to an efficient solution of ATPG on them. These results also help to reconcile the intractability of ATPG, as predicted by traditional worst case analysis results, with the relative ease of solving practical instances of the problem. The second part of the dissertation focuses on the optimum orchestration of SAT methods for a given EDA application. We revisit the application of SAT algorithms to the combinational equivalence checking (CEC) problem. We argue that SAT is a more robust and flexible engine of Boolean reasoning for the CEC application than binary decision diagrams (BDDs), which have traditionally been the method of choice. Preliminary results on a simple framework for SAT-based CEC show a speedup of up to two orders of magnitude over previous methods for SAT-based CEC. Further, the prototype implementation is only moderately slower and sometimes faster than a state-of-the-art BDD-based mixed-engine commercial CEC tool. The third and final part of the dissertation is aimed at enhancing the core techniques used in current SAT solvers. We introduce the notion of problem symmetry in search based SAT algorithms. We develop a theory of essential points to formally characterize the potential search space pruning that can be realized by exploiting problem symmetry. We unify several powerful search pruning techniques used in modern SAT solvers under a single framework, by showing them to be special cases of the theory of essential points. We also propose a new pruning rule exploiting problem symmetry. Preliminary experimental results validate the efficacy of this rule in providing additional search space pruning over the pruning realized by techniques implemented in leading-edge SAT solvers." @default.
• W1486389616 created "2016-06-24" @default.
• W1486389616 creator A5060172723 @default.
• W1486389616 creator A5064568178 @default.
• W1486389616 date "2001-01-01" @default.
• W1486389616 modified "2023-09-28" @default.
• W1486389616 title "Propositional satisfiability algorithms in eda applications" @default.
• W1486389616 hasPublicationYear "2001" @default.
• W1486389616 type Work @default.
• W1486389616 sameAs 1486389616 @default.
• W1486389616 citedByCount "7" @default.
• W1486389616 crossrefType "journal-article" @default.
• W1486389616 hasAuthorship W1486389616A5060172723 @default.
• W1486389616 hasAuthorship W1486389616A5064568178 @default.
• W1486389616 hasConcept C11413529 @default.
• W1486389616 hasConcept C115901376 @default.
• W1486389616 hasConcept C119599485 @default.
• W1486389616 hasConcept C127413603 @default.
• W1486389616 hasConcept C134146338 @default.
• W1486389616 hasConcept C134306372 @default.
• W1486389616 hasConcept C149635348 @default.
• W1486389616 hasConcept C151730666 @default.
• W1486389616 hasConcept C152062344 @default.
• W1486389616 hasConcept C154945302 @default.
• W1486389616 hasConcept C168773769 @default.
• W1486389616 hasConcept C17626397 @default.
• W1486389616 hasConcept C2777212361 @default.
• W1486389616 hasConcept C2779343474 @default.
• W1486389616 hasConcept C33923547 @default.
• W1486389616 hasConcept C36503486 @default.
• W1486389616 hasConcept C41008148 @default.
• W1486389616 hasConcept C64260653 @default.
• W1486389616 hasConcept C6943359 @default.
• W1486389616 hasConcept C78519656 @default.
• W1486389616 hasConcept C80444323 @default.
• W1486389616 hasConcept C86803240 @default.
• W1486389616 hasConceptScore W1486389616C11413529 @default.
• W1486389616 hasConceptScore W1486389616C115901376 @default.
• W1486389616 hasConceptScore W1486389616C119599485 @default.
• W1486389616 hasConceptScore W1486389616C127413603 @default.
• W1486389616 hasConceptScore W1486389616C134146338 @default.
• W1486389616 hasConceptScore W1486389616C134306372 @default.
• W1486389616 hasConceptScore W1486389616C149635348 @default.
• W1486389616 hasConceptScore W1486389616C151730666 @default.
• W1486389616 hasConceptScore W1486389616C152062344 @default.
• W1486389616 hasConceptScore W1486389616C154945302 @default.
• W1486389616 hasConceptScore W1486389616C168773769 @default.
• W1486389616 hasConceptScore W1486389616C17626397 @default.
• W1486389616 hasConceptScore W1486389616C2777212361 @default.
• W1486389616 hasConceptScore W1486389616C2779343474 @default.
• W1486389616 hasConceptScore W1486389616C33923547 @default.
• W1486389616 hasConceptScore W1486389616C36503486 @default.
• W1486389616 hasConceptScore W1486389616C41008148 @default.
• W1486389616 hasConceptScore W1486389616C64260653 @default.
• W1486389616 hasConceptScore W1486389616C6943359 @default.
• W1486389616 hasConceptScore W1486389616C78519656 @default.
• W1486389616 hasConceptScore W1486389616C80444323 @default.
• W1486389616 hasConceptScore W1486389616C86803240 @default.
• W1486389616 hasLocation W14863896161 @default.
• W1486389616 hasOpenAccess W1486389616 @default.
• W1486389616 hasPrimaryLocation W14863896161 @default.
• W1486389616 hasRelatedWork W1481014671 @default.
• W1486389616 hasRelatedWork W1483012440 @default.
• W1486389616 hasRelatedWork W1556434751 @default.
• W1486389616 hasRelatedWork W2008606297 @default.
• W1486389616 hasRelatedWork W2044560939 @default.
• W1486389616 hasRelatedWork W2062059592 @default.
• W1486389616 hasRelatedWork W2095904973 @default.
• W1486389616 hasRelatedWork W2107974651 @default.
• W1486389616 hasRelatedWork W2130439356 @default.
• W1486389616 hasRelatedWork W2142785340 @default.
• W1486389616 hasRelatedWork W2149676416 @default.
• W1486389616 hasRelatedWork W2184595489 @default.
• W1486389616 hasRelatedWork W2589742570 @default.
• W1486389616 hasRelatedWork W2765751865 @default.
• W1486389616 hasRelatedWork W2773949621 @default.
• W1486389616 hasRelatedWork W2949426282 @default.
• W1486389616 hasRelatedWork W3124986484 @default.
• W1486389616 hasRelatedWork W3181629460 @default.
• W1486389616 hasRelatedWork W3208118959 @default.
• W1486389616 hasRelatedWork W2246169376 @default.
• W1486389616 isParatext "false" @default.
• W1486389616 isRetracted "false" @default.
• W1486389616 magId "1486389616" @default.
• W1486389616 workType "article" @default.