Seven Challenges in Parallel SAT Solving

This article provides a broad overview of the state of the parallel SAT solving field. A set of challenges to researchers is presented that, we believe, must be met to ensure the practical applicability of parallel SAT solvers in the future. All these challenges are described informally but put into...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The AI magazine Ročník 34; číslo 2; s. 99 - 106
Hlavní autoři: Hamadi, Youssef, Wintersteiger, Christoph M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Menlo Park, CA American Association for Artificial Intelligence 22.06.2013
John Wiley & Sons, Inc
Témata:
Algorithm
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Artificial intelligence
Boolean
Cloud computing
Computer science
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Methods
Parallel processing
Parallel programming (Computer science)
Programming languages
R&D
Research & development
Software
Studies
Subjectivity
Theoretical computing
Workers
Constraint satisfaction
Distributed computing
Parallel algorithm
ISSN:0738-4602, 2371-9621
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This article provides a broad overview of the state of the parallel SAT solving field. A set of challenges to researchers is presented that, we believe, must be met to ensure the practical applicability of parallel SAT solvers in the future. All these challenges are described informally but put into perspective with related research results, and a (subjective) grading of difficulty for each of them is provided.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0738-4602
2371-9621
DOI:10.1609/aimag.v34i2.2450