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 firstorder 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 th...
This paper describes the integration of zChaff and MiniSat, currently two leading SAT solvers, with ...
Modern saturation-based Automated Theorem Provers typically implement the superposition calculus for...
Abstract In this paper, we present a SAT solver based on the combination of DPLL (Davis Putnam Logem...
In this paper we give a short introduction in first-order theorem provingand the use of the theorem ...
Many applications of formal methods require automated reasoning about system properties, such as sys...
This paper describes the integration of a leading SAT solver with Isabelle/HOL, a popular interactiv...
In the area of formal verification it is well known that there can be no single logic that suits all...
In this talk, we will present the basic principles of SAT solvers, by focusing on the essential ingr...
This paper presents new features recently implemented in the theorem prover Vampire, namely support ...
In the past few years, general-purpose propositional satisfiability (SAT) solvers have improved dram...
This paper attempts to address the question of how best to assure the correctness of saturation-base...
Satisfiability solving, the problem of deciding whether the variables of a propositional formula can...
Abstract. We present a method for proving rigid first order theorems by encoding them as proposition...
Proving logic formulas is a problem of immense importance both theoretically and practically. On the...
This report documents the program and the outcomes of Dagstuhl Seminar 15171 "Theory and Practice of...
This paper describes the integration of zChaff and MiniSat, currently two leading SAT solvers, with ...
Modern saturation-based Automated Theorem Provers typically implement the superposition calculus for...
Abstract In this paper, we present a SAT solver based on the combination of DPLL (Davis Putnam Logem...
In this paper we give a short introduction in first-order theorem provingand the use of the theorem ...
Many applications of formal methods require automated reasoning about system properties, such as sys...
This paper describes the integration of a leading SAT solver with Isabelle/HOL, a popular interactiv...
In the area of formal verification it is well known that there can be no single logic that suits all...
In this talk, we will present the basic principles of SAT solvers, by focusing on the essential ingr...
This paper presents new features recently implemented in the theorem prover Vampire, namely support ...
In the past few years, general-purpose propositional satisfiability (SAT) solvers have improved dram...
This paper attempts to address the question of how best to assure the correctness of saturation-base...
Satisfiability solving, the problem of deciding whether the variables of a propositional formula can...
Abstract. We present a method for proving rigid first order theorems by encoding them as proposition...
Proving logic formulas is a problem of immense importance both theoretically and practically. On the...
This report documents the program and the outcomes of Dagstuhl Seminar 15171 "Theory and Practice of...
This paper describes the integration of zChaff and MiniSat, currently two leading SAT solvers, with ...
Modern saturation-based Automated Theorem Provers typically implement the superposition calculus for...
Abstract In this paper, we present a SAT solver based on the combination of DPLL (Davis Putnam Logem...