Experimenting with SAT Solvers in Vampire

Armin Biere, Ioan Dragan, Laura Kovacs, Andrei Voronkov

Research output: Chapter in Book/Report/Conference proceedingConference proceedingspeer-review

Abstract

Recently, a new reasoning framework, called AVATAR, integrating first-order theorem proving with SAT solving has been proposed. In this paper, we experimentally analyze the behavior of various SAT solvers within first-order proving. For doing so, we first integrate the Lingeling SAT solver within the first-order theorem prover Vampire and compare the behavior of such an integration with Vampire using a less efficient SAT solver. Interestingly, our experiments on first-order problems show that using the best SAT solvers within AVATAR does not always give best performance. There are some problems that could be solved only by using a less efficient SAT solver than Lingeling. However, the integration of Lingeling with Vampire turned out to be the best when it came to solving most of the hard problems.
Original languageEnglish
Title of host publicationProc. 13th Mexican Intl. Conf. on Artificial Intelligence
PublisherSpringer
Pages431-442
Number of pages12
Volume8856
DOIs
Publication statusPublished - 2014

Publication series

NameLecture Notes in Computer Science (LNCS)

Fields of science

  • 102 Computer Sciences
  • 603109 Logic
  • 202006 Computer hardware

JKU Focus areas

  • Computation in Informatics and Mathematics

Cite this