scientific article
From MaRDI portal
Publication:3639756
zbMath1193.68227MaRDI QIDQ3639756
Lakhdar Saïs, Youssef Hamadi, Saïd Jabbour
Publication date: 26 October 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A collaborative approach for multi-threaded SAT solving, What we can learn from conflicts in propositional satisfiability, Laissez-Faire Caching for Parallel #SAT Solving, HordeSat: A Massively Parallel Portfolio SAT Solver, Propositional SAT Solving, SAT race 2015, A review of literature on parallel constraint solving, Symmetry in Gardens of Eden, Towards better heuristics for solving bounded model checking problems, Diversifying a parallel SAT solver with Bayesian moment matching, Learning from conflicts in propositional satisfiability, An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic, An overview of parallel SAT solving, DPLL: The Core of Modern Satisfiability Solvers, ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH, ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM, DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions, Finding Effective SAT Partitionings Via Black-Box Optimization, Automatic construction of parallel portfolios via algorithm configuration, Parallelizing SMT solving: lazy decomposition and conciliation, Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges, ManySAT, Cooperative parallel SAT local search with path relinking, SAT competition 2020, Large-scale parallelism for constraint-based local search: the costas array case study, Leveraging GPUs for effective clause sharing in parallel SAT solving, Scalable SAT solving in the cloud
