• Corpus ID: 239769092

On Enumerating Short Projected Models

  title={On Enumerating Short Projected Models},
  author={Sibylle Mohle and Roberto Sebastiani and 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, and predicate abstraction, to mention a few. It also provides a means to convert a CNF formula into DNF, which is relevant in circuit design. While in some applications enumerating models multiple times causes no harm, in others avoiding repetitions is crucial. We therefore present two model enumeration algorithms… 

Figures from this paper


Four Flavors of Entailment
A novel approach for enumerating partial models of a propositional formula, inspired by how theory solvers and the SAT solver interact in lazy SMT is presented, with potential applications in weighted model counting and weighted model integration for probabilistic inference over Boolean and hybrid domains.
Pruning Techniques for the SAT-Based Bounded Model Checking Problem
The general conditions for reusability of constraints, and a simple procedure for evaluating them are defined, and it is shown how a similar procedure can be used for restricting the search space of individual SAT instances corresponding to BMC invariant formulas.
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments to the important
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
The most noteworthy aspects of this work are the inclusion of rules for forget, restart, and incremental solving and the application of stepwise refinement in Isabelle’s Refinement Framework.
Minimal Assignments for Bounded Model Checking
This work forms the extraction of a succinct counterexample as the problem of finding a minimal assignment that, together with the Boolean formula describing the model, implies an objective.
Formalisation of Ground Inference Systems in a Proof Assistant Domain : Data Structures and Algorithms
Various methods have been developed for solving SAT problems, notably resolution, the Davis-Putnam-Logemann-Loveland-Procedure procedure (DPLL) and an extension of it, the conflict-driven clause
Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit
An improved algorithm for finding all satisfying assignments for a generic Boolean circuit based on a hybrid SAT solver that can apply conflict analysis and implications to both CNF formulae and general circuits is presented.
Minimizing Models for Tseitin-Encoded SAT Instances
This paper examines how a given model can be minimized for SAT instances that have been obtained by Tseitin encoding of a full propositional logic formula and uses a SAT solver to efficiently minimize agiven model, focusing on only the input variables.
Tuning SAT Checkers for Bounded Model Checking
It is shown that the unique characteristics of BMC formulas can be exploited for a variety of optimizations in the SAT checking procedure, comparing to both the standard SAT procedure and a BDD-based model.
The Good Old Davis-Putnam Procedure Helps Counting Models
An algorithm is presented that computes the exact number of models of a propositional CNF or DNF formula F using the Davis-Putnam procedure and the practical performance of CDP has been estimated in a series of experiments on a wide variety of CNF formulas.