Co-occurring keywords · papers mentioning both
Papers
Verifying Quantized Graph Neural Networks is PSPACE-complete
IJCAI 2025
On Verifying Expectations and Observations of Intelligent Agents
IJCAI 2022
Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility
AAAI 2021
Toward Determining NFA Equivalence via QBFs (Student Abstract)
AAAI 2021
A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving
AAAI 2019
Dynamic logic of parallel propositional assignments and its applications to planning
IJCAI 2019