Classes of propositional UMU formulas and their extensions to minimal unsatisfiable formulas

DOI10.1016/J.TCS.2024.114538MaRDI QIDQ6129706zbMATH OpenFDO

Authors Hans Kleine Büning

Publication date 17 April 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114538

zbMATH Keywords

extensionspropositional logicsubclassesunion of minimal unsatisfiable formulas

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• The complexity of some subclasses of minimal unsatisfiable formulas.
• On subclasses of minimal unsatisfiable formulas
• Complexity results on minimal unsatisfiable formulas
• Theory and Applications of Models of Computation
• On the structure of some classes of minimal unsatisfiable formulas

Cited in

(1)

• Explanations of unsatisfiability beyond minimal subsets

This page was built for publication: Classes of propositional UMU formulas and their extensions to minimal unsatisfiable formulas

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