Search Results for author:
Found 4 papers, 0 papers with code
Polynomial Rewritings from Expressive Description Logics with Closed Predicates to Variants of Datalog
Our main result is to show that every query in this non-monotonic query language can be translated in polynomial time into Datalog with negation under the stable model semantics.
Managing Change in Graph-structured Data Using Description Logics (long version with appendix)
In this paper, we consider the setting of graph-structured data that evolves as a result of operations carried out by users or applications.
Nested Regular Path Queries in Description Logics
Two-way regular path queries (2RPQs) have received increased attention recently due to their ability to relate pairs of objects by flexibly navigating graph-structured data.
Reasoning about Explanations for Negative Query Answers in DL-Lite
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services.
