Solving SAT in a distributed cloud: a portfolio approach

DOI10.2478/amcs-2019-0019zbMath1430.68293OpenAlexW2958957089WikidataQ127547527 ScholiaQ127547527MaRDI QIDQ2299084

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

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)

Related Items (1)

Scalable SAT solving in the cloud

Uses Software

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

Cites Work

• An overview of parallel SAT solving
• PSATO: A distributed propositional prover and its application to quasigroup problems
• The state of SAT
• Theory and Applications of Satisfiability Testing
• Unnamed Item
• Unnamed Item

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