2 papers
cs.LO2025
Entailment vs. Verification for Partial-assignment Satisfiability and Enumeration
Roberto Sebastiani
Many procedures for SAT-related problems, in particular for those requiring the complete enumeration of satisfying truth assignments, rely their efficiency and effectiveness on the…
cs.LO2025
Exploiting Partial-Assignment Enumeration in Optimization Modulo Theories
Gabriele Masina, Roberto Sebastiani
Optimization Modulo Theories (OMT) extends Satisfiability Modulo Theories (SMT) with the task of optimizing some objective function(s). In OMT solvers, a CDCL-based SMT solver enum…