88 citations · 340 across the 23 of their papers we have counts for
26 papers
Disjoint Partial Enumeration without Blocking Clauses
Giuseppe Spallitta, Roberto Sebastiani, Armin Biere
A basic algorithm for enumerating disjoint propositional models (disjoint AllSAT) is based on adding blocking clauses incrementally, ruling out previously found models. On the one…
On CNF Conversion for SAT and SMT Enumeration
Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani
Modern SAT and SMT solvers are designed to handle problems expressed in Conjunctive Normal Form (CNF) so that non-CNF problems must be CNF-ized upfront, typically by using variants…
Enhancing SMT-based Weighted Model Integration by Structure Awareness
Giuseppe Spallitta, Gabriele Masina, Paolo Morettin +2
The development of efficient exact and approximate algorithms for probabilistic inference is a long-standing goal of artificial intelligence research. Whereas substantial progress…
SMT-based Weighted Model Integration with Structure Awareness
Giuseppe Spallitta, Gabriele Masina, Paolo Morettin +2
Weighted Model Integration (WMI) is a popular formalism aimed at unifying approaches for probabilistic inference in hybrid domains, involving logical and algebraic constraints. Des…
On Enumerating Short Projected Models
Sibylle Möhle, Roberto Sebastiani, Armin Biere
Propositional model enumeration, or All-SAT, is the task to record all models of a propositional formula. It is a key task in software and hardware verification, system engineering…
Are You Satisfied by This Partial Assignment?
Roberto Sebastiani
Many procedures for SAT and SAT-related problems -- in particular for those requiring the complete enumeration of satisfying truth assignments -- rely their efficiency on the detec…