Similar Items: Pseudo-Complex Quantifier Elimination
- Goedel Logics: On the Elimination of The Absoluteness Operator
- A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers
- On the Complexity of Robust Markov Decision Processes and Bisimulation Metrics
- Verification of Neural Networks (Lecture Notes)
- Quantum Bayesian Networks: Compositionality and Typing via Linear Logic
- Automaton-based Characterisations of First Order Logic over Infinite Trees