A MAX-SAT algorithm portfolio

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 911-912

  Matos, Paulo ^b   Planes, Jordi ^b   Letombe, Florian ^b   Marques Silva, João ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING;

ALGORITHM FOR SOLVING; ALGORITHM PORTFOLIOS; FAST SOLVERS; PERFORMANCE;

COMPUTATIONAL METHODS;

EID: 84908205143     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-911     Document Type: Conference Paper

References (14)

1. Lucas Bordeaux, Youssef Hamadi, and Lintao Zhang, ‘Propositional satisfiability and constraint programming: A comparative survey’, ACM Computing Surveys, 38(4), (2006). Electronic Edition, 54 pages.
2. Niklas Een and Niklas Sörensson, ‘Translating pseudo-boolean constraints into SAT’, Journal on Satisfiability, Boolean Modeling and Computation, 2, 1–26, (2006).
3. Carla P. Gomes and Bart Selman, ‘Algorithm portfolios’, Artificial Intelligence, 126(1-2), 43–62, (2001).
4. Kevin Keyton-Brown, Eugene Nudelman, Galen Andrew, Jim McFadden, and Yoav Shoham, ‘A portfolio approach to algorithm selection’, in International Joint Conference on Artificial Intelligence - IJCAI’03, pp. 1542–1543, (2003).
5. Javier Larrosa, Federico Heras, and Simon de Givry, ‘A logical approach to efficient max-SAT solving’, Artificial Intelligence, 172(2–3), 204–233, (2008).
6. Kevin Leyton-Brown, Eugene Nudelman, and Yoah Shoham, ‘Learning the empirical hardness of optimization problems’, in Principles and Practice of Constraint Programming CP’02, volume 2470 of LNCS, pp. 556–572, (2002).
7. Chu Min Li, Felip Manya, and Jordi Planes, ‘New inference rules for max-SAT’, Journal of Artificial Intelligence Research, 30, 321–359, (2007).
8. Lionel Lobjois and Michel Lemaître, ‘Branch and bound algorithm selection by performance prediction’, in National Conference on Artificial Intelligence - AAAI’98, pp. 353–358, (1998).
9. Donald W. Marquardt and Ronald D. Snee, ‘Ridge regression in practice’, The American Statistician, 29(1), 3–20, (1975).
10. Joao Marques-Silva and Jordi Planes, ‘Algorithms for maximum satisfiability using unsatisfiable cores’, in Design, Automation and Test in Europe - DATE’08, (2008).
11. Eugene Nudelman, Alex Devkar, Yoav Shoham, and Kevin Leyton-Brown, ‘Understanding random SAT: Beyond the clauses-to-variables ratio’, in Principles and Practice of Constraint Programming CP’04, volume 3258 of LNCS, pp. 438–452, (2004).
12. Sean Safarpour, Hratch Mangassarian, Andreas Veneris, Mark H. Liffi-ton, and Karem A. Sakallah, ‘Improved design debugging using maximum satisfiability’, in Formal Methods in Computer Aided Design - FMCAD’07, pp. 13–19, (2007).
13. Hui Xu, R. A. Rutenbar, and Karem A. Sakallah, ‘sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing’, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 22(6), 814–820, (2003).
14. Lin Xu, Frank Hutter, Holger Hoos, and Kevin Leyton-Brown, ‘SATzilla-07: The design and analysis of an algorithm portfolio for SAT’, in Principles and Practice of Constraint Programming CP’07, volume 4741 of LNCS, pp. 712–727, (2007).