The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Translating Pseudo-Boolean Constraints into SAT
Open accessAbstract
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
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,000
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
Chaff: engineering an efficient SAT solver
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001) · Proceedings of the 38th conference on Design automation - DAC '01 · doi:10.1145/378239.379017 · Cited by 2,940
Eén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
Self-citationSorting networks and their applications
Batcher, K. E. (1968) · Proceedings of the April 30--May 2, 1968, spring joint computer conference on - AFIPS '68 (Spring) · doi:10.1145/1468075.1468121 · Cited by 2,417
On the Complexity of Derivation in Propositional Calculus
Tseitin, G. S. (1983) · Springer eBooks · doi:10.1007/978-3-642-81955-1_28 · Cited by 1,211
The Omega test: a fast and practical integer programming algorithm for dependence analysis
Pugh, W. (1991) · Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91 · doi:10.1145/125826.125848 · Cited by 750
A Structure-preserving Clause Form Translation
Plaisted, D. A., & Greenbaum, S. (1986) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(86)80028-1 · Cited by 582
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Sinz, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564751_73 · Cited by 469
Cited by
Pal, S., Bhattacharya, M., Lee, S.-S., & Chakraborty, C. (2024) · Molecular Biotechnology · doi:10.1007/s12033-023-00765-4 · Cited by 103
Metadata
- Authors
- Eén, N., & Sörensson, N.
- Venue
- Journal on Satisfiability, Boolean Modeling and Computation
- Publisher
- SAGE Publications
- Published
- 2006-03-01
- Volume
- 2
- Issue
- 1-4
- Pages
- 1-26
- ISSN
- 1574-0617 (ISSN-L)
- OpenAlex
- W2116758077
- Cited by
- 587
- References
- 16
- FWCI
- 51.70
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Translating Pseudo-Boolean Constraints into SAT. https://app.cochat.ai/papers/10.3233/sat190014
- The paper
- Eén, N., & Sörensson, N. (2006). Translating Pseudo-Boolean Constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation. https://doi.org/10.3233/sat190014
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
