On Finding All Minimally Unsatisfiable Subformulas

@inproceedings{Liffiton2005OnFA,
  title={On Finding All Minimally Unsatisfiable Subformulas},
  author={Mark H. Liffiton and K. Sakallah},
  booktitle={SAT},
  year={2005}
}
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the problem, strongly linking it to the maximal satisfiability problem. From this relationship, we have developed a novel technique for extracting all MUSes of a CNF formula, tightly integrat ing our implementation with a modern SAT solver. We also present another algorithm for finding all MUSes, developed independently… Expand
Finding Guaranteed MUSes Fast
TLDR
An algorithm for finding a minimal unsatisfiable subset (MUS) of a CNF formula is introduced and it is found that its performance is very competitive on a wide range of benchmarks, including both formulas that are close to minimal unsatisfiability and formulas containing MUSes that are only a small fraction of the formula size. Expand
Finding Unsatisfiable Subformulas with Stochastic Method
TLDR
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
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
TLDR
Efficient algorithms to extract minimal unsatisfiable subsets of clauses or variables in unsatisfiable propositional formulas, based on heuristics, are proposed and it is shown that, in some cases, the minimality of the subformulas can be proven with these algorithms. Expand
Extracting minimal unsatisfiable subformulas in satisfiability modulo theories
TLDR
A depth-firstsearch algorithm and a breadth-first-search algorithm are proposed to compute minimal unsatisfiable cores in SMT, adopting different searching strategy. Expand
Using Local Search to Find and MUSes
In this paper, a new complete technique to compute Maximal Satisfiable Subsets ( MSSes) and Minimally Unsatisfiable Subformulas (MUSes) of sets of Boolean clauses is introduced. The approach improvesExpand
Tracking Unsatisfiable Subformulas from Reduced Refutation Proof
TLDR
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
On Approaches to Explaining Infeasibility of Sets of Boolean Clauses
TLDR
This paper focuses on the concept of minimally unsatisfiable subformulas (MUSes), which explain logical inconsistency in terms of minimal sets of contradictory clauses, and various recent results and computational approaches about MUSes and related concepts are discussed. Expand
Finding First-Order Minimal Unsatisfiable Cores with a Heuristic Depth-First-Search Algorithm
TLDR
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
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
TLDR
A baseline algorithm for finding a smallest-cardinality MUS (SMUS) of a given formula and a new branch-and-bound algorithm called Digger that computes a strong lower bound on the size of an SMUS and splits the problem into more tractable subformulas in a recursive search tree are presented. Expand
A Heuristic Local Search Algorithm for Unsatisfiable Cores Extraction
TLDR
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
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 14 REFERENCES
AMUSE: a minimally-unsatisfiable subformula extractor
TLDR
This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula that adapts the "learning process" of a modern SAT solver to identify unsatisfiableSubformulas rather than search for satisfying assignments. 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
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae
TLDR
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
Approximating minimal unsatisfiable subformulae by means of adaptive core search
  • R. Bruni
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2003
TLDR
This paper deals with the algorithmic problem of improving an enumerative (DPLL-style) approach to SAT, in order to overcome some structural defects of such an approach, and is able to evaluate the difficulty of each clause within a complete solution framework. Expand
Finding all minimal unsatisfiable subsets
TLDR
This paper gives algorithms for efficiently determining all minimal unsatisfiable subsets for any kind of constraints, taking into account notions of independence of constraints and using incremental constraint solvers to significantly improve the calculation of these subsets. Expand
An Extensible SAT-solver
TLDR
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
Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization
TLDR
This paper presents a new approach for efficiently determining all minimal unsatisfiable sets for any kind of constraints, which makes use of the duality that exists between minimal unsatisfiability constraint sets and maximal satisfiable constraint sets. Expand
Locating Minimal Infeasible Constraint Sets in Linear Programs
TLDR
A formulation aid which analyzes infeasible LPs and identifies minimal sets of inconsistent constraints from among the perhaps very large set of constraints defining the problem, speeding the repair of the model. Expand
Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms
TLDR
It is concluded that the recently developed SAT solvers are much more cache friendly in data structures and algorithm implementations compared with their predecessors. Expand
Formal methods for the validation of automotive product configuration data
TLDR
This paper gives a comprehensive account of BIS: the formalization of the business processes underlying its construction, the modifications of satisfiability-checking technology the authors found necessary in this context, and the software technology used to package the product as a client–server information system. Expand
...
1
2
...