Towards efficient MUS extraction

@article{Belov2012TowardsEM,
  title={Towards efficient MUS extraction},
  author={Anton Belov and In{\^e}s Lynce and Joao Marques-Silva},
  journal={AI Commun.},
  year={2012},
  volume={25},
  pages={97-116}
}
Minimally Unsatisfiable Subformulas (MUS) find a wide range of practical applications, including product configuration, knowledge-based validation, and hardware and software design and verification. MUSes also find application in recent Maximum Satisfiability algorithms and in CNF formula redundancy removal. Besides direct applications in Propositional Logic, algorithms for MUS extraction have been applied to more expressive logics. This paper proposes two algorithms for MUS extraction. The… CONTINUE READING
Highly Cited
This paper has 81 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

Artificial Intelligence and Symbolic Computation

Lecture Notes in Computer Science • 2018
View 9 Excerpts
Highly Influenced

Small Unsatisfiable Subsets in Constraint Satisfaction

2014 IEEE 26th International Conference on Tools with Artificial Intelligence • 2014
View 10 Excerpts
Highly Influenced

Some notes on model rotation

ArXiv • 2013
View 4 Excerpts
Highly Influenced

Efficient MUS extraction with resolution

2013 Formal Methods in Computer-Aided Design • 2013
View 5 Excerpts
Highly Influenced

81 Citations

0102030'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 54 references

Boosting minimal unsatisfiable core extraction

Formal Methods in Computer Aided Design • 2010
View 11 Excerpts
Highly Influenced

Finding Guaranteed MUSes Fast

View 12 Excerpts
Highly Influenced

The Sat4j library, release 2.2

View 3 Excerpts
Highly Influenced

Generalizing Core-Guided Max-SAT

View 19 Excerpts
Highly Influenced

On Approaches to Explaining Infeasibility of Sets of Boolean Clauses

2008 20th IEEE International Conference on Tools with Artificial Intelligence • 2008
View 6 Excerpts
Highly Influenced

PicoSAT Essentials

JSAT • 2008
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…