PBLib -- A Library for Encoding Pseudo-Boolean Constraints into CNF

PBLib is an easy-to-use and efficient library, written in C++, for translating pseudo-Boolean (PB) constraints into CNF. We have implemented fifteen different encodings of PB constraints. Our aim is to use efficient encodings, in terms of formula size and whether unit propagation maintains generaliz...

Full description

Saved in:
Bibliographic Details
Published inTheory and Applications of Satisfiability Testing -- SAT 2015 Vol. 9340; pp. 9 - 16
Main Authors Philipp, Tobias, Steinke, Peter
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2015
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Artificial intelligence
Cardinality Constraint
Computer science
Conjunctive Normal Form
Conjunctive Normal Form Formula
Constraint Programming
Mathematical theory of computation
Unit Propagation
Online AccessGet full text
ISBN3319243179
9783319243177
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-24318-4_2

Cover

More Information
Summary:PBLib is an easy-to-use and efficient library, written in C++, for translating pseudo-Boolean (PB) constraints into CNF. We have implemented fifteen different encodings of PB constraints. Our aim is to use efficient encodings, in terms of formula size and whether unit propagation maintains generalized arc consistency. Moreover, PBLib normalizes PB constraints and automatically uses a suitable encoder for the translation. We also support incremental strengthening for optimization problems, where the tighter bound is realized with few additional clauses, as well as conditions for PB constraints.
ISBN:3319243179
9783319243177
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-24318-4_2