ELbotpreceq extends DL-Lite with reachability and limited conjunction while keeping NL reasoning complexity through rewriting into nested two-way regular path queries.
Then, our derivation restricted to the first ๐โ1 elements is a (๐ฏ, โ) -derivation of B(a) from ๐ of length ๐โ1
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Horn extension of DL-Lite with NL data complexity
ELbotpreceq extends DL-Lite with reachability and limited conjunction while keeping NL reasoning complexity through rewriting into nested two-way regular path queries.