Minimal unsatisfiability: Models, algorithms & applications

Proceedings of The International Symposium on Multiple-Valued Logic

Volumn , Issue , 2010, Pages 9-14

  Marques Silva, Joao ^a  

^a UNIVERSITY COLLEGE DUBLIN   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN LOGIC; COMPUTATIONAL PROBLEM; DESCRIPTION LOGIC; KNOWLEDGE BASIS; OVER-CONSTRAINED; REAL-WORLD PROBLEM;

DATA DESCRIPTION; FORMAL METHODS; MANY VALUED LOGICS;

PROBLEM SOLVING;

EID: 77955323213     PISSN: 0195623X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISMVL.2010.11     Document Type: Conference Paper

References (55)

1. E. Amaldi, M. E. Pfetsch, and L. E. Trotter Jr., "On the maximum feasible subsystem problem, IISs and IIS-hypergraphs," Math. Program., vol. 95, no. 3, pp. 533-554, 2003.
2. Z. S. Andraus, M. H. Liffiton, and K. A. Sakallah, "Reveal: A formal verification tool for verilog designs," in Logic for Programming, Artificial Intelligence, and Reasoning, 2008, pp. 343-352.
3. C. Ansótegui, M. L. Bonet, and J. Levy, "Solving (weighted) partial MaxSAT through satisfiability testing," in Theory and Applications of Satisfiability Testing, July 2009, pp. 427-440.
4. M. K. Atlihan and L. Schrage, "Generalized filtering algorithms for infeasibility analysis," Computers & OR, vol. 35, no. 5, pp. 1446-1464, 2008.
5. F. Baader and R. Penaloza, "Axiom pinpointing in general tableaux," J. Log. Comput., vol. 20, no. 1, pp. 5-34, 2010.
6. J. Bailey and P. J. Stuckey, "Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization," in Practical Aspects of Declarative Languages, 2005, pp. 174-186.
7. R. R. Bakker, F. Dikker, F. Tempelman, and P. M. Wognum, "Diagnosing and solving over-determined constraint satisfaction problems," in International Joint Conference on Artificial Intelligence, 1993, pp. 276-281.
8. R. Bruni, "Approximating minimal unsatisfiable subformulae by means of adaptive core search," Discrete Applied Mathematics, vol. 130, no. 2, pp. 85-100, 2003.
9. -, "On exact selection of minimally unsatisfiable subformulae," Ann. Math. Artif. Intell., vol. 43, no. 1, pp. 35-50, 2005.
10. R. Bruni and A. Sassano, "Errors detection and correction in large scale data collecting," in Advances in Intelligent Data Analysis, 2001, pp. 84-94.
11. H. K. Büning and O. Kullmann, "Minimal unsatisfiability and autarkies," in Handbook of Satisfiability. IOS Press, 2009, pp. 339-401.
12. H. Cambazard and B. O'Sullivan, "Reformulating table constraints using functional dependencies - an application to explanation generation," Constraints, vol. 13, no. 3, pp. 385-406, 2008.
13. J. W. Chinneck, "Finding a useful subset of constraints for analysis in an infeasible linear program," INFORMS Journal on Computing, vol. 9, no. 2, pp. 164-174, 1997.
14. J. W. Chinneck and E. W. Dravnieks, "Locating minimal infeasible constraint sets in linear programs," INFORMS Journal on Computing, vol. 3, no. 2, pp. 157-168, 1991.
15. A. Cimatti, A. Griggio, and R. Sebastiani, "A simple and flexible way of computing small unsatisfiable cores in SAT modulo theories," in Theory and Applications of Satisfiability Testing, 2007, pp. 334-339.
16. J. L. de Siqueira N. and J.-F. Puget, "Explanation-based generalisation of failures," in European Conference on Artificial Intelligence, 1988, pp. 339-344.
17. N. Dershowitz, Z. Hanna, and A. Nadel, "A scalable algorithm for minimal unsatisfiable core extraction," in Theory and Applications of Satisfiability Testing, 2006, pp. 36-41.
18. C. Desrosiers, P. Galinier, A. Hertz, and S. Paroz, "Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems," J. Comb. Optim., vol. 18, no. 2, pp. 124-150, 2009.
19. Z. Fu and S. Malik, "On solving the partial MAX-SAT problem," in Theory and Applications of Satisfiability Testing, August 2006, pp. 252-265.
20. P. Galinier and A. Hertz, "Solution techniques for the large set covering problem," Discrete Applied Mathematics, vol. 155, no. 3, pp. 312-326, 2007.
21. M. Gebser, T. Schaub, S. Thiele, B. Usadel, and P. Veber, "Detecting inconsistencies in large biological networks with answer set programming," in International Conference Logic Programming, 2008, pp. 130-144.
22. J. Gleeson and J. Ryan, "Identifying minimally infeasible subsystems of inequalities," INFORMS Journal on Computing, vol. 2, no. 1, pp. 61-63, 1990.
23. C. P. Gomes, H. Kautz, A. Sabharwal, and B. Selman, "Satisfiability solvers," in Handbook of Knowledge Representation. Elsevier, 2008, pp. 89-134.
24. H. J. Greenberg and F. H. Murphy, "Approaches to diagnosing infeasible linear programs," INFORMS Journal on Computing, vol. 3, no. 3, pp. 253-261, 1991.
25. É. Grégoire, B. Mazure, and C. Piette, "Extracting MUSes," in European Conference on Artificial Intelligence, August 2006, pp. 387-391.
26. -, "Local-search extraction of MUSes," Constraints, vol. 12, no. 3, pp. 325-344, 2007.
27. -, "On approaches to explaining infeasibility of sets of Boolean clauses," in International Conference on Tools with Artificial Intelligence, November 2008, pp. 74-83.
28. -, "Does this set of clauses overlap with at least one MUS?" in Automated Deduction, 2009, pp. 100-115.
29. O. Guieu and J. W. Chinneck, "Analyzing infeasible mixed-integer and integer linear programs," INFORMS Journal on Computing, vol. 11, no. 1, pp. 63-77, 1999.
30. F. Hemery, C. Lecoutre, L. Sais, and F. Boussemart, "Extracting MUCs from constraint networks," in European Conference on Artificial Intelligence, 2006, pp. 113-117.
31. J. Huang, "MUP: a minimal unsatisfiability prover," in Asia South Pacific Design Automation, 2005, pp. 432-437.
32. U. Junker, "QUICKXPLAIN: Preferred explanations and relaxations for over-constrained problems," in AAAI Conference on Artificial Intelligence, 2004, pp. 167-172.
33. R.-R. Lee, J.-H. R. Jiang, and W.-L. Hung, "Bi-decomposing large Boolean functions via interpolation and satisfiability solving," in Design Automation Conference, 2008, pp. 636-641.
34. C. M. Li and F. Manyà, "MaxSAT, hard and soft constraints," in Handbook of Satisfiability. IOS Press, 2009, pp. 613-632.
35. M. Liffiton, M. Mneimneh, I. Lynce, Z. Andraus, J. MarquesSilva, and K. Sakallah, "Branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas," Constraints, vol. 14, 2008.
36. M. H. Liffiton and K. A. Sakallah, "Algorithms for computing minimal unsatisfiable subsets of constraints," J. Autom. Reasoning, vol. 40, no. 1, pp. 1-33, 2008.
37. H.-P. Lin, J.-H. R. Jiang, and R.-R. Lee, "To SAT or not to SAT: Ashenhurst decomposition in a large scale," in International Conference on Computer-Aided Design, 2008, pp. 32-37.
38. L. Lingappan and N. K. Jha, "Efficient design for testability solution based on unsatisfiability for register-transfer level circuits," IEEE Trans. on CAD of Integrated Circuits and Systems, vol. 26, no. 7, pp. 1339-1345, 2007.
39. I. Lynce and J. Marques-Silva, "On computing minimum unsatisfiable cores," in Theory and Applications of Satisfiability Testing, 2004.
40. V. Manquinho, J. Marques-Silva, and J. Planes, "Algorithms for weighted Boolean optimization," in Theory and Applications of Satisfiability Testing, July 2009, pp. 495-508.
41. J. Marques-Silva, I. Lynce, and S. Malik, "Conflict-driven clause learning SAT solvers," in Handbook of Satisfiability. IOS Press, 2009, pp. 131-154.
42. J. Marques-Silva and J. Planes, "Algorithms for maximum satisfiability using unsatisfiable cores," in Design, Automation and Testing in Europe Conference, March 2008, pp. 408-413.
43. K. L. McMillan, "Interpolation and SAT-based model checking," in Computer-Aided Verification, July 2003, pp. 1-13.
44. Y. Oh, M. N. Mneimneh, Z. S. Andraus, K. A. Sakallah, and I. L. Markov, "AMUSE: a minimally-unsatisfiable subformula extractor," in Design Automation Conference, 2004, pp. 518-523.
45. C. H. Papadimitriou and D. Wolfe, "The complexity of facets resolved," J. Comput. Syst. Sci., vol. 37, no. 1, pp. 2-13, 1988.
46. C. Piette, Y. Hamadi, and L. Sais, "Efficient combination of decision procedures for MUS computation," in Frontiers of Combining Systems, September 2009, pp. 335-349.
47. S. Prestwich, "CNF encodings," in Handbook of Satisfiability. IOS Press, 2009, pp. 75-98.
48. G. Rull, C. Farré, E. Teniente, and T. Urpí, "Providing explanations for database schema validation," in Database and Expert Systems Applications, 2008, pp. 660-667.
49. I. Shlyakhter, R. Seater, D. Jackson, M. Sridharan, and M. Taghdiri, "Debugging overconstrained declarative models using unsatisfiable cores," in Automated Software Engineering, 2003, pp. 94-105.
50. M. Tamiz, S. J. Mardle, and D. F. Jones, "Detecting IIS in infeasible linear programmes using techniques from goal programming," Computers & OR, vol. 23, no. 2, pp. 113-119, 1996.
51. E. Torlak, F. S.-H. Chang, and D. Jackson, "Finding minimal unsatisfiable cores of declarative specifications," in International Symposium on Formal Methods, 2008, pp. 326-341.
52. J. N. M. van Loon, "Irreducibly inconsistent systems of linear inequalities," European Journal of Operational Research, vol. 8, no. 3, pp. 283-288, November 1981.
53. H. van Maaren and S. Wieringa, "Finding guaranteed MUSes fast," in Theory and Applications of Satisfiability Testing, 2008, pp. 291-304.
54. J. Zhang, S. Li, and S. Shen, "Extracting minimum unsatisfiable cores with a greedy genetic algorithm," in Australian Conference on Artificial Intelligence, 2006, pp. 847-856.
55. L. Zhang and S. Malik, "Extracting small unsatisfiable cores from unsatisfiable boolean formula," in Theory and Applications of Satisfiability Testing, 2003.