AMUSE: a minimally-unsatisfiable subformula extractor

  title={AMUSE: a minimally-unsatisfiable subformula extractor},
  author={Yoonna Oh and M. Mneimneh and Zaher S. Andraus and K. Sakallah and I. Markov},
  journal={Proceedings. 41st Design Automation Conference, 2004.},
This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula. Such unsatisfiable "cores" can be very helpful in diagnosing the causes of infeasibility in large systems. Our algorithm is unique in that it adapts the "learning process" of a modern SAT solver to identify unsatisfiable subformulas rather than search for satisfying assignments. Compared to existing approaches, this method can be viewed as a bottom-up core extraction procedure… Expand
Extracting minimal unsatisfiable subformulas in satisfiability modulo theories
A depth-firstsearch algorithm and a breadth-first-search algorithm are proposed to compute minimal unsatisfiable cores in SMT, adopting different searching strategy. Expand
Finding Unsatisfiable Subformulas with Stochastic Method
A resolution-based stochastic local search algorithm that directly constructs the resolution sequences for proving unsatisfiability with a local search procedure, and then extracts small unsatisfiable subformulas from the refutation traces is proposed. Expand
A Heuristic Local Search Algorithm for Unsatisfiable Cores Extraction
A heuristic-based local search algorithm is proposed to derive unsatisfiable cores by directly constructs the resolution sequence for proving unsatisfiability with a local search procedure, and then extracts small unsatisfiability cores from the sequence. Expand
On Finding All Minimally Unsatisfiable Subformulas
A novel technique is developed for extracting all MUSes of a CNF formula, tightly integrat ing the authors' implementation with a modern SAT solver and discussing ways in which ideas from both could be combined to improve further. Expand
MUP: a minimal unsatisfiability prover
  • Jinbo Huang
  • Mathematics
  • Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.
  • 2005
After establishing the unsatisfiability of a SAT instance encoding a typical design task, there is a practical need to identify its minimal unsatisfiable subsets, which pinpoint the reasons for theExpand
Finding First-Order Minimal Unsatisfiable Cores with a Heuristic Depth-First-Search Algorithm
DFS-Finder is presented, which finds minimal unsatisfiable cores in first-order logic, adopting a heuristic depth-first-search strategy and demonstrating the effectiveness of this approach on a very extensive test of SMT-LIB benchmarks. Expand
Tracking Unsatisfiable Subformulas from Reduced Refutation Proof
This paper presents the definitions of refutation proof and refutation parsing graph, and proposes a resolution based local search algorithm to track unsatisfiable subformulas according to the reduced refutationProof of a formula. Expand
From Max-SAT to Min-UNSAT : Insights and Applications
This report describes a strong connection between maximum satisfiability and minimally-unsatisfiable subfor-mulas of any constraint system, as well as techniques for exploiting it. Focusing on CNFExpand
On Improving MUS Extraction Algorithms
The first algorithm is optimal in its class, meaning that it requires the smallest number of calls to a SAT solver, and the resulting algorithms achieve significant performance gains with respect to state of the art MUS extraction algorithms. Expand
On Computing Minimum Unsatisfiable Cores
As part of the process of generating unsatisfiable proofs, one is also interested in unsatisfiable subformulas of the original formula, also known as unsatisfiable cores, which may be very useful in AI problems where identifying the minimum core is crucial for correcting the minimum amount of inconsistent information. Expand


Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae
An heuristic procedure is developed which is able, for unsatisfiable instances, to locate a set of clauses causing unsatisfiability that corresponds to the part of the system that the authors respectively need to re-design or to keep when they respectively want a satisfiable or unsatisfiable formula. Expand
An Extensible SAT-solver
This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints. Expand
Efficient conflict driven learning in a Boolean satisfiability solver
This paper generalizes various conflict driven learning strategies in terms of different partitioning schemes of the implication graph to re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes. Expand
On subclasses of minimal unsatisfiable formulas
  • H. K. Büning
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2000
It is proved that MU ( k ) for fixed k is in NP, and for MU (2) the author presents a simple and unique characterization. Expand
SATIRE: A new incremental satisfiability engine
SATIRE is introduced, a new satisfiability solver that is particularly suited to verification and optimization problems in electronic design automation, and includes two new features to achieve even higher performance: a facility for incrementally solving sets of related problems, and the ability to handle non-CNF constraints. Expand
GRASP: A Search Algorithm for Propositional Satisfiability
Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances. Expand
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
It is shown that in case of at most n clauses no formula is minimal unsatisfiable, and for n+1 clauses the minimal unsatisfiability problem is solvable in quadratic time. Expand
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
The structure of minimal unsatisfiable CNF formulas in n variables containing precisely n + 1 clauses is characterised, and this characterization is given a geometric interpretation. Expand
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
An algorithm is state which recognizes minimal unsatisfiable formulas with any fixed deficiency in polynomial time with the aim of finding a solution to the problem of satisfiability of conjunctive normal form formulas. Expand
Symbolic model checking: an approach to the state explosion problem
The symbolic model checking technique revealed subtle errors in this protocol, resulting from complex execution sequences that would occur with very low probability in random simulation runs, and an alternative method is developed for avoiding the state explosion in the case of asynchronous control circuits. Expand