Satisfiability solvers
Publisher Summary The past few years have seen enormous progress in the performance of
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …
A survey of recent advances in SAT-based formal verification
Dramatic improvements in SAT solver technology over the last decade and the growing
need for more efficient and scalable verification solutions have fueled research in …
need for more efficient and scalable verification solutions have fueled research in …
Satisfiability modulo theories
Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
[كتاب][B] Decision procedures
D Kroening, O Strichman - 2016 - Springer
A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …
correct yes/no answer. In this book, we focus on decision procedures for decidable first …
[كتاب][B] Handbook of knowledge representation
F Van Harmelen, V Lifschitz, B Porter - 2008 - books.google.com
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Effective preprocessing in SAT through variable and clause elimination
Preprocessing SAT instances can reduce their size considerably. We combine variable
elimination with subsumption and self-subsuming resolution, and show that these …
elimination with subsumption and self-subsuming resolution, and show that these …
[كتاب][B] Program synthesis by sketching
A Solar-Lezama - 2008 - search.proquest.com
The goal of software synthesis is to generate programs automatically from high-level
specifications. However, efficient implementations for challenging programs require a …
specifications. However, efficient implementations for challenging programs require a …
Program sketching
Sketching is a synthesis methodology that aims to bridge the gap between a programmer's
high-level insights about a problem and the computer's ability to manage low-level details. In …
high-level insights about a problem and the computer's ability to manage low-level details. In …
[HTML][HTML] Solving QBF with counterexample guided refinement
This article puts forward the application of Counterexample Guided Abstraction Refinement
(CEGAR) in solving the well-known PSPACE-complete problem of quantified Boolean …
(CEGAR) in solving the well-known PSPACE-complete problem of quantified Boolean …
InterLock: An intercorrelated logic and routing locking
In this paper, we propose a canonical prune-and-SAT (CP&SAT) attack for breaking state-of-
the-art routing-based obfuscation techniques. In the CP&SAT attack, we first encode the key …
the-art routing-based obfuscation techniques. In the CP&SAT attack, we first encode the key …