Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems

Journal of Combinatorial Optimization

Volumn 18, Issue 2, 2009, Pages 124-150

  Desrosiers, Christian ^a   Galinier, Philippe ^a   Hertz, Alain ^a   Paroz, Sandrine ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Heuristics; Minimal unsatisfiable subformulas (MUS); Satisfiability

Indexed keywords

CARDINALITIES; COMPUTATIONAL EXPERIMENT; EFFICIENT ALGORITHM; MINIMALITY; ORIGINAL ALGORITHMS; PROPOSITIONAL FORMULAS; SATISFIABILITY; SATISFIABILITY PROBLEMS; SUBFORMULAS;

ALGORITHMS; HEURISTIC METHODS;

COMPUTATIONAL EFFICIENCY;

EID: 72449187584     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-008-9142-4     Document Type: Article

References (34)

1. Amaldi E, Pfetsch ME, Trotter LEJ (1999) Some structural and algorithmic properties of the maximum feasible subsystem problem. In: Proceedings of the 7th international IPCO conference on integer programming and combinatorial optimization, June 1999, pp 45-59
2. Bailey J, Stuckey PJ (2005) Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Proceedings of the 7th international symposium on practical aspects of declarative languages (PADL05). Lecture notes in computer science, vol 3350. Springer, Berlin, pp 174-186
3. Battiti R, Protasi M (1998) Approximate algorithms and heuristics for MAX-SAT. In: Ding-zhu D (ed) Handbook of combinatorial optimization, vol 1. Kluwer Academic, Boston
4. B Borchers J Furman 1999 A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems J Comb Optim 2 299 306 0954.90026 10.1023/A: 1009725216438 1669319
5. R Bruni 2003 Approximating minimal unsatisfiable subformulae by means of adaptive core search Discrete Appl Math 130 2 85 100 1029.68075 10.1016/S0166-218X(02)00399-2 2014652
6. JW Chinneck 1997 Finding a useful subset of constraints for analysis in an infeasible linear program INFORMS J Comput 9 2 164 174 0885.90077 10.1287/ijoc.9.2.164 1477312
7. Culberson J (2004) http://web.cs.ualberta.ca/~joe/Coloring/index.html
8. n algorithm for k-SAT based on local search Theor Comput Sci 289 1 69 83 1061.68071 10.1016/S0304-3975(01)00174-8
9. M Davis G Logemann D Loveland 1962 A machine program for theorem-proving Commun ACM 5 7 394 397 0217.54002 10.1145/368273.368557 149690
10. C Desrosiers P Galinier A Hertz 2008 Efficient algorithms for finding critical subgraphs Discrete Appl Math 156 2 244 266 1130.05055 10.1016/j.dam.2006.07.019 2378680 (Pubitemid 350253157)
11. Dimacs ftp site (1993) ftp://dimacs.rutgers.edu/pub/challenge/sat/ benchmarks/cnf
12. H Fleischner O Kullmann S Szeider 2002 Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference Theor Comput Sci 289 1 503 516 1061.68072 10.1016/S0304-3975(01)00337-1 1932909
13. Franco J, Gu J, Purdom PW, Wah BW (1997) Satisfiability problem: theory and applications. In DIMACS series in discrete mathematics and theoretical computer science, pp 19-152
14. P Galinier A Hertz 2007 Solution techniques for the large set covering problem Discrete Appl Math 155 312 326 1147.68091 10.1016/j.dam.2006.04.043 2303155 (Pubitemid 44779846)
15. J Gleeson J Ryan 1990 Identifying minimally infeasible subsystems of inequalities ORSA J Comput 2 1 61 63 0752.90050
16. Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Boston
17. Goldberg E, Novikov Y (2000) Berkmin: a fast and robust SAT-solver. In: Design, automation, and test in Europe '02, March 2000, pp 142-149
18. P Hansen B Jaumard 1990 Algorithms for the maximum satisfiability problem Computing 44 4 279 303 0716.68077 10.1007/BF02241270 1063769
19. F Herrmann A Hertz 2002 Finding the chromatic number by means of critical graphs ACM J Exp Algorithmics 7 10 1 9 1973655
20. Huang J (2005) Mup: a minimal unsatisfiability prover. In: Proceedings of the tenth Asia and South Pacific design automation conference (ASP-DAC-05), pp. 432-437
21. H Kleine Büning X Zhao 2002 Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency Inf Process Lett 84 3 147 151 1042.68105 10.1016/S0020-0190(02)00267-3 (Pubitemid 35018947)
22. Levesque H, Mitchell D, Selman B (1992) GSAT-a new method for solving hard satisfiability problems. In: Proceedings of the 10th national conference on artificial Intelligence (AAAI-92), pp 440-446
23. Liffiton MH, Sakallah KA (2005) On finding all minimally unsatisfiable subformulas. In: Proceedings of the 8th international conference on theory and applications of satisfiability testing (SAT-2005). Lecture notes in computer science, vol 3569. Springer, Berlin, pp 173-186
24. Madigan CF, Malik S, Moskewicz MW, Zhang L, Zhao Y (2001) Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th conference on design automation, June 2001, pp 530-535
25. JP Marques Silva KA Sakallah 1999 GRASP: a search algorithm for propositional satisfiability IEEE Trans Comput 48 5 506 521 10.1109/12.769433 1691843
26. Mazure B, Saïs L, Grégoire E (1997) Tabu search for SAT. In: Proceedings of the 14th national conference on artificial intelligence (AAAI-97), pp 281-285
27. B Mazure L Saïs E Grégoire 1998 Boosting complete techniques thanks to local search methods Ann Math Artif Intell 22 3-4 319 331 0905.68143 10.1023/A:1018999721141 (Pubitemid 128696757)
28. P Mills E Tsang 2000 Guided local search for solving SAT and weighted MAX-SAT problems J Autom Reas 24 1 205 223 0967.68152 10.1023/A:1006343127545 1750263
29. Mneimneh M, Lynce I, Andraus Z, Marques-Silva J, Sakallah K (2005) A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas. In: Proceedings of international conference on theory and applications of satisfiability testing, vol 3569, pp 467-474
30. Oh Y, Mneimneh MN, Andraus ZS, Sakallah KA, Markov IL (2004) AMUSE: a minimally-unsatisfiable subformula extractor. In: Proceedings of the 41st annual conference on design automation. ACM, New York, pp 518-523
31. Sat benchmarks from automotive product configuration (2003) http://www-sr.informatik.uni-tuebingen.de/~sinz/DC/
32. Shang Y, Wah BW (1997) Discrete Lagrangian-based search for solving MAX-SAT problems. In: Proceedings of the 15th international joint conference on artificial intelligence, pp 378-383
33. Zhang H (1997) SATO: an efficient propositional prover. In: Proceedings of international conference on automated deduction (CADE-97), pp 272-275
34. Zhang L, Malik S (2003) Extracting small unsatisfiable cores from unsatisfiable boolean formulas. In: Sixth international conference on theory and applications of satisfiability testing (SAT2003), May 2003, pp 518-523