Subsumption in FL_bot_reg and FL_reg is PSpace-complete without TBoxes and ExpTime-complete with TBoxes via reduction to parity pushdown games.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
citing papers explorer
-
Subsumption in $\mathcal{FL}_{\bot \mathit{reg}}$ with TBoxes Is in ExpTime
Subsumption in FL_bot_reg and FL_reg is PSpace-complete without TBoxes and ExpTime-complete with TBoxes via reduction to parity pushdown games.
-
Visibly Recursive Automata
Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.