FRINK Linked Data Fragments server

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

• W35365073 abstract "Boolean satisfiability (SAT) was the first problem to be proven to be NP-Complete. The proof, provided by Stephen Cook in 1971, demonstrated that inputs accepted by a non-deterministic Turing machine can be described by satisfying assignments of a Boolean formula. The reduction to SAT feels natural for a wealth of decision problems; this has motivated an immense amount of research into heuristics for solving SAT instances quickly. Over the past decade the performance of SAT solvers has improved tremendously, and as a consequence, real-world problems that were once thought to be intractable are now feasible in many cases. In this thesis we discuss how some problems in logic synthesis and verification can be solved with Boolean satisfiability. The dissertation begins by discussing Cyclic Combinational Circuits. Cyclic Combinational Circuits are logic circuits that contain feedback, but exhibit no state behavior. Many functions can be implemented with fewer gates using a cyclic topology rather than an acyclic topology. A pivotal step in synthesizing these circuits is proving whether or not the resulting structure is actually combinational, and if not, how to modify the circuit to behave properly. This analysis can be elegantly cast as an instance of SAT. Furthermore, this thesis demonstrates how modern SAT-Based synthesis techniques can be used to generate cyclic structures, rather than just analyze them. These SAT-Based synthesis techniques rely on augmenting proofs of unsatisfiability to generate circuit structures. These structures, called Craig Interpolants, and the proofs they are generated from are the focus of the second portion of this dissertation. Techniques are proposed for reducing the size of these interpolants, and then the use of proofs of unsatisfiability as an underlying data structure for synthesis is advocated. Finally, the last portion of this thesis discusses some improvements to a new model checking algorithm known as Property Directed Reachability (PDR). This algorithm iteratively solves SAT instances representing discrete time frames of a sequential circuit in order to demonstrate that a state invariant exists." @default.
• W35365073 created "2016-06-24" @default.
• W35365073 creator A5044441669 @default.
• W35365073 creator A5069435775 @default.
• W35365073 date "2013-01-01" @default.
• W35365073 modified "2023-09-24" @default.
• W35365073 title "Algorithms and data structures for logic synthesis and verification using boolean satisfiability" @default.
• W35365073 cites W1484594398 @default.
• W35365073 cites W1485781696 @default.
• W35365073 cites W1495106406 @default.
• W35365073 cites W1495266209 @default.
• W35365073 cites W1496529478 @default.
• W35365073 cites W1503170978 @default.
• W35365073 cites W1510132912 @default.
• W35365073 cites W1510368738 @default.
• W35365073 cites W1511688816 @default.
• W35365073 cites W1518705996 @default.
• W35365073 cites W1549166962 @default.
• W35365073 cites W1561934984 @default.
• W35365073 cites W1563456403 @default.
• W35365073 cites W1564947547 @default.
• W35365073 cites W1566132409 @default.
• W35365073 cites W1586677474 @default.
• W35365073 cites W1608279203 @default.
• W35365073 cites W1806449990 @default.
• W35365073 cites W1950282396 @default.
• W35365073 cites W1989912322 @default.
• W35365073 cites W1990190087 @default.
• W35365073 cites W2001289891 @default.
• W35365073 cites W2004306067 @default.
• W35365073 cites W2010065567 @default.
• W35365073 cites W2023808162 @default.
• W35365073 cites W2024148935 @default.
• W35365073 cites W2024223745 @default.
• W35365073 cites W2033176194 @default.
• W35365073 cites W2035561773 @default.
• W35365073 cites W2044095368 @default.
• W35365073 cites W2048051309 @default.
• W35365073 cites W2053068495 @default.
• W35365073 cites W2057361103 @default.
• W35365073 cites W2067776562 @default.
• W35365073 cites W2080267935 @default.
• W35365073 cites W2094204687 @default.
• W35365073 cites W2095698047 @default.
• W35365073 cites W2100465945 @default.
• W35365073 cites W2105761964 @default.
• W35365073 cites W2106950603 @default.
• W35365073 cites W2118382442 @default.
• W35365073 cites W2118551933 @default.
• W35365073 cites W2118791871 @default.
• W35365073 cites W2120223433 @default.
• W35365073 cites W2125607701 @default.
• W35365073 cites W2125850227 @default.
• W35365073 cites W2126900870 @default.
• W35365073 cites W2142785340 @default.
• W35365073 cites W2146662253 @default.
• W35365073 cites W2147348835 @default.
• W35365073 cites W2150517041 @default.
• W35365073 cites W2158135227 @default.
• W35365073 cites W2158748448 @default.
• W35365073 cites W2159318488 @default.
• W35365073 cites W2159503942 @default.
• W35365073 cites W2160156809 @default.
• W35365073 cites W2160776998 @default.
• W35365073 cites W2335478831 @default.
• W35365073 cites W25571951 @default.
• W35365073 cites W3004540582 @default.
• W35365073 cites W3141112769 @default.
• W35365073 cites W3144889436 @default.
• W35365073 cites W78552530 @default.
• W35365073 cites W81626549 @default.
• W35365073 hasPublicationYear "2013" @default.
• W35365073 type Work @default.
• W35365073 sameAs 35365073 @default.
• W35365073 citedByCount "0" @default.
• W35365073 crossrefType "dissertation" @default.
• W35365073 hasAuthorship W35365073A5044441669 @default.
• W35365073 hasAuthorship W35365073A5069435775 @default.
• W35365073 hasConcept C108710211 @default.
• W35365073 hasConcept C111797529 @default.
• W35365073 hasConcept C111919701 @default.
• W35365073 hasConcept C11413529 @default.
• W35365073 hasConcept C127705205 @default.
• W35365073 hasConcept C131017901 @default.
• W35365073 hasConcept C141796577 @default.
• W35365073 hasConcept C158465420 @default.
• W35365073 hasConcept C168773769 @default.
• W35365073 hasConcept C187455244 @default.
• W35365073 hasConcept C196836630 @default.
• W35365073 hasConcept C200415742 @default.
• W35365073 hasConcept C2524010 @default.
• W35365073 hasConcept C33923547 @default.
• W35365073 hasConcept C39685927 @default.
• W35365073 hasConcept C41008148 @default.
• W35365073 hasConcept C6943359 @default.
• W35365073 hasConcept C80444323 @default.
• W35365073 hasConcept C81409106 @default.
• W35365073 hasConceptScore W35365073C108710211 @default.
• W35365073 hasConceptScore W35365073C111797529 @default.
• W35365073 hasConceptScore W35365073C111919701 @default.

• next