Co-occurring keywords · papers mentioning both
Papers
Understand Restart of SAT Solver Using Search Similarity Index (Student Abstract)
AAAI 2023
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation
AAAI 2022
Enumerating Nontrivial Knot Mosaics with SAT (Student Abstract)
AAAI 2022
On Computing Probabilistic Explanations for Decision Trees
NeurIPS 2022
On Probabilistic Generalization of Backdoors in Boolean Satisfiability
AAAI 2022
Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination
AAAI 2022
QCDCL with Cube Learning or Pure Literal Elimination - What is Best?
IJCAI 2022
Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract)
IJCAI 2021
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs
AAAI 2021
Decomposition-Guided Reductions for Argumentation and Treewidth
IJCAI 2021
Finding the Hardest Formulas for Resolution (Extended Abstract)
IJCAI 2021
Learning Branching Heuristics for Propositional Model Counting
AAAI 2021
On Continuous Local BDD-Based Search for Hybrid SAT Solving
AAAI 2021
On Explaining Random Forests with SAT
IJCAI 2021
Optimising Automatic Calibration of Electric Muscle Stimulation
AAAI 2021
OzoMorph: Demonstrating Colored Multi-Agent Path Finding on Real Robots
AAAI 2021
Skeptical Reasoning with Preferred Semantics in Abstract Argumentation without Computing Preferred Extensions
IJCAI 2021
A Cardinal Improvement to Pseudo-Boolean Solving
AAAI 2020
Assessing SATNet's Ability to Solve the Symbol Grounding Problem
NeurIPS 2020
Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver?
NeurIPS 2020
Constructing Minimal Perfect Hash Functions Using SAT Technology
AAAI 2020
Deciding Acceptance in Incomplete Argumentation Frameworks
AAAI 2020
Efficient Exact Verification of Binarized Neural Networks
NeurIPS 2020
Efficient Model-Based Diagnosis of Sequential Circuits
AAAI 2020
Guiding CDCL SAT Search via Random Exploration amid Conflict Depression
AAAI 2020