PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
From MaRDI portal
Publication:3453205
DOI10.1007/978-3-319-24318-4_2zbMath1471.68261OpenAlexW2223094528MaRDI QIDQ3453205
Publication date: 20 November 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_2
Related Items (13)
Efficient Learning of Interpretable Classification Rules ⋮ SAT race 2015 ⋮ A SAT encoding to compute aperiodic tiling rhythmic canons ⋮ Coupling different integer encodings for SAT ⋮ Generation of synchronizing state machines from a transition system: a region-based approach ⋮ Computing generating sets of minimal size in finite algebras ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ Encoding cardinality constraints using multiway merge selection networks ⋮ PBLib ⋮ SAT competition 2020 ⋮ SAT encodings for pseudo-Boolean constraints together with at-most-one constraints ⋮ OptiLog: a framework for SAT-based systems ⋮ Efficient local search for pseudo Boolean optimization
Uses Software
Cites Work
- Pseudo-Boolean optimization
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
- A structure-preserving clause form translation
- Algorithms for computing minimal unsatisfiable subsets of constraints
- BDDs for Pseudo-Boolean Constraints – Revisited
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- New Encodings of Pseudo-Boolean Constraints into CNF
- Theory and Applications of Satisfiability Testing
- A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Unnamed Item
- Unnamed Item
This page was built for publication: PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
