Sciweavers

ECAI
2008
Springer
14 years 1 months ago
Vivifying Propositional Clausal Formulae
Abstract. In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our app...
Cédric Piette, Youssef Hamadi, Lakhdar Sais
CAV
2006
Springer
121views Hardware» more  CAV 2006»
14 years 3 months ago
Deriving Small Unsatisfiable Cores with Dominators
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
Roman Gershman, Maya Koifman, Ofer Strichman