Using local search to find MSSes and MUSes

European Journal of Operational Research

Volumn 199, Issue 3, 2009, Pages 640-646

  Grégoire, Éric ^a   Mazure, Bertrand ^a   Piette, Cédric ^a  

^a UNIV LILLE   (France)

Author keywords

Hybrid algorithm; MSSes; MUSes; SAT; Satisfiability

Indexed keywords

HYBRID ALGORITHM; MSSES; MUSES; SAT; SATISFIABILITY;

CIRCUIT THEORY;

EID: 67349230344     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.06.066     Document Type: Article

References (21)

1. Papadimitriou C.H., and Wolfe D. The complexity of facets resolved. Journal of Computer and System Sciences 37 1 (1988) 2-13
2. Eiter T., and Gottlob G. On the complexity of propositional knowledge base revision, updates and counterfactual. Artificial Intelligence 57 (1992) 227-270
3. In: Hamscher W., Console L., and de Kleer J. (Eds). Readings in Model-Based Diagnosis (1992), Morgan Kaufmann
4. M. Liffiton, K. Sakallah, On finding all minimally unsatisfiable subformulas, in: Proceedings of SAT'05, 2005, pp. 173-186.
5. Bruni R. On exact selection of minimally unsatisfiable subformulae. Annals of Mathematics and Artificial Intelligence 43 1 (2005) 35-50
6. Büning H. On subclasses of minimal unsatisfiable formulas. Discrete Applied Mathematics 107 1-3 (2000) 83-98
7. Davydov G., Davydova I., and Büning H. An efficient algorithm for the minimal unsatisfiability problem for a subclass of cnf. Annals of Mathematics and Artificial Intelligence 23 3-4 (1998) 229-245
8. Fleischner H., Kullman O., and Szeider S. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoretical Computer Science 289 1 (2002) 503-516
9. Bruni R. Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Applied Mathematics 130 2 (2003) 85-100
10. L. Zhang, S. Malik, Extracting small unsatisfiable cores from unsatisfiable boolean formula, in: Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT'03), Portofino (Italy), 2003, pp. 239-249.
11. I. Lynce, J. Marques-Silva, On computing minimum unsatisfiable cores, in: Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT'04), Vancouver, 2004, pp. 305-310.
12. Y. Oh, M. Mneimneh, Z. Andraus, K. Sakallah, I. Markov, AMUSE: a minimally-unsatisfiable subformula extractor, in: Proceedings of the 41th Design Automation Conference (DAC 2004), 2004, pp. 518-523.
13. É.Grégoire, B. Mazure, C. Piette, Extracting MUS, in: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI'06), Riva del Garda, Italy, 2006, pp. 387-391.
14. É. Grégoire, B. Mazure, C. Piette, Tracking mus and strict inconsistent cover, in: Proceedings of International Conference on Formal Methods in Computer-Aided Design (FMCAD'06), San Jose, CA, USA, 2006, pp. 39-46.
15. Bessant B., Grégoire E., Marquis P., and Saïs L. Iterated syntax-based revision in a nonmonotonic setting. Applied Logic. Logic Series vol. 22 (2001), Kluwer Academic Publishers (Chapter of Frontiers in Belief Revision, pp. 369-391)
16. J. Bailey, P. Stuckey, Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization, in: PADL, 2005, pp. 174-186.
17. M. de la Banda, P. Stuckey, J. Wazny, Finding all minimal unsatisfiable subsets, in: Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDL 2003), 2003, pp. 32-43.
18. L. Zhang, On subsumption removal and on-the-fly cnf simplification, in: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT'05), 2005, pp. 482-489.
19. N. Eén, N. Sörensson, Minisat home page, 2004 .
20. H. Kautz, B. Selman, D. McAllester, Walksat in the SAT'2004 competition, SAT Competition 2004 - Solver Description.
21. SATLIB, Benchmarks on SAT, 2006 .