Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm

@inproceedings{Zhang2006ExtractingMU,
  title={Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm},
  author={Jianmin Zhang and Sikun Li and ShengYu Shen},
  booktitle={Australian Conference on Artificial Intelligence},
  year={2006}
}
Explaining the causes of infeasibility of Boolean formulas has practical applications in various fields. We are generally interested in a minimum explanation of infeasibility that excludes irrelevant information. A smallest-cardinality unsatisfiable subset, called a minimum unsatisfiable core, can provide a succinct explanation of infeasibility and is valuable for applications. However little attention has been concentrated on extraction of minimum unsatisfiable cores. In this paper, we propose… 

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.

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.

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.

A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas

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.

Boosting minimal unsatisfiable core extraction

It is demonstrated that one of the algorithms outperforms existing algorithms for clause-level minimal unsatisfiable core extraction on large well-known industrial benchmarks and is highly scalable for the problem of high-level non-minimal unsatisfiablecore extraction on huge benchmarks generated by Intel's proof-based abstraction refinement flow.

Quantified maximum satisfiability

Experimental results, obtained on representative problem instances, indicate that the core-guided approach for the SMUS and SMES problems outperforms the use of iterative search over the values of the cost function.

Quantified Maximum Satisfiability: - A Core-Guided Approach

Experimental results indicate that the core-guided approach for the SMUS problem outperforms the use of linear search over the values of the cost function, and also outperform the state-of-the-art SMUS extractor Digger.

Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper)

  • Joao Marques-Silva
  • Computer Science
    2010 40th IEEE International Symposium on Multiple-Valued Logic
  • 2010
This paper provides an overview of some of the computational problems related with minimal unsatisfiability in Boolean logic, including the identification of one minimal unsatisfiable sub-formula and the Identification of all minimal unsatisfable sub- formulas.

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.

Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores

Nine optimizations to the problem of minimizing the participation of such constraints high-level minimal unsatisfiable core (HLMUC) extraction are proposed, and these techniques are implemented in the award-winning solvers HaifaMUC and HaifaHLM UC.

References

SHOWING 1-10 OF 16 REFERENCES

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.

MUP: a minimal unsatisfiability prover

  • Jinbo Huang
  • Computer Science
    Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.
  • 2005
This paper describes a practical algorithm that decides the minimal unsatisfiability of any CNF formula through BDD manipulation and provides an empirical evaluation of the algorithm, highlighting its efficiency on a set of hard problems as well as its ability to work with existing subformula extraction tools to achieve optimal results.

AMUSE: a minimally-unsatisfiable subformula extractor

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.

Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae

Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization

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.

Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms

It is concluded that the recently developed SAT solvers are much more cache friendly in data structures and algorithm implementations compared with their predecessors.

Satisfiability-based layout revisited: detailed routing of complex FPGAs via search-based Boolean SAT

A new search-based Satisfiability (SAT) formulation that can handle entire FPGAs, routing all nets concurrently, relies on a recently developed SAT engine that uses systematic search with conflict-directed non-chronological backtracking, capable of handling very large SAT instances.

Automatic Abstraction without Counterexamples

A method of automatic abstraction is presented that uses proofs of unsatisfiability derived from SAT-based bounded model checking as a guide to choosing an abstraction for unbounded model checking.

Boosting complete techniques thanks to local search methods

In this paper, an efficient heuristic allowing one to localize inconsistent kernels in propositional knowledge‐bases is described. Then, it is shown that local search techniques can boost the

Adaptation in natural and artificial systems

Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.