sat solver

Hard Examples for Common Variable Decision Heuristics AAAI 2020 In Search for a SAT-friendly Binarized Neural Network Architecture ICLR 2020 Learning Interpretable Models in the Property Specification Language IJCAI 2020 Online Bayesian Moment Matching based SAT Solver Heuristics ICML 2020 TouIST: a Friendly Language for Propositional Logic and More IJCAI 2020 A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples AAAI 2019 BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting AAAI 2019 Clause Learning and New Bounds for Graph Coloring IJCAI 2019 Enumerating Potential Maximal Cliques via SAT and ASP IJCAI 2019 Finding Justifications by Approximating Core for Large-scale Ontologies IJCAI 2019 G2SAT: Learning to Generate SAT Formulas NeurIPS 2019 Identifying Bottlenecks in Practical SAT-Based Model Finding for First-Order Logic Ontologies with Datasets AAAI 2019 Learning Local Search Heuristics for Boolean Satisfiability NeurIPS 2019 On Division Versus Saturation in Pseudo-Boolean Solving IJCAI 2019 Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring IJCAI 2019 An Empirical Study of Branching Heuristics through the Lens of Global Learning Rate IJCAI 2018 Divide and Conquer: Towards Faster Pseudo-Boolean Solving IJCAI 2018 Learning Optimal Decision Trees with SAT IJCAI 2018 Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving IJCAI 2018 Seeking Practical CDCL Insights from Theoretical SAT Benchmarks IJCAI 2018 An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers IJCAI 2017 A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality IJCAI 2017 Generating Hard Random Boolean Formulas and Disjunctive Logic Programs IJCAI 2017 Locality in Random SAT Instances IJCAI 2017 Scalable Constraint-based Virtual Data Center Allocation IJCAI 2017