Similar Items: Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
- Consistency and Completeness of Rewriting in the Calculus of Constructions
- Datalog Rewritings of Regular Path Queries using Views
- Domain Representations Induced by Dyadic Subbases
- Existence of strongly proper dyadic subbases
- Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting
- Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees