Co-occurring keywords · papers mentioning both
Papers
Model Counting for Dependency Quantified Boolean Formulas
AAAI 2026
Breaking Symmetries in Quantified Graph Search: A Comparative Study
AAAI 2025
Computationally Hard Problems Are Hard for QBF Proof Systems Too
AAAI 2025
Proof Simulation via Round-based Strategy Extraction for QBF
AAAI 2025
Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking
AAAI 2025
A Top-Down Tree Model Counter for Quantified Boolean Formulas
IJCAI 2024
Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs
AAAI 2024
Solving Quantified Boolean Formulas with Few Existential Variables
IJCAI 2024
Circuit Minimization with QBF-Based Exact Synthesis
AAAI 2023
Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers
AAAI 2023
Is Shortest Always Best? The Role of Brevity in Logic-to-Text Generation
ACL 2023
Second-Order Quantified Boolean Logic
AAAI 2023
Solving Explainability Queries with Quantification: The Case of Feature Relevancy
AAAI 2023
QCDCL with Cube Learning or Pure Literal Elimination - What is Best?
IJCAI 2022
A Sharp Leap from Quantified Boolean Formula to Stochastic Boolean Satisfiability Solving
AAAI 2021
Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty
AAAI 2021
Toward Determining NFA Equivalence via QBFs (Student Abstract)
AAAI 2021
A QSAT Benchmark Based on Vertex-Folkman Problems (Student Abstract)
AAAI 2020
Controllability of Control Argumentation Frameworks
IJCAI 2020
Learning Heuristics for Quantified Boolean Formulas through Reinforcement Learning
ICLR 2020
Dynamic Dependency Awareness for QBF
IJCAI 2018
Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection
IJCAI 2018
Generating Hard Random Boolean Formulas and Disjunctive Logic Programs
IJCAI 2017
Solving Stochastic Boolean Satisfiability under Random-Exist Quantification
IJCAI 2017