All solutions SAT (AllSAT for short) is a variant of the propositional satisfiability problem.
AllSAT has been relatively unexplored compared to other variants despite its significance …

Motivated by the need to improve the scalability of Intel's in-house Static Timing Analysis
(STA) tool, we consider the problem of enumerating all the solutions of a single-output …

The All-SAT problem deals with determining all the satisfying assignments that exist for a
given propositional logic formula. This problem occurs in verification applications including …

Feature models are widely used to encode the configurations of a software product line in
terms of mandatory, optional and exclusive features as well as propositional constraints over …

In this paper, we address the problem of enumerating all models of a Boolean formula in
conjunctive normal form (CNF). We propose an extension of Conflict Driven Clause …

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 …

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 …

The All-SAT (All-SATisfiable) problem focuses on finding all satisfiable assignments of a
given propositional formula, whose applications include model checking, automata …

Abstract All Solution SAT (AllSAT) is a variant of Propositional Satisfiability, which aims to
find all satisfying assignments for a given formula. AllSAT has significant applications in …

In this paper, we introduce a new problem, called Top-k SAT, that consists in enumerating
the Top-k models of a propositional formula. A Top-k model is defined as a model with less …