Big Data in SAT Solving - Learn Heuristics from Proofs

Theses

• Suggested Thesis Topics
• Completed Theses
  • Algebra und Diskrete Strukturen
  • Algebraische und logische Grundlagen der Informatik
  • Automatentheorie
  • Computational Logic
  • Knowledge-aware Artificial Intelligence
  • Logische Programmierung und Argumentation
  • Wissensbasierte Systeme
• Currently Ongoing Theses

Toggle side column

Big Data in SAT Solving - Learn Heuristics from Proofs

Topic no longer available

•   Supervisor Norbert Manthey
•   Wissensverarbeitung
•   Start

During search SAT Solvers generate a lot of data, which is usually not used to drive the solvers heuristics. Using this data - in this thesis the unsatisfiability proof - might improve lead to a more efficient search process.

In this project the heuristics of a SAT solver should be improved by looking at data that is present in unsatisfiability proofs.