An approach for extracting a small unsatisfiable core

@article{Gershman2008AnAF,
  title={An approach for extracting a small unsatisfiable core},
  author={Roman Gershman and Maya Koifman and Ofer Strichman},
  journal={Formal Methods in System Design},
  year={2008},
  volume={33},
  pages={1-27}
}
The thesis addresses the problem of finding a small unsatisfiable core of an unsatisfiable CNF formula. The proposed algorithm, CoreTrimmer , iterates over each internal node d in the resolution graph that ‘consumes’ a large number of clauses M (i.e. a large number of original clauses are present in the unsat core, whose sole purpose is proving d) and attempts to prove them without the M clauses. If this is possible, it transforms the resolution graph into a new graph that does not have the M… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

Similar Papers

Loading similar papers…