boolean satisfiability

Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUs AAAI 2025 SATBench: Benchmarking LLMs’ Logical Reasoning via Automated Puzzle Generation from SAT Formulas EMNLP 2025 An Eager Satisfiability Modulo Theories Solver for Algebraic Datatypes AAAI 2024 A SAT Solver + Computer Algebra Attack on the Minimum Kochen–Specker Problem IJCAI 2024 HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation NeurIPS 2024 Learning Plaintext-Ciphertext Cryptographic Problems via ANF-based SAT Instance Representation NeurIPS 2024 MixSATGEN: Learning Graph Mixing for SAT Instance Generation ICLR 2024 Dagster: Parallel Structured Search AAAI 2023 Fast Algorithms for SAT with Bounded Occurrences of Variables IJCAI 2023 Learning When to Use Automatic Tabulation in Constraint Model Reformulation IJCAI 2023 Solving Quantum-Inspired Perfect Matching Problems via Tutte-Theorem-Based Hybrid Boolean Constraints IJCAI 2023 Actionable Model-Centric Explanations (Student Abstract) AAAI 2022 Augment with Care: Contrastive Learning for Combinatorial Problems ICML 2022 Faster Algorithms for Weak Backdoors AAAI 2022 On Probabilistic Generalization of Backdoors in Boolean Satisfiability AAAI 2022 Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract) IJCAI 2021 Explanation in Constraint Satisfaction: A Survey IJCAI 2021 On Continuous Local BDD-Based Search for Hybrid SAT Solving AAAI 2021 Outside Computation with Superior Functions NAACL 2021 Check before You Change: Preventing Correlated Failures in Service Updates NSDI 2020 Controllability of Control Argumentation Frameworks IJCAI 2020 Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms AAAI 2020 FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints AAAI 2020 Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem IJCAI 2020 Constraint-based Learning of Phonological Processes EMNLP 2019