ScholarLens Back to search
2006•Unpublished venueRequires access

Barcelogic SAT Solver: System description

Morgan Deters, Germain Faure, Robert Nieuwenhuis, Albert Oliveras

Open publisher page 0 citations

Abstract

The Barcelogic SAT Solver is an efficient implementation of the Davis-Putnam-Logemann-Loveland (DPLL) procedure [DP60, DLL62].Our original aim for developing it was the need of a DPLL-based engine forour DPLL(T) approach to Satisfiability Modulo Theories (SMT): deciding thesatisfiability of ground first-order formulas with respect to background theoriessuch as equality, linear integer or real arithmetic, arrays, etc. A DPLL(T) systemconsists of a general DPLL(X) engine, very similar in nature to a SAT solver,whose parameter X can be instantiated with a solver Solver

About this research paper

What this paper is about

The Barcelogic SAT Solver is an efficient implementation of the Davis-Putnam-Logemann-Loveland (DPLL) procedure [DP60, DLL62].Our original aim for developing it was the need of a DPLL-based engine forour DPLL(T) approach to Satisfiability Modulo Theories (SMT): deciding thesatisfiability of ground first-order formulas with respect to background theoriessuch as equality, linear integer or real arithmetic, arrays, etc. A DPLL(T) systemconsists of a general DPLL(X) engine, very similar in nature to a SAT solver,whose parameter X can be instantiated with a solver Solver

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The Barcelogic SAT Solver is an efficient implementation of the Davis-Putnam-Logemann-Loveland (DPLL) procedure [DP60, DLL62].Our original aim for developing it was the need of a DPLL-based engine forour DPLL(T) approach to Satisfiability Modulo Theories (SMT): deciding thesatisfiability of ground first-order formulas with respect to background theoriessuch as equality, linear integer or real arithmetic, arrays, etc. A DPLL(T) systemconsists of a general DPLL(X) engine, very similar in nature to a SAT solver,whose parameter X can be instantiated with a solver Solver

Key concepts: DPLL algorithm, Solver, Satisfiability modulo theories, Computer science, Mathematics, Boolean satisfiability problem, Algorithm, Programming language

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Barcelogic SAT Solver: System description — Research Paper | ScholarLens