Search Constraints

Start Over
Filtering by: Creator Brooks, J. R. Remove constraint Creator: Brooks, J. R. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Contributor Bittner, Paul Maximillian Remove constraint Contributor: Bittner, Paul Maximillian

Search Results

  • Variational Satisfiability Solving

    Creator:
    Young, Jeffrey M.
    Abstract:
    Over the last two decades, satisfiability and satisfiability-modulo theory (SAT/SMT) solvers have grown powerful enough to be general purpose reasoning engines throughout software engineering and computer science. However, most practical use cases of SAT/SMT solvers require not just solving a single SAT/SMT problem, but solving sets of related SAT/SMT problems....
    Resource Type:
    Dissertation
    Full Text:
    ∧ c ∧ e q = a ∧ (b ∨ ¬i) ∧ c ∧ (g → c) r = z ↔ (a ∧ b ∧ c ∧ e) 2By the standard, this is a well