Lazy Satisability Modulo Theories

  title={Lazy Satisability Modulo Theories},
  author={R. Sebastiani},
  journal={J. Satisf. Boolean Model. Comput.},
  • R. Sebastiani
  • Published 2007
  • Computer Science
  • J. Satisf. Boolean Model. Comput.
  • Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some decidable first-order theory T (SMT (T )). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized as increasingly important due to its applications in many domains in different communities, in particular in formal verification. An amount of papers with novel and very efficient techniques for SMT has been… CONTINUE READING
    85 Citations
    Satisfiability Modulo Theories
    • 92
    • PDF
    Formally certified satisfiability solving
    A system for CSP solving through satisfiability Modulo theories
    • 3
    • Highly Influenced
    • PDF
    Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories
    • 8
    • PDF
    Superposition modulo theory
    • 8
    • PDF


    SMT-COMP: Satisfiability Modulo Theories Competition
    • 113
    • Highly Influential
    • PDF
    Efficient theory combination via boolean search
    • 74
    • PDF
    Lemma Learning in SMT on Linear Constraints
    • 21
    New results on rewrite-based satisfiability procedures
    • 103
    • PDF
    Satisfiability Modulo Theories
    • 884
    • PDF