Solving SAT in a distributed cloud: a portfolio approach

DOI10.2478/AMCS-2019-0019MaRDI QIDQ2299084zbMATH OpenOpenAlexWikidataFDO

Authors Yanik Ngoko, Christophe Cérin, Denis Trystram

Publication date 20 February 2020

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/amcs-2019-0019

zbMATH Keywords

schedulingalgorithm portfoliomaximum coverage problemresource provisioningparallel distributed SAT

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Distributed algorithms (68W15)

Recommendations

• Approximating the discrete resource sharing scheduling problem
• Learning parallel portfolios of algorithms
• Partitioning SAT instances for distributed solving
• SATzilla: portfolio-based algorithm selection for SAT
• HordeSat: a massively parallel portfolio SAT solver

Cites work

• scientific article; zbMATH DE number 1323125 (Why is no real title available?)
• An overview of parallel SAT solving
• PSATO: A distributed propositional prover and its application to quasigroup problems
• SATzilla: portfolio-based algorithm selection for SAT
• The state of SAT
• Theory and Applications of Satisfiability Testing

Cited in

(4)

• Partitioning SAT instances for distributed solving
• Scalable SAT solving in the cloud
• Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
• Approximating the discrete resource sharing scheduling problem

Describes a project that uses

Uses Software

• GridSAT
• PSATO
• SATO
• SATzilla
• Plingeling
• PrecoSAT
• ppfolio
• Lingeling

This page was built for publication: Solving SAT in a distributed cloud: a portfolio approach

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