Research map / Learning theory and algorithms / Combinatorial and search optimization
Justifying All Differences Using Pseudo-Boolean Reasoning
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 |
|---|---|---|---|
| turn on pseudo-Boolean proof logging in the CP solver | certified constraint solver · 25x25 unsatisfiable Sudoku, representative instance | solve time (s): 41 -> 42 | No clear effect |
| deliberately introduce bugs (missed augmenting steps, omitted Hall set logging) and run proof verifier | proof verifier · 25x25 Sudoku | bug detection | Helped |
Closest papers by meaning
- Certifying Bounds Propagation for Integer Multiplication Constraints (AAAI 2025 · similarity 0.91)
- Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths (AAAI 2024 · similarity 0.85)
- MPS-Prover: Advancing Stepwise Theorem Proving by Multi-Perspective Search and Data Curation (NeurIPS 2025 · similarity 0.85)
- Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking (AAAI 2025 · similarity 0.85)
- Can Transformers Reason Logically? A Study in SAT Solving (ICML 2025 · similarity 0.84)
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.84)
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.