Solving SAT in a distributed cloud: a portfolio approach

DOI10.2478/AMCS-2019-0019zbMATH Open1430.68293OpenAlexW2958957089WikidataQ127547527 ScholiaQ127547527MaRDI QIDQ2299084FDOQ2299084

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)

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

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

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)

Cites Work

• 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
• Title not available (Why is that?)
• An overview of parallel SAT solving

Cited In (4)

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

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)