Crowdsourcing backdoor identification for combinatorial optimization

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 2840-2847

  Le Bras, Ronan ^a   Bernstein, Richard ^a   Gomes, Carla P ^a   Selman, Bart ^a   Van Dover, R Bruce ^b  

^a School of Operations Research and Information Engineering   (United States)

^b Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMBINATORIAL SEARCH; COMPLEX CONSTRAINTS; CROWD SOURCING; FUEL CELL TECHNOLOGIES; HUMAN COMPUTATION; PROBLEM STRUCTURE; VISUAL IDENTIFICATION;

ARTIFICIAL INTELLIGENCE;

COMBINATORIAL OPTIMIZATION;

EID: 84896061157     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. S. Cooper, F. Khatib, A. Treuille, J. Barbero, J. Lee, M. Beenen, A. Leaver-Fay, D. Baker, Z. Popović, and Foldit Players. Predicting protein structures with a multiplayer online game. Nature, 466(7307):756-760, August 2010.
2. L. De Moura and N. Bjørner. Z3: An efficient smt solver. Tools and Algorithms for the Construction and Analysis of Systems, pages 337-340, 2008.
3. B. Dilkina, C. Gomes, Y. Malitsky, A. Sabharwal, and M. Sellmann. Backdoors to combinatorial optimization: Feasibility and optimality. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pages 56-70, 2009.
4. S. Ermon, R. Le Bras, C. P. Gomes, B. Selman, and R. B. van Dover. Smt-aided combinatorial materials discovery. In Proc. of the Conference on Theory and Applications of Satisfiability Testing, SAT'12, 2012.
5. M. Fischetti and M. Monaci. Backdoor branching. Integer Programming and Combinatoral Optimization, pages 183-191, 2011.
6. S. Gaspers and S. Szeider. Backdoors to satisfaction. The Multivariate Algorithmic Revolution and Beyond, pages 287-317, 2012.
7. C.P. Gomes, B. Selman, H. Kautz, et al. Boosting combinatorial search through randomization. In Proceedings of the National Conference on Artificial Intelligence, pages 431-437. JOHN WILEY & SONS LTD, 1998.
8. J. M. Gregoire, M. E. Tague, S. Cahen, S. Khan, H. D. Abruna, F. J. DiSalvo, and R. B. van Dover. Improved fuel cell oxidation catalysis in pt1-xtax. Chem. Mater., 22(3):1080, 2010.
9. J. Hoffmann, C. Gomes, and B. Selman. Structure and problem hardness: Goal asymmetry and dpll proofs in sat-based planning. Logical Methods in Computer Science, 3(1):6, 2007.
10. F. Khatib, S. Cooper, M.D. Tyka, K. Xu, I. Makedon, Z. Popović, D. Baker, and F. Players. Algorithm discovery by protein folding game players. Proceedings of the National Academy of Sciences, 108(47):18949-18953, 2011.
11. P. Kilby, J. Slaney, S. Thiébaux, and T. Walsh. Backbones and backdoors in satisfiability. In Proceedings of the National Conference on Artificial Intelligence, volume 20, page 1368. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 2005.
12. E. Law and L. von Ahn. Human Computation. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, 2011.
13. R. Le Bras, T. Damoulas, J. M. Gregoire, A. Sabharwal, C. Gomes, and R. B. van Dover. Constraint reasoning and kernel clustering for pattern decomposition with scaling. In CP, 2011.
14. Sarah McLennan and Mary Gainer. When the Computer Wore a Skirt: Langleys Computers, 19351970. NASA History Program Office News & Notes, 29(1):25-32, 2012.
15. Barry O'Sullivan. Backdoors to satisfaction. tutorial at cp 2010. In Proceedings of the Principles and Practice of Constraint Programming (CP), 2010.
16. Satu Elisa Schaeffer. Graph clustering. Computer Science Review, 1(1):27-64, 2007.
17. S. Szeider. Backdoor sets for dll subsolvers. SAT 2005, pages 73-88, 2006.
18. R. B. Van Dover, LF Schneemeyer, and RM Fleming. Discovery of a useful thin-film dielectric using a composition-spread approach. Nature, 392(6672):162-164, 1998.
19. R. Williams, C. Gomes, and B. Selman. On the connections between backdoors, restarts, and heavytailedness in combinatorial search. structure, 23:4, 2003.
20. R. Williams, C.P. Gomes, and B. Selman. Backdoors to typical case complexity. In International Joint Conference on Artificial Intelligence, volume 18, pages 1173-1178. Citeseer, 2003.