Automatic construction of parallel portfolios via algorithm configuration

DOI10.1016/J.ARTINT.2016.05.004MaRDI QIDQ511786zbMATH OpenOpenAlexWikidataFDO

Authors Holger H. Hoos, Torsten Schaub, Marius Lindauer, Kevin Leyton-Brown

Publication date 22 February 2017

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1887/58569

zbMATH Keywords

algorithm configurationalgorithm portfoliosautomated parallelizationparallel SAT solvingprogramming by optimization

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) General topics in the theory of algorithms (68W01)

Recommendations

• ManySAT: a parallel SAT solver
• Learning parallel portfolios of algorithms
• HordeSat: a massively parallel portfolio SAT solver
• SATzilla: portfolio-based algorithm selection for SAT
• scientific article; zbMATH DE number 5510692

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 6261538 (Why is no real title available?)
• Algorithm portfolios
• Captain Jack: new variable selection heuristics in local search for SAT
• Contrasat -- a contrarian SAT solver
• HordeSat: a massively parallel portfolio SAT solver
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Learning dynamic algorithm portfolios
• Learning parallel portfolios of algorithms
• ManySAT: a parallel SAT solver
• Multi-threaded ASP solving with clasp
• Paramils: an automatic algorithm configuration framework
• Principles and practice of constraint programming. 18th international conference, CP 2012, Québec City, QC, Canada, October 8--12, 2012. Proceedings
• SATenstein: automatically building local search SAT solvers from components
• SATzilla: portfolio-based algorithm selection for SAT
• Stochastic local search. Foundations and applications.
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and applications of satisfiability testing -- SAT 2012. 15th international conference, Trento, Italy, June 17--20, 2012. Proceedings

Cited in

(8)

• How we designed winning algorithms for abstract argumentation and which insight we attained
• HordeSat: a massively parallel portfolio SAT solver
• The algorithm selection competitions 2015 and 2017
• Paracoherent answer set computation
• A review of literature on parallel constraint solving
• Automatic construction of optimal static sequential portfolios for AI planning and beyond
• Learning parallel portfolios of algorithms
• ManySAT: a parallel SAT solver

Describes a project that uses

Uses Software

• AClib
• Lingeling
• aspeed
• SMAC
• Auto-WEKA
• satUZK
• HordeSat
• SATenstein
• Treengeling
• pfolioUZK
• ppfolio
• irace
• Glucose
• PrecoSAT
• clasp
• Plingeling
• Chaff
• SATzilla
• Paramils
• MiniSat
• March_eq
• ManySAT

This page was built for publication: Automatic construction of parallel portfolios via algorithm configuration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511786)