Erika Ábrahám

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Satisfiability Checking is a relatively young research area, aiming at the development of efficient software technologies for checking the satisfiability of existentially quantified logical formulas. Besides the success story of SAT solving for propositional logic, SAT-modulo-theories (SMT) solvers offer sophisticated solutions for different theories. When(More)
  • 1