Relational Kleene algebra with graph loop has a PSPACE-complete equational theory over relational models.
PDL with intersection and converse: satisfiability and infinite-state model checking
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2025 2representative citing papers
GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.
citing papers explorer
-
The Equational Theory of Relational Kleene Algebra with Graph Loop is PSPACE-Complete
Relational Kleene algebra with graph loop has a PSPACE-complete equational theory over relational models.
-
Guarded Negation Transitive Closure Logic
GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.