Skip to content
conftrace_

sat solver

80 papers

Papers

The Limitations and Power of NP-Oracle Based Functional Synthesis Techniques AAAI 2026 Using Constraint Solvers to Construct Binary Codes with Good Error Correction Performance AAAI 2026 A SAT-based Method for Counting All Singleton Attractors in Boolean Networks IJCAI 2025 Certifying Bounds Propagation for Integer Multiplication Constraints AAAI 2025 Complete Symmetry Breaking for Finite Models AAAI 2025 The Impact of Literal Sorting on Cardinality Constraint Encodings AAAI 2025 Towards Real-Time Approximate Counting AAAI 2025 Auditable Algorithms for Approximate Model Counting AAAI 2024 Computing the Why-Provenance for Datalog Queries via SAT Solvers AAAI 2024 HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation NeurIPS 2024 Hardness of Random Reordered Encodings of Parity for Resolution and CDCL AAAI 2024 On the Hardness of Probabilistic Neurosymbolic Learning ICML 2024 Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs AAAI 2024 SAT-Based Algorithms for Regular Graph Pattern Matching AAAI 2024 SAT-Based Techniques for Lexicographically Smallest Finite Models AAAI 2024 SAT-Based Tree Decomposition with Iterative Cascading Policy Selection AAAI 2024 Weighted, Circular and Semi-Algebraic Proofs (Abstract Reprint) IJCAI 2024 A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers IJCAI 2023 Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract). IJCAI 2023 Co-Certificate Learning with SAT Modulo Symmetries IJCAI 2023 Counting Knot Mosaics with ALLSAT (Student Abstract) AAAI 2023 Probabilistic Generalization of Backdoor Trees with Application to SAT AAAI 2023 Proofs and Certificates for Max-SAT (Extended Abstract) IJCAI 2023 SAT-Based PAC Learning of Description Logic Concepts IJCAI 2023 The Multi-Agent Transportation Problem AAAI 2023