Search Results for author:
Found 2 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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
