Minimally Unsatisfiable Boolean Circuits

DOI10.1007/978-3-642-21581-0_13zbMath1330.68268OpenAlexW19370143MaRDI QIDQ3007680

Anton Belov, João P. 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

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

Related Items (2)

Extracting unsatisfiable cores for LTL via temporal resolution ⋮ Minimal sets on propositional formulae. Problems and reductions

Uses Software

• PicoSAT
• Sat4j

Cites Work

• Unnamed Item
• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
• On Improving MUS Extraction Algorithms
• Towards a Notion of Unsatisfiable Cores for LTL

This page was built for publication: Minimally Unsatisfiable Boolean Circuits