The equational theory of relational Kleene algebra with graph loop is PSPACE-complete, and this PSPACE bound extends to top, tests, converse, and nominals, resolving the complexity of relational KAT with domain.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Equational Theory of Relational Kleene Algebra with Graph Loop is PSPACE-Complete
The equational theory of relational Kleene algebra with graph loop is PSPACE-complete, and this PSPACE bound extends to top, tests, converse, and nominals, resolving the complexity of relational KAT with domain.