Year: 2006
Type: article
Abstract: In this paper, we describe and evaluate three different techniques for translating pseudo-boolean constraints (linear constraints over boolean variables) into clauses that can be handled by a standard SAT-solver. We show that by applying a proper mix
DOI: 10.3233/sat190014
Authors: Niklas Eén, Niklas Sörensson
Institution: Chalmers University of Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2116758077