SAT in Saturation: A Satisfied Match
A tailored integration of SAT solving for detecting variants of subsumption in superposition using the Vampire prover and showing that SAT encodings improve literal matching, and thus subsumption, in first-order theorem proving is presented.
Laura Kovács, Tu Wien, Austria et al.
· 0 citations