Extracting MUSes

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 387-391

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

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

'CURRENT; MINIMALLY UNSATISFIABLE SUBFORMULAS; SAT INSTANCES;

EID: 84886072385     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (23)

1. F. Boussemart, F. Hémery, C. Lecoutre, and L. Säi{dotless}s, 'Boosting systematic search by weighting constraints', in European Conference on Artificial Intelligence (ECAI'04), pp. 146-150, (2004).
2. L. Brisoux, É. Grégoire, and L. Säi{dotless}s, 'Checking depth-limited consistency and inconsistency in knowledge-based systems', International Journal of Intelligent Systems, 16(3), 333-360, (2001).
3. R. Bruni, 'Approximating minimal unsatisfiable subformulae by means of adaptive core search', Discrete Applied Mathematics, 130(2), 85-100, (2003).
4. R. Bruni, 'On exact selection of minimally unsatisfiable subformulae', Annals of Mathematics and Artificial Intelligence, 43(1), 35-50, (2005).
5. H.K. Büning, 'On subclasses of minimal unsatisfiable formulas', Discrete Applied Mathematics, 107(1-3), 83-98, (2000).
6. M. Davis, G. Logemann, and D. Loveland, 'A machine program for theorem proving', Journal of the Association for Computing Machinery, 5(7), 394-397, (1962).
7. G. Davydov, I. Davydova, and H.K. 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).
10. 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).
11. É. Grégoire and D. Ansart, 'Overcoming the christmas tree syndrome', International Journal on Artificial Intelligence Tools (IJAIT), 9(2), 97-111, (2000).
12. É. Grégoire, B. Mazure, and L. Säi{dotless}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), LNCS 2443, pp. 51-60, (2002).
13. Readings in Model-Based Diagnosis, eds., Console L. Hamscher W. and de Kleer J., Morgan Kaufmann Publishers Inc, 1992.
14. J. Huang, 'Mup: A minimal unsatisfiability prover', in Asia and South Pacific Design Automation Conference (ASP-DAC'05), pp. 432-437, (2005).
15. 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), (2004).
16. M.H. Liffiton and K.A. Sakallah, 'On finding all minimally unsatisfiable subformulas', in International Conference on Theory and Applications of Satisfiability Testing (SAT'05), pp. 173-186, (2005).
17. I. Lynce and J. Marques-Silva, 'On computing minimum unsatisfiable cores', in International Conference on Theory and Applications of Satisfiability Testing (SAT'04), (2004).
18. B. Mazure, L. Säi{dotless}s, and É. Grégoire, 'A powerful heuristic to locate inconsistent kernels in knowledge-based systems', in International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU'96), pp. 1265-1269, (1996).
19. B. Mazure, L. Säi{dotless}s, and É. Grégoire, 'Boosting complete techniques thanks to local search', Annals of Mathematics and Artificial Intelligence, 22, 319-331, (1998).
20. Y. Oh, M.N. Mneimneh, Z.S. Andraus, K.A. Sakallah, and I.L. Markov, 'Amuse: a minimally-unsatisfiable subformula extractor', in Design Automation Confrence (DAC'04), pp. 518-523, (2004).
21. C.H. Papadimitriou and D. Wolfe, 'The complexity of facets resolved', Journal of Computer and System Sciences, 37(1), 2-13, (1988).
22. SATLIB. Benchmarks on SAT. http://www.intellektik.informatik.tudarmstadt. de/SATLIB/benchm.html.
23. 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), (2003).