Minimally unsatisfiable Boolean circuits

DOI10.1007/978-3-642-21581-0_13MaRDI QIDQ3007680zbMATH OpenOpenAlexFDO

Authors Anton Belov, Joao Marques-Silva

Publication date 17 June 2011

Published in Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21581-0_13

Mathematics Subject Classification ID

Classical propositional logic (03B05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Computing minimally unsatisfiable subformulas: state of the art and future directions
• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• On computing the union of MUSes
• Theory and Applications of Satisfiability Testing

Cites work

• scientific article; zbMATH DE number 5510691 (Why is no real title available?)
• On improving MUS extraction algorithms
• Towards a notion of unsatisfiable cores for LTL
• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems

Cited in

(9)

• Minimal sets on propositional formulae. Problems and reductions
• Boolean minors
• Non-clausal redundancy properties
• The minimal circuits for linear Boolean functions
• Extracting unsatisfiable cores for LTL via temporal resolution
• scientific article; zbMATH DE number 4204280 (Why is no real title available?)
• Computing minimally unsatisfiable subformulas: state of the art and future directions
• Algorithms for computing minimal equivalent subformulas
• Minimal False Quantified Boolean Formulas

Describes a project that uses

Uses Software

• PicoSAT
• Sat4j

This page was built for publication: Minimally unsatisfiable Boolean circuits

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