Splatz, Lingeling, Plingeling, Treengeling, YalSAT Entering the SAT Competition 2016

Armin Biere

Research output: Chapter in Book/Report/Conference proceedingConference proceedings

Abstract

This paper serves as solver description for our new SAT solver Splatz and further documents the versions of our other solvers submitted to the SAT Competition 2016, which are Lingeling, its two parallel variants Treengeling and Plingeling, and our local search solver YalSAT.
Original languageEnglish
Title of host publicationProceedings of SAT Competition 2016 - Solver and Benchmark Descriptions
Editors Tomas Balyo, Marijn Heule und Matti Järvisalo
PublisherUniversity of Helsinki
Pages44-45
Number of pages2
VolumeB-2016-1
Publication statusPublished - 2016

Publication series

NameDepartment of Computer Science Series of Publications B

Fields of science

  • 102 Computer Sciences
  • 102001 Artificial intelligence
  • 102011 Formal languages
  • 102022 Software development
  • 102031 Theoretical computer science
  • 603109 Logic
  • 202006 Computer hardware

JKU Focus areas

  • Computation in Informatics and Mathematics

Cite this