A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas

From MaRDI portal









Describes a project that uses

Uses Software






This page was built for publication: A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713745)