Elsevier

Theoretical Computer Science

Volume 492, 24 June 2013, Pages 70-87
Theoretical Computer Science

On Davis–Putnam reductions for minimally unsatisfiable clause-sets

https://doi.org/10.1016/j.tcs.2013.04.020Get rights and content
Under an Elsevier user license
open archive

Abstract

DP-reduction FDPv(F), applied to a clause-set F and a variable v, replaces all clauses containing v by their resolvents (on v). A basic case, where the number of clauses is decreased (i.e., c(DPv(F))<c(F)), is singular DP-reduction (sDP-reduction), where v must occur in one polarity only once. For minimally unsatisfiable FMU, sDP-reduction produces another FDPv(F)MU with the same deficiency, that is, δ(F)=δ(F); recall δ(F)=c(F)n(F), using n(F) for the number of variables. Let sDP(F) for FMU be the set of results of complete sDP-reduction for F; so FsDP(F) fulfil FMU, are nonsingular (every literal occurs at least twice), and we have δ(F)=δ(F). We show that for FMU all complete reductions by sDP must have the same length, establishing the singularity index of F. In other words, for F,FsDP(F) we have n(F)=n(F). In general the elements of sDP(F) are not even (pairwise) isomorphic. Using the fundamental characterisation by Kleine Büning, we obtain as application of the singularity index, that we have confluence modulo isomorphism (all elements of sDP(F) are pairwise isomorphic) in case δ(F)=2. In general we prove that we have confluence (i.e., |sDP(F)|=1) for saturated F (i.e., FSMU). More generally, we show confluence modulo isomorphism for eventually saturatedF, that is, where we have sDP(F)SMU, yielding another proof for confluence modulo isomorphism in case of δ(F)=2.

Keywords

Clause-sets (CNFs)
Minimal unsatisfiability
DP-reduction (Davis–Putnam reduction)
Variable elimination
Confluence
Isomorphism
Singular variables
Singular DP-reduction
Deficiency

Cited by (0)