Research map / Learning theory and algorithms / Combinatorial and search optimization
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use pseudo-Boolean proofs with extension variables instead of DRAT for certifying XOR reasoning | SAT solver with Gaussian-elimination parity reasoning · SAT instances with XOR constraints | proof logging overhead | Helped |
| Use pseudo-Boolean proofs with extension variables instead of DRAT for certifying XOR reasoning | SAT solver with Gaussian-elimination parity reasoning · SAT instances with XOR constraints | proof size | Helped |
| Use pseudo-Boolean proofs with extension variables instead of DRAT for certifying XOR reasoning | SAT solver with Gaussian-elimination parity reasoning · SAT instances with XOR constraints | verification time | Helped |
Closest papers by meaning
- Unifying Decision and Function Queries in Stochastic Boolean Satisfiability (AAAI 2024 · similarity 0.88)
- Hardness of Random Reordered Encodings of Parity for Resolution and CDCL (AAAI 2024 · similarity 0.88)
- Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking (AAAI 2025 · similarity 0.87)
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.87)
- Certifying Bounds Propagation for Integer Multiplication Constraints (AAAI 2025 · similarity 0.86)
- Can Transformers Reason Logically? A Study in SAT Solving (ICML 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.