Tracking MUSes and strict inconsistent covers

Proceedings of Formal Methods in Computer Aided Design, FMCAD 2006

Volumn , Issue , 2006, Pages 39-46

  Grégoire, Eric ^a   Mazure, Bertrand ^a   Piette, Cédric ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; FUNCTION EVALUATION; HEURISTIC METHODS;

MINIMALLY UNSATISFIABLE SUBFORMULAS; SATISFIABILITY;

COMPUTATIONAL METHODS;

EID: 34547476154     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2006.34     Document Type: Conference Paper

References (22)

1. J. Bailey and P. J. Stuckey. Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In PADL, pages 174-186, 2005.
2. F. Boussemart, F. Hémery, C. Lecoutre, and L. Saïs. Boosting systematic search by weighting constraints. In European Conference on Artificial Intelligence (ECAI'04), pages 146-150, Valencia (Spain), 2004.
3. L. Brisoux, É. Grégoire, and L. Saïs. Checking depthlimited consistency and inconsistency in knowledgebased systems. International Journal of Intelligent Systems, 16(3):333-360, 2001.
4. R. Bruni. Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Applied Mathematics, 130(2):85-100, 2003.
5. R. Bruni. On exact selection of minimally unsatisfiable subformulae. Annals of Mathematics and Artificial Intelligence, 43(1):35-50, 2005.
6. H. Büning. On subclasses of minimal unsatisfiable formulas. Discrete Applied Mathematics, 107(l-3):83-98, 2000.
7. G. Davydov, I. Davydova, and H. Büning. An efficient algorithm for the minimal unsatisfiability problem for a subclass of cnf. Annals of Mathematics and Artificial Intelligence, 23(3-4):229-245, 1998.
8. DIMACS. Benchmarks on SAT. ftp://dimacs.rutgers.edu/pub/challenge/ satisfiability/. [9] T. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates and counterfactual. Artificial Intelligence, 57:227-270, 1992.
9. H. Fleischner, O. Kullman, and S. Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoretical Computer Science, 289(1):503-516, 2002.
10. É. Grégoire and D. Ansart. Overcoming the Christmas tree syndrome. International Journal on Artificial Intelligence Tools (IJAIT), 9(2):97-111, 2000.
11. É. Grégoire, B. Mazure, and L. Saïs. Using failed local search for SAT as an oracle for tackling harder A.I. problems more efficiently. In International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA'02), pages 51-60, LNCS 2443, Springer, Varna (Bulgaria), 2002.
12. C. L. Hamscher W. and de Kleer J., editors. Readings in Model-Based Diagnosis. Morgan Kaufmann, 1992.
13. J. Huang. MUP: A minimal unsatisfiability prover. In Asia and South Pacific Design Automation Conference (ASP-DAC'05), pages 432-437, Shanghai, China, 2005.
14. H. Kautz, B. Selman, and D. McAllester. Walksat in the SAT 2004 competition. In International Conference on Theory and Applications of Satisfiability Testing (SAT'04), Vancouver, 2004.
15. M. Liffiton and K. Sakallah. On finding all minimally unsatisfiable subformulas. In International Conference on Theory and Applications of Satisfiability Testing (SAT'05), pages 173-186, 2005.
16. I. Lynce and J. Marques-Silva. On computing minimum unsatisfiable cores. In International Conference on Theory and Applications of Satisfiability Testing (SAT'04), Vancouver, 2004.
17. B. Mazure, L. Saïs, and É. Grégoire. A powerful heuristic to locate inconsistent kernels in knowledgebased systems. In International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU'96), pages 12651269, Granada (Spain), 1996.
18. B. Mazure, L. Saïs, and É. Grégoire. Boosting complete techniques thanks to local search. Annals of Mathematics and Artificial Intelligence, 22:319-322, 1998.
19. Y. Oh, M. Mneimneh, Z. Andraus, K. Sakallah, and I. Markov. Amuse: a minimally-unsatisfiable subformula extractor. In Design Automation Conference (DAC'04), pages 518-523, 2004.
20. C. Papadimitriou and D. Wolfe. The complexity of facets resolved. Journal of Computer and System Sciences, 37(1):2-13, 1988.
21. SATLIB. Benchmarks on SAT. http://www.intellektik.informatik.tu- darmstadt.de/ SATLIB/benchm.html.
22. L. Zhang and S. Malik. Extracting small unsatisfiable cores from unsatisfiable Boolean formula. In International Conference on Theory and Applications of Satisfiability Testing (SAT'03), Portofino (Italy), 2003.