Stem subformula$ (all stems)

5 papers:

SAT-2005-LiffitonS #on the #satisfiability

On Finding All Minimally Unsatisfiable Subformulas (MHL, KAS), pp. 173–186.

DAC-2004-OhMASM #named #satisfiability

AMUSE: a minimally-unsatisfiable subformula extractor (YO, MNM, ZSA, KAS, ILM), pp. 518–523.

ICALP-2004-FeigeO #random #scalability

Easily Refutable Subformulas of Large Random 3CNF Formulas (UF, EO), pp. 519–530.

SAT-2002-Bruni #satisfiability

Exact selection of minimal unsatisfiable subformulae for special classes of propositional formulae (RB), p. 22.

SAT-2001-BruniS #maintenance #satisfiability

Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae (RB, AS), pp. 162–173.