Co-occurring keywords · papers mentioning both
Papers
Learning depth-3 circuits via quantum agnostic boosting
COLT 2026
BoolXAI: Explainable AI Using Expressive Boolean Formulas
AAAI 2025
Testing Juntas and Junta Subclasses with Relative Error
COLT 2025
An Approximate Skolem Function Counter
AAAI 2024
Auditable Algorithms for Approximate Model Counting
AAAI 2024
Composing Biases by Using CP to Decompose Minimal Functional Dependencies for Acquiring Complex Formulae
AAAI 2024
Solving the Identifying Code Set Problem with Grouped Independent Support
IJCAI 2023
DPSampler: Exact Weighted Sampling Using Dynamic Programming
IJCAI 2022
Faster Algorithms for Weak Backdoors
AAAI 2022
On the Computation of Necessary and Sufficient Explanations
AAAI 2022
Faster and Better Simple Temporal Problems
AAAI 2021
The Power of Literal Equivalence in Model Counting
AAAI 2021
ADDMC: Weighted Model Counting with Algebraic Decision Diagrams
AAAI 2020
A Formal Approach for Cautious Reasoning in Answer Set Programming (Extended Abstract)
IJCAI 2020
Efficient Inference of Optimal Decision Trees
AAAI 2020
Liveness Verification of Stateful Network Functions
NSDI 2020
Boosting MCSes Enumeration
IJCAI 2018
On Minimum Representations of Matched Formulas (Extended Abstract)
IJCAI 2017
Symbolic LTLf Synthesis
IJCAI 2017