Minimal satisfying assignment

[S.S]

Hi,

This is not an issue but a question about finding a minimal model for a satisfiable query. It is like a set cover problem and a brute force solution is possible after a model is returned but I was curious if there is a more elegant way.

Say z = (a v b) /\ (b v c). This formula can just be satisfied with b = True and (a,c) are essentially don't cares. I hope my question makes sense.

[Axel Kemper]

You might find this paper from 2013 helpul.
Markus Iser, Carsten Sinz, Mana Taghdiri: Minimizing Models for Tseitin-Encoded SAT Instances

[S.S]

Thanks. This looks like what I wanted.