Answering regular path queries in expressive Description Logics via alternating tree-automata

apropos: cite:DBLP:journals/iandc/CalvaneseEO14

Portée

Requête

P2RPQs : positive (existential) two-way regular path queries, conjunction and disjunction of 2RPQs

Raisonnement

Implémentation

Dans la conclusion, il est dit que leur approche n'est pas implémentable :

Another drawback of the approaches based on automata on infinite trees is that they have so far resisted implementation.

This post accepts webmentions. Do you have the URL to your post?

Otherwise, send your comment on my service.

Or interact from the fediverse with your username:

fediverse logo Share on the Fediverse