conftrace_

proof complexity

9 papers

Explore in graph

Co-occurring keywords · papers mentioning both

quantified boolean formula (5) resolution proof (3) proof system (3) sat solver (3) cnf formula (1) hardness number (1) model counting (1) constraint learning (1) symmetry breaking (1) strategy extraction (1)

Papers

Proof Systems for Tensor-based Model Counting AAAI 2026 Computationally Hard Problems Are Hard for QBF Proof Systems Too AAAI 2025 MathGAP: Out-of-Distribution Evaluation on Problems with Arbitrarily Complex Proofs ICLR 2025 Proof Simulation via Round-based Strategy Extraction for QBF AAAI 2025 Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs AAAI 2024 QCDCL with Cube Learning or Pure Literal Elimination - What is Best? IJCAI 2022 Finding the Hardest Formulas for Resolution (Extended Abstract) IJCAI 2021 On Irrelevant Literals in Pseudo-Boolean Constraint Learning IJCAI 2020 Dynamic Dependency Awareness for QBF IJCAI 2018