Algorithms for maximum satisfiability using unsatisfiable cores

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2008, Pages 408-413

  Marques Silva, Joao ^a   Planes, Jordi ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; BENCHMARKING; BOOLEAN ALGEBRA; COMPUTER AIDED DESIGN; COMPUTER AIDED SOFTWARE ENGINEERING; ELECTRONICS ENGINEERING; EMBEDDED SYSTEMS; INDUSTRIAL ENGINEERING; OPTIMIZATION; TESTING;

BOOLEAN SATISFIABILITY; ELECTRONIC-DESIGN AUTOMATION; INDUSTRIAL SETTINGS; MAXIMUM SATISFIABILITY; MAXIMUM SATISFIABILITY PROBLEM; NEW ALGORITHM; NOVEL ALGORITHMS; OPTIMIZ ATION PROBLEMS; ORDERS-OF-MAGNITUDE; PSEUDO-BOOLEAN OPTIMIZATION; QUANTIFIED BOOLEAN FORMULAE; SAT SOLVERS; STATE OF THE ARTS; SUBFORMULAS;

BOOLEAN FUNCTIONS;

EID: 49749083804     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2008.4484715     Document Type: Conference Paper

References (27)

1. J. Argelich, C. M. Li, F. Manyà, and J. Planes. MaxSAT evaluation. http://www.maxsat07.udl.es/.
2. D. L. Berre, L. Simon, and O. Roussel. Sat competition. http://www.satcompetition.org/.
3. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems, pages 193-207, March 1999.
4. M. L. Bonet, J. Levy, and F. Manyà. Resolution for Max-SAT. Artificial Intelligence, 171(8-9):606-618, 2007.
5. L. Bordeaux, Y. Hamadi, and L. Zhang. Propositional satisfiability and constraint programming: A comparative survey. ACM Comput. Surv., 38(4), 2006.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394-397, July 1962.
7. M. G. de la Banda, P. J. Stuckey, and J. Wazny. Finding all minimal unsatisfiable sub-sets. In International Conference on Principles and Practice of Declarative Programming, 2003.
8. N. Dershowitz, Z. Hanna, and J. Katz. Bounded model checking with QBF. In International Conference on Theory and Applications of Satisfiability Testing, pages 408-414, 2005.
9. N. Een and N. Sörensson. An extensible SAT solver. In International Conference on Theory and Applications of Satisfiability Testing, pages 502-518, May 2003.
10. N. Een and N. Sörensson. Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2:1-26, March 2006.
11. Z. Fu and S. Malik. On solving the partial MAX-SAT problem. In International Conference on Theory and Applications of Satisfiability Testing, pages 252-265, 2006.
12. F. Heras, J. Larrosa, and A. Oliveras. MiniMaxSat: a new weighted Max-SAT solver. In International Conference on Theory and Applications of Satisfiability Testing, pages 41-55, 2007.
13. H. Hoos and T. Stützle. Sat lib. http://www.satlib.org/.
14. A. Kuehlmann, V. Paruthi, F. Krohm, and M. K. Ganai. Robust boolean reasoning for equivalence checking and functional property verification. IEEE Trans. on CAD of Integrated Circuits and Systems, 21(12):1377-1394, 2002.
15. O. Kullmann. Investigations on autark assignments. Discrete Applied Mathematics, 107(1-3):99-137, 2000.
16. O. Kullmann. Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. Discrete Applied Mathematics, 130(2):209-249, 2003.
17. C. M. Li, F. Manyà, and J. Planes. Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In National Conference on Artificial Intelligence, 2006.
18. C. M. Li, F. Manyà, and J. Planes. New inference rules for Max-SAT. Journal of Artificial Intelligence Research, 2007. In press.
19. M. H. Liffiton and K. A. Sakallah. On finding all minimally unsatisfiable subformulas. In International Conference on Theory and Applications of Satisfiability Testing, pages 173-186, June 2005.
20. C. Liu, A. Kuehlmann, and M. W. Moskewicz. Cama: A multi-valued satisfiability solver. In International Conference on Computer-Aided Design, pages 326-333, 2003.
21. H. Mangassarian, A. G. Veneris, S. Safarpour, F. N. Najm, and M. S. Abadir. Maximum circuit activity estimation using pseudo-boolean satisfiability. In Design, Automation and Testing in Europe Conference, pages 1538-1543, 2007.
22. J. Marques-Silva and J. Planes. On using unsatisfiability for solving maximum satisfiability. Computing Research Repository, abs/0712.0097, December 2007.
23. K. L. McMillan. Interpolation and SAT-based model checking. In Computer-Aided Verification, 2003.
24. S. Safarpour, H. Mangassarian, A. Veneris, M. H. Liffiton, and K. A. Sakallah. Improved design debugging using maximum satisfiability. In Formal Methods in Computer-Aided Design, November 2007.
25. A. Smith, A. G. Veneris, M. F. Ali, and A. Viglas. Fault diagnosis and logic debugging using boolean satisfiability. IEEE Trans. on CAD of Integrated Circuits and Systems, 24(10):1606-1621, 2005.
26. K.-H. Wang and C.-M. Chan. Incremental learning approach and SAT model for boolean matching with don't cares. In International Conference on Computer-Aided Design, November 2007.
27. L. Zhang and S. Malik. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In Design, Automation and Testing in Europe Conference, March 2003.